Related papers: Classical to quantum in large number limit
We propose a measure of quantumness based on an addition-then-subtraction operation. We demonstrate how this measure can distinguish between classical and bosonic particles by investigating in detail multi-particle bosonic systems.…
Quantum coherence, present whenever a quantum system exists in a superposition of multiple classically distinct states, marks one of the fundamental departures from classical physics. Quantum coherence has recently been investigated…
We define the notion of a proof of knowledge in the setting where the verifier is classical, but the prover is quantum, and where the witness that the prover holds is in general a quantum state. We establish simple properties of our…
We explore the possibility of accelerating the formal verification of classical programs with a quantum computer. A common source of security flaws stems from the existence of common programming errors like use after free, null-pointer…
Quantum computers are on the brink of surpassing the capabilities of even the most powerful classical computers. This naturally raises the question of how one can trust the results of a quantum computer when they cannot be compared to…
A test of quantumness is a protocol where a classical user issues challenges to a quantum device to determine if it exhibits non-classical behavior, under certain cryptographic assumptions. Recent attempts to implement such tests on current…
In support of the growing interest in quantum computing experimentation, programmers need new tools to write quantum algorithms as program code. Compared to debugging classical programs, debugging quantum programs is difficult because…
The power of quantum computers is still somewhat speculative. While they are certainly faster than classical ones at some tasks, the class of problems they can efficiently solve has not been mapped definitively onto known classical…
Quantum communication devices, such as quantum repeaters, quantum memories, or quantum channels, are unavoidably exposed to imperfections. However, the presence of imperfections can be tolerated, as long as we can verify such devices retain…
Quantum computers are believed to bring computational advantages in simulating quantum many body systems. However, recent works have shown that classical machine learning algorithms are able to predict numerous properties of quantum systems…
We propose an efficient scheme for verifying quantum computations in the `high complexity' regime i.e. beyond the remit of classical computers. Previously proposed schemes remarkably provide confidence against arbitrarily malicious…
A philosophically consistent axiomatic approach to classical and quantum mechanics is given. The approach realizes a strong formal implementation of Bohr's correspondence principle. In all instances, classical and quantum concepts are fully…
A state of a quantum systems can be regarded as {\it classical} ({\it quantum}) with respect to measurements of a set of canonical observables iff there exists (does not exist) a well defined, positive phase space distribution, the so…
Although quantum coherence is a basic trait of quantum mechanics, the presence of coherences in the quantum description of a certain phenomenon does not rule out the possibility to give an alternative description of the same phenomenon in…
This paper introduces quantum ``multiple-Merlin''-Arthur proof systems in which Arthur receives multiple quantum proofs that are unentangled with each other. Although classical multi-proof systems are obviously equivalent to classical…
The area of property testing tries to design algorithms that can efficiently handle very large amounts of data: given a large object that either has a certain property or is somehow "far" from having that property, a tester should…
Quantum states may exhibit asymmetry with respect to the action of a given group. Such an asymmetry of states can be considered as a resource in applications such as quantum metrology, and it is a concept that encompasses quantum coherence…
We propose a general argument to show that if a physical system can mediate locally the generation of entanglement between two quantum systems, then it itself must be non-classical. Remarkably, we do not assume any classical or quantum…
We discuss whether, to what extent and how a quantum computing device can be evaluated and simulated using classical tools.
Recently a test of nonclassicality for a single qubit was proposed [R. Alicki and N. Van Ryn, J. Phys. A: Math. Theor. 41, 062001 (2008)]. We present an optimized experimental realization of this test leading to a 46 standard deviation…