Continuous-variable quantum information, encoded into infinite-dimensional quantum systems, is a promising platform for the realization of many quantum information protocols, including quantum computation, quantum metrology, quantum cryptography, and quantum communication. To successfully demonstrate these protocols, an essential step is the certification of multimode continuous-variable quantum states and quantum devices. This problem is well studied under the assumption that multiple uses of the same device result into identical and independently distributed (i.i.d.) operations. However, in realistic scenarios, identical and independent state preparation and calls to the quantum devices cannot be generally guaranteed. Important instances include adversarial scenarios and instances of time-dependent and correlated noise. In this paper, we propose the first set of reliable protocols for verifying multimode continuous-variable entangled states and devices in these non-i.i.d scenarios. Although not fully universal, these protocols are applicable to Gaussian quantum states, non-Gaussian hypergraph states, as well as amplification, attenuation, and purification of noisy coherent states.
Verification is a task to check whether a given quantum state is close to an ideal state or not. In this paper, we show that a variety of many-qubit quantum states can be verified with only sequential single-qubit measurements of Pauli operators. First, we introduce a protocol for verifying ground states of Hamiltonians. We next explain how to verify quantum states generated by a certain class of quantum circuits. We finally propose an adaptive test of stabilizers that enables the verification of all polynomial-time-generated hypergraph states, which include output states of the Bremner-Montan…
We give a scheme for interpreting shaded tangles as quantum circuits, with the property that if two shaded tangles are ambient isotopic, their corresponding computational effects are identical. We analyze 11 known quantum procedures in this way -- including entanglement manipulation, error correction and teleportation -- and in each case present a fully-topological formal verification, yielding generalized procedures in some cases. We also use our methods to identify 2 new procedures, for topological state transfer and quantum error correction. Our formalism yields in some cases significant ne…
Authentication of quantum sources is a crucial task in building reliable and efficient protocols for quantum-information processing. Steady progress vis-à-vis verification of quantum devices in the scenario with fully characterized measurement devices has been observed in recent years. When it comes to the scenario with uncharacterized measurements, the so-called black-box scenario, practical verification methods are still rather scarce. Development of self-testing methods is an important step forward, but these results so far have been used for reliable verification only by considering the as…
In recent years, many computational tasks have been proposed as candidates for showing a quantum computational advantage, that is an advantage in the time needed to perform the task using a quantum instead of a classical machine. Nevertheless, practical demonstrations of such an advantage remain particularly challenging because of the difficulty in bringing together all necessary theoretical and experimental ingredients. Here, we show an experimental demonstration of a quantum computational advantage in a prover-verifier interactive setting, where the computational task consists in the verific…
Chandran et al. (SIAM J. Comput.'14) formally introduced the cryptographic task of position verification, where they also showed that it cannot be achieved by classical protocols. In this work, we initiate the study of position verification protocols with classical verifiers. We identify that proofs of quantumness (and thus computational assumptions) are necessary for such position verification protocols. For the other direction, we adapt the proof of quantumness protocol by Brakerski et al. (FOCS'18) to instantiate such a position verification protocol. As a result, we achieve classically ver…
We construct a classically verifiable succinct interactive argument for quantum computation (BQP) with communication complexity and verifier runtime that are poly-logarithmic in the runtime of the BQP computation (and polynomial in the security parameter). Our protocol is secure assuming the post-quantum security of indistinguishability obfuscation (iO) and Learning with Errors (LWE). This is the first succinct argument for quantum computation in the plain model; prior work (Chia-Chung-Yamakawa, TCC '20) requires both a long common reference string and non-black-box use of a hash function mode…
The de Finetti representation theorem for continuous variable quantum system is first developed to approximate an N-partite continuous variable quantum state with a convex combination of independent and identical subsystems, which requires the original state to obey permutation symmetry conditioned on successful experimental verification on k of N subsystems. We generalize the de Finetti theorem to include asymmetric bounds on the variance of canonical observables and biased basis selection during the verification step. Our result thereby enables application of infinite-dimensional de Finetti …
One of the main challenges of quantum information is the reliable verification of quantum entanglement. The conventional detection schemes require repeated measurement on a large number of identically prepared systems. This is hard to achieve in practice when dealing with large-scale entangled quantum systems. In this letter we develop a novel method by formulating verification as a decision procedure, i.e. entanglement is seen as the ability of quantum system to answer certain "yes-no questions". We show that for a variety of large quantum states even a single copy suffices to detect entangle…
The construction of public key quantum money based on standard cryptographic assumptions is a longstanding open question. Here we introduce franchised quantum money, an alternative form of quantum money that is easier to construct. Franchised quantum money retains the features of a useful quantum money scheme, namely unforgeability and local verification: anyone can verify banknotes without communicating with the bank. In franchised quantum money, every user gets a unique secret verification key, and the scheme is secure against counterfeiting and sabotage, a new security notion that appears i…
Certifying quantum states without independence assumptions
ICFO - Institut de Ciències Fotòniques, The Barcelona Institute of Science and Technology（光子科学研究所，巴塞罗那科学技术学院）；Luxquanta Technologies S.L.（Luxquanta科技有限公司）
One of the main figures of merit for quantum memories and quantum communication devices is their quantum capacity. It has been studied for arbitrary kinds of quantum channels, but its practical estimation has so far been limited to devices that implement independent and identically distributed (i.i.d.) quantum channels, where each qubit is affected by the same noise process. Real devices, however, typically exhibit correlated errors. Here, we overcome this limitation by presenting protocols that estimate a channel's one-shot quantum capacity for the case where the device acts on (an arbitrary …
Assuming that the free energy of a gas depends non-locally on the logarithm of its mass density, the body force in the resulting equation of motion consists of the sum of density gradient terms. Truncating this series after the second term, Bohm's quantum potential and the Madelung equation are identically obtained, showing explicitly that some of the hypotheses that led to the formulation of quantum mechanics admit a classical interpretation based on non-locality.
Quantum Position Verification with Remote Untrusted Devices
University of Colorado, Boulder（科罗拉多大学博尔德分校）；National Institute of Standards and Technology（美国国家标准与技术研究院）；Oak Ridge National Laboratory（橡树岭国家实验室）；University of New Orleans（新奥尔良大学）；Joint Quantum Institute, National Institute of Standards and Technology and University of Maryland（国立量子研究所（美国国家标准与技术研究院与马里兰大学联合））；Concordia University（康考迪亚大学）；Joint Center for Quantum Information and Computer Science, University of Maryland（量子信息与计算机科学联合中心（马里兰大学））；University of Maryland（马里兰大学）
