Science
Science: physics, biology, chemistry, astronomy and space, neuroscience, and research explained.
-
Applied Network Science appliednetsci.springeropen.com
-
Network Analysis and Modeling (Computer Science) aaronclauset.github.io
-
Apache OODT oodt.apache.org
capturing, processing and sharing of data for NASA's scientific archives.
-
Data Science at Scale with Python and Dask manning.com
Data Science at Scale with Python and Dask teaches you how to build distributed data projects that can handle huge amounts of data.
-
Apache Iceberg iceberg.apache.org
open table format for huge analytic datasets with schema evolution, hidden partitioning, and time travel.
-
Drizzle drizzle.org
evolution of MySQL 6.0.
-
Facebook HydraBase code.facebook.com
evolution of HBase made by Facebook.
-
Data Science and Engineering with Apache Spark (edX XSeries) edx.org
Series of five courses (Introduction to Apache Spark, Distributed Machine Learning with Apache Spark, Big Data Analysis with Apache Spark, Advanced Apache Spark for Data Science and Data Engineering, Advanced Distributed Machine Learning with Apache Spark) covering different…
-
Latent Space latent.space
Technical deep dives on AI engineering, from model training to deployment.
-
Best Data Science Books appliedaicourse.com
This blog offers a curated list of top data science books, categorized by topics and learning stages, to aid readers in building foundational knowledge and staying updated with industry trends.
-
Tagging systems (2006) patents.google.com
Introduces QPV under the name of 'quantum tagging'.
-
Position-based quantum cryptography and catalytic computation (2016) eprints.illc.uva.nl
Chapter 5 independently generalises BB84 QPV to more input bases. Chapter 4 provides an efficient attack on the protocol based on interleaved unitaries.
-
Instantaneous non-local computation of low T-depth quantum circuits (2016) doi.org
Provides a general attack on QPV using an exponential amount of pre-shared EPR pairs in the number of T-gates or T-depth based on the circuit decomposition of the task unitary into Clifford+T gates.
-
Beating classical impossibility of position verification (2022) doi.org
Constructs a QPV protocol with only classical input and output information from the assumption that LWE is quantum-hard. Shows unconditional security in the random oracle model.
-
Relating non-local quantum computation to information theoretic cryptography (2023) doi.org
Connects $f$-routing to topics in classical cryptography, in particular conditional disclosure of secrets. Shows a sub-exponential upper bound for attacks for any $f$ and finds an $f$ that is believed to be outside of $\mathsf{P}$ (with pre-processing), but efficiently attacked.
-
Position-based quantum cryptography: Impossibility and constructions (2011) doi.org
Shows security against unentangled attacks.
-
Bounds on instantaneous non-local quantum computation (2020) doi.org
Shows that any 2-qubit unitary can be attacked up to error $\varepsilon$ using $\log(1/\varepsilon)$ EPR pairs and that any hermitian bipartite binary controlled unitary can be attacked with 1 EPR pair. Shows logarithmic lower bound on entanglement entropy for general bipartite…
-
Quantum location verification in noisy channels (2010) doi.org
Studies QPV based on Bell states, GHZ states and entanglement swapping. Studies the effect of noise/decoherence.
-
Tightly characterises the secure region of the protocol depending on the loss and error rates.
-
Loss-tolerant quantum secure positioning with weak laser sources (2016) doi.org
Studies a version of the protocol with separable inputs. Proves full loss tolerance and studies practical implementation based on decoy states.
-
Popescu-Rohrlich correlations imply efficient instantaneous nonlocal quantum computation (2016) doi.org
Shows that if attackers share PR boxes, then any unitary can be attacked using only linear entanglement and a linear number of PR box uses.
-
Practical position-based quantum cryptography (2015) doi.org
Considers the case where the two input bases are related by a unitary $U$.
-
Loss-tolerant position-based quantum cryptography (2015) doi.org
Generalises BB84 QPV to more input bases and notes better loss tolerance properties because of it. Also discusses using decoy states and continuous variables for BB84 QPV.
-
Quantum tagging for tags containing secret classical data (2011) doi.org
Considers QPV in the setting when the verifiers and the prover pre-share a secret. Shows that then QPV is unconditionally secure by indefinitely expanding the secret using QKD.
-
Introduces a rooster of different QPV protocols like BB84 QPV, $f$-routing, $f$-BB84 QPV and variations of them. Mentions entanglement-based attacks on some of them.
-
Insecurity of position-based quantum cryptography protocols against entanglement attacks (2011) doi.org
Proves insecurity of QPV protocols that were previously claimed secure and studies general principle underlying entanglement attacks. Studies variations of QPV protocols based on Bell/GHZ states and shows that using eigenstates other than Pauli $X$, $Y$, $Z$ leads to protocols…
-
Location-dependent communications using quantum entanglement (2010) doi.org
Introduces QPV in the academic literature, but incorrectly claims unconditional security. Studies QPV based on Bell states.
-
Towards experimental demonstration of quantum position verification using single photons (2025) doi.org
A first demonstration experiment of QPV using the SWAP protocol, with single photons from a single semiconductor quantum dot in an optical microcavity.
-
Practically secure quantum position verification (2021) doi.org
Gives an overview over the existing protocols at the time and mixes elements of them to obtain different variations of those protocols.
-
A monogamy-of-entanglement game with applications to device-independent quantum cryptography (2013) doi.org
Shows a tight upper bound for unentangled attacks, parallel repetition and a linear lower bound for the repeated protocol.
-
Provides a general attack on QPV based on port-based teleportation, using an exponential amount of pre-shared EPR pairs in the number of input qubits. Also provides a QPV protocol with a provably linear lower bound.
-
Quantum tasks in Minkowski space (2012) doi.org
Considers more general quantum tasks than QPV.
-
Quantum position verification in bounded-attack-frequency model (2016) doi.org
Considers BB84 QPV with non-simultaneous arrival times of input information at the prover (the basis being encoded in which side arrived first). Discusses the general port-based attack in this setting.
-
Geometry of Banach spaces: A new route towards position based cryptography (2021) doi.org
Provides a new protocol based on applying a phase unitary depending on the classical input information. Shows an exponential lower bound under a regularity assumption on the attack, and an exponential lower bound conditioned on an, as yet, unresolved Banach space geometry…
-
Quantum tasks in holography (2019) doi.org
Connects QPV to the AdS/CFT conjecture by noting that a QPV protocol in the bulk must have an equivalent protocol in the boundary. The boundary implementation turns out to be a valid attack on the bulk QPV protocol, implementing it non-locally.
-
Security of position-based quantum cryptography limits Hamiltonian simulation via holography (2024) doi.org
Connects QPV to Hamiltonian simulation. Shows that if a superlinear lower bound can be shown for QPV attacks, then there are new fundamental lower bounds for resources required for one Hamiltonian to simulate another.
-
Quantum position verification in the random oracle model (2014) doi.org
Considers QPV in higher dimensions carefully and shows unconditional security in the random oracle model.
-
Quantum Secure Key Exchange with Position-based Credentials (2025) arxiv.org
Improved analysis of how to use QPV to provide the authentication within QKD.
-
A complexity theory for non-local quantum computation (2025) arxiv.org
Finds relations between a wide range of different NLQC tasks, including showing that $f$-routing and $f$-BB84 are equivalent, with a constant-overhead reduction between them.
-
Continuous-variable quantum position verification secure against entangled attackers (2024) arxiv.org
Generalises $f$-BB84 QPV to continuous-variable inputs and shows analogous security statements as for finite-dimensional inputs.
-
Linear gate bounds against natural functions for position-verification (2024) arxiv.org
Provides a robust linear lower bound on the number of quantum gates/measurements needed to attack the inner product function.
-
Rank lower bounds on non-local quantum computation (2024) arxiv.org
Provides a lower bound in terms of the Schmidt-rank of the resource state for perfect attacks. Gives linear lower bounds for some concrete functions.
-
Introduces an extra commitment step into QPV and shows that for a class of protocols, involving $f$-BB84 QPV, this makes the transmission loss irrelevant for security. Argues $f$-BB84 is a practical QPV protocol.
-
On the role of quantum communication and loss in attacks on quantum position verification (2022) arxiv.org
Shows that any QPV protocol that can be broken unentangled with quantum communication, but is secure against classical communication attacks, can be transformed into one that is secure against quantum communication attacks. Also notes that if the signal loss is high enough any…
-
Towards practical quantum position verification (2023) arxiv.org
Delves into some technical hardware details of a practical QPV implementation.
-
Security of a continuous-variable based quantum position verification protocol (2023) arxiv.org
Generalises the protocol to continuous variable inputs and shows security against unentangled attacks depending on loss and noise rates.
-
Holography as a resource for non-local quantum computation (2022) arxiv.org
Discusses and fills a loophole in the paper one above. Costructs an attacked based on simulating a holographic CFT and argues that, based on some assumptions, any polynomially complex unitary can be efficiently attacked.
-
On the role of quantum communication and loss in attacks on quantum position verification (2022) arxiv.org
Proves a 3/4 upper bound on the success probability of unentangled attacks.
-
Non-local computation of quantum circuits with small light cones (2022) arxiv.org
Provides a general attack on QPV based on the geometric structure of a circuit decomposition of the task unitary. Is more efficient for certain classes of unitaries than previous general attacks.
-
Towards practical and error-robust quantum position verification (2021) arxiv.org
Defines a new protocol based on the SWAP test and studies it theoretically and practically.
- next page of items loading…
