Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1601.02544 · New Journal of Physics

Spacetime replication of continuous variable quantum information

Patrick M. Hayden, Sepehr Nezami, Grant Salton, Barry C. Sanders

Published Aug 25, 2016• 17 citations
arXivHTMLPDF

Abstract

The theory of relativity requires that no information travel faster than light, whereas the unitarity of quantum mechanics ensures that quantum information cannot be cloned. These conditions provide the basic constraints that appear in information replication tasks, which formalize aspects of the behavior of information in relativistic quantum mechanics. In this article, we provide continuous variable (CV) strategies for spacetime quantum information replication that are directly amenable to optical or mechanical implementation. We use a new class of homologically constructed CV quantum error correcting codes to provide efficient solutions for the general case of information replication. As compared to schemes encoding qubits, our CV solution requires half as many shares per encoded system. We also provide an optimized five-mode strategy for replicating quantum information in a particular configuration of four spacetime regions designed not to be reducible to previously performed experiments. For this optimized strategy, we provide detailed encoding and decoding procedures using standard optical apparatus and calculate the recovery fidelity when finite squeezing is used. As such we provide a scheme for experimentally realizing quantum information replication using quantum optics.

DOI
10.1088/1367-2630/18/8/083043

Related papers

Summoning information in spacetime, or where and when can a qubit be?

Patrick M. Hayden, Alex May

Abstract One of the most important properties of quantum information, and the one ultimately responsible for its cryptographic applications, is that it can not be copied. That statement, however, is not completely accurate. While the no-cloning theorem of quantum mechanics prevents quantum information from being copied in space, the reversibility of microscopic physics actually requires that the information be copied in time. In spacetime as a whole, therefore, quantum information is widely replicated but in a restricted fashion. We fully characterize which regions of spacetime can all hold the same quantum information. Because quantum information can be delocalized through quantum error correction and teleportation, it need not follow well-defined trajectories. Instead, replication of the information in any configuration of spacetime regions not leading to violations of causality or the no-cloning principle is allowed. To demonstrate this, we answer the operational question of exactly when the information can be summoned to a set of spacetime points, showing how to do so efficiently using a combination of teleportation and codeword-stabilized quantum codes. This provides a simple and complete description of where and when a qubit can be located in spacetime, revealing a remarkable variety of possibilities.

arXiv:1210.0913•Journal of Physics A Mathematical and Theoretical•Mar 22, 2016•41 citations

Encoding a qubit in an oscillator

Daniel Gottesman, Alexei Kitaev, John P. Preskill

Quantum error-correcting codes are constructed that embed a finite-dimensional code space in the infinite-dimensional Hilbert space of a system described by continuous quantum variables. These codes exploit the noncommutative geometry of phase space to protect against errors that shift the values of the canonical variables q and p. In the setting of quantum optics, fault-tolerant universal quantum computation can be executed on the protected code subspace using linear optical operations, squeezing, homodyne detection, and photon counting; however, nonlinear mode coupling is required for the preparation of the encoded states. Finite-dimensional versions of these codes can be constructed that protect encoded quantum information against shifts in the amplitude or phase of a d-state system. Continuous-variable codes can be invoked to establish lower bounds on the quantum capacity of Gaussian quantum channels.

arXiv:quant-ph/0008040•Physical Review A•Jun 11, 2001•1,664 citations

Verifiable Relativistic Quantum Communication

Yadong Wu

Quantum summoning retrieves quantum information prepared at some point in spacetime at another point, which is randomly chosen from a set of points. This thesis presents an efficient quantum summoning protocol based on a quantum error-correcting code, along with encoding and decoding methods. This protocol reduces space complexity as well as gate complexity of encoding compared to previous best results. Our throughout study of quantum summoning paves the way for investigating relativistic quantum cryptography with quantum summoning as a primitive. This thesis also studies a relativistic continuous-variable quantum secret sharing protocol in non-inertial frame, which includes the effect of acceleration of quantum shares in spacetime. By formulating the relativistic effect as a Gaussian lossy channel, we analyze how the fidelity of quantum secret sharing protocol is affected by this relativistic effect. This investigation relaxes the common assumption of secret sharing in inertial frames and this framework can be applied to other relativistic quantum communication protocols. To efficiently verify bosonic quantum channels, I propose a framework of verification of quantum channels plus average-fidelity witness. For both multi-mode Gaussian unitary channels and single-mode amplifying channels, I present efficient verification protocols utilizing only two-mode squeezed vacuum states and homodyne detections. Our work is significant in verification of quantum components in continuous-variable quantum information processing.

•Nov 1, 2019•0 citations

Practical unclonable encryption with continuous variables

Arpan Akash Ray, Boris Škorić

