Continuous Variable Quantum Advantages and Applications in Quantum Optics
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:6O3SRWL6record.jsonopen to challenge →
read the original abstract
This thesis focuses on three main questions in the continuous variable and optical settings: where does a quantum advantage, that is, the ability of quantum machines to outperform classical machines, come from? How to ensure the proper functioning of a quantum machine? What advantages can be gained in practice from the use of quantum information? Quantum advantage in continuous variable comes in particular from the use of so-called non-Gaussian quantum states. We introduce the stellar formalism to characterize these states. We then study the transition from classically simulable models to models which are universal for quantum computing. We show that quantum computational supremacy, the dramatic speedup of quantum computers over their classical counterparts, may be realised with non-Gaussian states and Gaussian measurements. Quantum certification denotes the methods seeking to verify the correct functioning of a quantum machine. We consider certification of quantum states in continuous variable, introducing several protocols according to the assumptions made on the tested state. We develop efficient methods for the verification of a large class of multimode quantum states, including the output states of the Boson Sampling model, enabling the experimental verification of quantum supremacy with photonic quantum computing. We give several new examples of practical applications of quantum information in linear quantum optics. Generalising the swap test, we highlight a connection between the ability to distinguish two quantum states and the ability to perform universal programmable quantum measurements, for which we give various implementations in linear optics, based on the use of single photons or coherent states. Finally, we obtain, thanks to linear optics, the first implementation of a quantum protocol for weak coin flipping, a building block for many cryptographic applications.
This paper has not been read by Pith yet.
Forward citations
Cited by 3 Pith papers
-
Quantum state isomorphism problems for groups
Quantum state isomorphism under group actions is BQP-hard for pure states across nontrivial groups and QSZK-complete for mixed states with finite groups; Pauli group version is BQP-complete and Clifford is GI-hard, ru...
-
Assessing non-Gaussian quantum state conversion with the stellar rank
The approximate stellar rank serves as an operational measure of non-Gaussianity that yields bounds and new no-go results for approximate and probabilistic Gaussian state conversion and distillation.
-
Bosonic quantum error-correcting codes with finite stellar rank
Finite stellar rank creates a trade-off between state-preparation cost and QEC performance for bosonic codes, with rank k=2 optimized encodings surpassing break-even under dephasing.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.