Quantum information processing in phase space: A modular variables approach
arXiv:1512.02957 · doi:10.1103/PhysRevA.94.022325
Abstract
Binary quantum information can be fault tolerantly encoded in states defined in infinite dimensional Hilbert spaces. Such states define a computational basis, and permit a perfect equivalence between continuous and discrete universal operations. The drawback of this encoding is that the corresponding logical states are unphysical, meaning infinitely localized in phase space. We use the modular variables formalism to show that, in a number of protocols relevant for quantum information and for the realization of fundamental tests of quantum mechanics, it is possible to loosen the requirements on the logical subspace without jeopardizing their usefulness or their successful implementation. Such protocols involve measurements of appropriately chosen modular observables that permit the readout of the encoded discrete quantum information from the corresponding logical states. Finally, we demonstrate the experimental feasibility of our approach by applying it to the transverse degrees of freedom of single photons.
15 pages, 4 figures
References in corpus (12)
- Universal Quantum Computation with Continuous-Variable Cluster States
- Experimentally testable state-independent quantum contextuality
- Einstein-Podolsky-Rosen paradox in twin images
- Continuous variable quantum computation with spatial degrees of freedom of photons
- Detecting entanglement in spatial interference
- Detection of transverse entanglement in phase space
- State-independent quantum contextuality for continuous variables
- Contextuality in phase space
- Modeling Leggett-Garg-inequality violation
- Quantum Information Processing by Weaving Quantum Talbot Carpets
- Proposal for a macroscopic test of local realism with phase-space measurements
- Non-classicality tests and entanglement witnesses for macroscopic mechanical superposition states
Cited by in corpus (29)
- Performance and structure of single-mode bosonic codes
- All-Gaussian universality and fault tolerance with the Gottesman-Kitaev-Preskill code
- Progress towards practical qubit computation using approximate Gottesman-Kitaev-Preskill codes
- Improved quantum capacity bounds of Gaussian loss channels and achievable rates with Gottesman-Kitaev-Preskill codes
- Pair-cat codes: autonomous error-correction with low-order nonlinearity
- Modular Bosonic Subsystem Codes
- Equivalence of approximate Gottesman-Kitaev-Preskill codes
- Advances in Bosonic Quantum Error Correction with Gottesman-Kitaev-Preskill Codes: Theory, Engineering and Applications
- Uncertainty Relations for coarse-grained measurements: an overview
- Stabilizer subsystem decompositions for single- and multi-mode Gottesman-Kitaev-Preskill codes
- Subsystem analysis of continuous-variable resource states
- Coherence and realism in the Aharonov-Bohm effect
- Squeezed comb states
- Universal Continuous Variable Quantum Computation Without Cooling
- Dynamical nonlocality in quantum time via modular operators
- General conditions for maximal violation of non-contextuality in discrete and continuous variables
- Universal quantum computing with thermal state bosonic systems
- Two-qubit operations for finite-energy Gottesman-Kitaev-Preskill encodings
- Attoscience in Phase Space
- The Zak transform: a framework for quantum computation with the Gottesman-Kitaev-Preskill code
- Sufficient condition for universal quantum computation using bosonic circuits
- Mutually Unbiased Coarse-Grained Measurements of Two or More Phase-Space Variables
- Coherent-cluster-state generation in networks of degenerate optical parametric oscillators
- Wigner distribution on a double cylinder phase space for studying quantum error correction protocol
- Tomographic entanglement indicators in frequency combs and Talbot carpets
- Stabilization of cat-state manifolds using nonlinear reservoir engineering
- Entropic uncertainty relations for mutually unbiased periodic coarse-grained observables resemble their discrete counterparts
- Periodic discretized continuous observables are neither continuous nor discrete
- Logical channels in approximate Gottesman-Kitaev-Preskill error correction