We propose the first continuous-variable (CV) unclonable encryption scheme, extending the paradigm of quantum encryption of classical messages to CV systems. In our construction, a classical message is first encrypted classically and then encoded using an error-correcting code. Each bit of the codeword is mapped to a CV mode by creating a coherent state which is squeezed in the q or p quadrature direction, with a small displacement that encodes the bit. The squeezing directions are part of the encryption key. We prove unclonability in the framework introduced by Broadbent and Lord, via a reduction of the cloning game to a CV monogamy-of-entanglement game. Furthermore, we demonstrate that our scheme can be readily implemented with current technology. By incorporating realistic imperfections such as channel noise and detector inefficiencies, we show that the protocol remains robust under these conditions.

arXiv:2503.02648•Physical Review A•Jul 15, 2026•1 citation

Quantum information with modular variables

Andreas Ketterer, Stephen Patrick Walborn, Arne Keller +2 more

We introduce a novel strategy, based on the use of modular variables, to encode and deterministically process quantum information using states described by continuous variables. Our formalism leads to a general recipe to adapt existing quantum information protocols, originally formulated for finite dimensional quantum systems, to infinite dimensional systems described by continuous variables. This is achieved by using non unitary and non-gaussian operators, obtained from the superposition of gaussian gates, together with adaptative manipulations in qubit systems defined in infinite dimensional Hilbert spaces. We describe in details the realization of single and two qubit gates and briefly discuss their implementation in a quantum optical set-up.

arXiv:1406.6388•Jun 24, 2014•6 citations

Classical Shadow Tomography for Continuous Variables Quantum Systems

Simon Becker, Nilanjana Datta, Ludovico Lami +1 more

In this article we develop a continuous variable (CV) shadow tomography scheme with wide ranging applications in quantum optics. Our work is motivated by the increasing experimental and technological relevance of CV systems in quantum information, quantum communication, quantum sensing, quantum simulations, quantum computing and error correction. We introduce two experimentally realisable schemes for obtaining classical shadows of CV (possibly non-Gaussian) quantum states using only randomised Gaussian unitaries and easily implementable Gaussian measurements such as homodyne and heterodyne detection. For both schemes, we show thatN=O(poly (1 /ϵ, log (1/δ),Mr+αn, log(m) )) samples of an unknownm-mode state ρ suffice to learn the expected value of anyr-local polynomial in the canonical observables of degree α, both with high probability 1 - δ and accuracy ϵ, as long as the state ρ has moments of ordern> α bounded byMn. By simultaneously truncating states and operators in energy and phase space, we are able to overcome new mathematical challenges that arise due to the infinite-dimensionality of CV systems. We also provide a scheme to learn nonlinear functionals of the state, such as entropies over any small number of modes, by leveraging recent energy-constrained entropic continuity bounds. Finally, we provide numerical evidence of the efficiency of our protocols in the case of CV states of relevance in quantum information theory, including ground states of quadratic Hamiltonians of many-body systems and cat qubit states. We expect our scheme to provide good recovery in learning relevant states of 2D materials and photonic crystals.

arXiv:2211.07578•IEEE Transactions on Information Theory•Jan 26, 2024•51 citations
The theory of relativity requires that no information travel faster than light, whereas the unitarity of quantum mechanics ensures that quantum information cannot be cloned. These conditions provide the basic constraints that appear in information replication tasks, which formalize aspects of the behavior of information in relativistic quantum mechanics. In this article, we provide continuous variable (CV) strategies for spacetime quantum information replication that are directly amenable to optical or mechanical implementation. We use a new class of homologically constructed CV quantum error correcting codes to provide efficient solutions for the general case of information replication. As compared to schemes encoding qubits, our CV solution requires half as many shares per encoded system. We also provide an optimized five-mode strategy for replicating quantum information in a particular configuration of four spacetime regions designed not to be reducible to previously performed experiments. For this optimized strategy, we provide detailed encoding and decoding procedures using standard optical apparatus and calculate the recovery fidelity when finite squeezing is used. As such we provide a scheme for experimentally realizing quantum information replication using quantum optics.
Abstract One of the most important properties of quantum information, and the one ultimately responsible for its cryptographic applications, is that it can not be copied. That statement, however, is not completely accurate. While the no-cloning theorem of quantum mechanics prevents quantum information from being copied in space, the reversibility of microscopic physics actually requires that the information be copied in time. In spacetime as a whole, therefore, quantum information is widely replicated but in a restricted fashion. We fully characterize which regions of spacetime can all hold the same quantum information. Because quantum information can be delocalized through quantum error correction and teleportation, it need not follow well-defined trajectories. Instead, replication of the information in any configuration of spacetime regions not leading to violations of causality or the no-cloning principle is allowed. To demonstrate this, we answer the operational question of exactly when the information can be summoned to a set of spacetime points, showing how to do so efficiently using a combination of teleportation and codeword-stabilized quantum codes. This provides a simple and complete description of where and when a qubit can be located in spacetime, revealing a remarkable variety of possibilities.
Quantum error-correcting codes are constructed that embed a finite-dimensional code space in the infinite-dimensional Hilbert space of a system described by continuous quantum variables. These codes exploit the noncommutative geometry of phase space to protect against errors that shift the values of the canonical variables q and p. In the setting of quantum optics, fault-tolerant universal quantum computation can be executed on the protected code subspace using linear optical operations, squeezing, homodyne detection, and photon counting; however, nonlinear mode coupling is required for the preparation of the encoded states. Finite-dimensional versions of these codes can be constructed that protect encoded quantum information against shifts in the amplitude or phase of a d-state system. Continuous-variable codes can be invoked to establish lower bounds on the quantum capacity of Gaussian quantum channels.
Quantum summoning retrieves quantum information prepared at some point in spacetime at another point, which is randomly chosen from a set of points. This thesis presents an efficient quantum summoning protocol based on a quantum error-correcting code, along with encoding and decoding methods. This protocol reduces space complexity as well as gate complexity of encoding compared to previous best results. Our throughout study of quantum summoning paves the way for investigating relativistic quantum cryptography with quantum summoning as a primitive. This thesis also studies a relativistic continuous-variable quantum secret sharing protocol in non-inertial frame, which includes the effect of acceleration of quantum shares in spacetime. By formulating the relativistic effect as a Gaussian lossy channel, we analyze how the fidelity of quantum secret sharing protocol is affected by this relativistic effect. This investigation relaxes the common assumption of secret sharing in inertial frames and this framework can be applied to other relativistic quantum communication protocols. To efficiently verify bosonic quantum channels, I propose a framework of verification of quantum channels plus average-fidelity witness. For both multi-mode Gaussian unitary channels and single-mode amplifying channels, I present efficient verification protocols utilizing only two-mode squeezed vacuum states and homodyne detections. Our work is significant in verification of quantum components in continuous-variable quantum information processing.
We propose the first continuous-variable (CV) unclonable encryption scheme, extending the paradigm of quantum encryption of classical messages to CV systems. In our construction, a classical message is first encrypted classically and then encoded using an error-correcting code. Each bit of the codeword is mapped to a CV mode by creating a coherent state which is squeezed in the q or p quadrature direction, with a small displacement that encodes the bit. The squeezing directions are part of the encryption key. We prove unclonability in the framework introduced by Broadbent and Lord, via a reduction of the cloning game to a CV monogamy-of-entanglement game. Furthermore, we demonstrate that our scheme can be readily implemented with current technology. By incorporating realistic imperfections such as channel noise and detector inefficiencies, we show that the protocol remains robust under these conditions.
We introduce a novel strategy, based on the use of modular variables, to encode and deterministically process quantum information using states described by continuous variables. Our formalism leads to a general recipe to adapt existing quantum information protocols, originally formulated for finite dimensional quantum systems, to infinite dimensional systems described by continuous variables. This is achieved by using non unitary and non-gaussian operators, obtained from the superposition of gaussian gates, together with adaptative manipulations in qubit systems defined in infinite dimensional Hilbert spaces. We describe in details the realization of single and two qubit gates and briefly discuss their implementation in a quantum optical set-up.
In this article we develop a continuous variable (CV) shadow tomography scheme with wide ranging applications in quantum optics. Our work is motivated by the increasing experimental and technological relevance of CV systems in quantum information, quantum communication, quantum sensing, quantum simulations, quantum computing and error correction. We introduce two experimentally realisable schemes for obtaining classical shadows of CV (possibly non-Gaussian) quantum states using only randomised Gaussian unitaries and easily implementable Gaussian measurements such as homodyne and heterodyne detection. For both schemes, we show thatN=O(poly (1 /ϵ, log (1/δ),Mr+αn, log(m) )) samples of an unknownm-mode state ρ suffice to learn the expected value of anyr-local polynomial in the canonical observables of degree α, both with high probability 1 - δ and accuracy ϵ, as long as the state ρ has moments of ordern> α bounded byMn. By simultaneously truncating states and operators in energy and phase space, we are able to overcome new mathematical challenges that arise due to the infinite-dimensionality of CV systems. We also provide a scheme to learn nonlinear functionals of the state, such as entropies over any small number of modes, by leveraging recent energy-constrained entropic continuity bounds. Finally, we provide numerical evidence of the efficiency of our protocols in the case of CV states of relevance in quantum information theory, including ground states of quadratic Hamiltonians of many-body systems and cat qubit states. We expect our scheme to provide good recovery in learning relevant states of 2D materials and photonic crystals.