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:1802.05220 · Physical Review A

ON states as resource units for universal quantum computation with photonic architectures

Krishna Kumar Sabapathy, Christian Weedbrook

Published Jun 11, 2018• 46 citations
arXivHTMLPDF

Abstract

Universal quantum computation using photonic systems requires gates the Hamiltonians of which are of order greater than quadratic in the quadrature operators. We first review previous proposals to implement such gates, where specific non-Gaussian states are used as resources in conjunction with entangling gates such as the continuous-variable versions of controlled-phase and controlled-not gates. We then propose ON states which are superpositions of the vacuum and the $N\mathrm{th}$ Fock state, for use as non-Gaussian resource states. We show that ON states can be used to implement the cubic and higher-order quadrature phase gates to first order in gate strength. There are several advantages to this method such as reduced number of superpositions in the resource state preparation and greater control over the final gate. We also introduce useful figures of merit to characterize gate performance. Utilizing a supply of on-demand resource states one can potentially scale up implementation to greater accuracy, by repeated application of the basic circuit.

DOI
10.1103/physreva.97.062315

Related papers

Production of photonic universal quantum gates enhanced by machine learning

Krishna Kumar Sabapathy, Haoyu Qi, Josh Izaac +1 more

We introduce photonic architectures for universal quantum computation. The first step is to produce a resource state which is a superposition of the first four Fock states with a probability greater than or equal to ${10}^{\ensuremath{-}2}$, an increase by a factor of ${10}^{4}$ over standard sequential photon-subtraction techniques. The resource state is produced with near-perfect fidelity from a quantum gadget that uses displaced squeezed vacuum states, interferometers, and photon-number-resolving detectors. The parameters of this gadget are trained using machine learning algorithms for variational circuits. We discuss in detail various aspects of the non-Gaussian state preparation resulting from the numerical experiments. We then propose a notion of resource farms where these gadgets are stacked in parallel, to increase the success probability further. We find a trade-off between the success probability of the farm, the error tolerance, and the number of gadgets. Using the resource states in conventional gate teleportation techniques, we can then implement weak tunable cubic phase gates. The numerical tools that have been developed could potentially be useful for other applications in photonics as well.

arXiv:1809.04680•Physical Review A•Jul 17, 2019•66 citations

Convex resource theory of non-Gaussianity

Ryuji Takagi, Quntao Zhuang

Continuous-variable systems realized in quantum optics play a major role in quantum information processing, and it is also one of the promising candidates for a scalable quantum computer. We introduce a resource theory for continuous-variable systems relevant to universal quantum computation. In our theory, easily implementable operations---Gaussian operations combined with feed-forward---are chosen to be the free operations, making the convex hull of the Gaussian states the natural free states. Since our free operations and free states cannot perform universal quantum computation, genuine non-Gaussian states---states not in the convex hull of Gaussian states---are the necessary resource states for universal quantum computation together with free operations. We introduce a monotone to quantify the genuine non-Gaussianity of resource states, in analogy to the stabilizer theory. A direct application of our resource theory is to bound the conversion rate between genuine non-Gaussian states. Finally, we give a protocol that probabilistically distills genuine non-Gaussianity---increases the genuine non-Gaussianity of resource states---only using free operations and postselection on Gaussian measurements, where our theory gives an upper bound for the distillation rate. In particular, the same protocol allows the distillation of cubic phase states, which enable universal quantum computation when combined with free operations.

arXiv:1804.04669•Physical Review A•Jun 25, 2018•205 citations

Optical Quantum Information with Non-Gaussian States

Austin P. Lund

Quantum information and quantum computing offer a new range of possibilities in terms ofnew computing algorithms, the ability to perform new types of operations and make statementsabout information in terms of what it is physically possible to know about a system.Experiments in quantum information and quantum computing have been advancing significantly,especially over the last decade. In optical quantum computing there are two maintypes of experiments that are performed today. They are experiments involving single photonswith information encoded on the polarisation of the photon and experiments involvingstates with Gaussian noise profiles in their quadratures. There appears to be no way toperform the required operations for universal quantum computing using operations whichtake Gaussian states to Gaussian states. Universal quantum computing using single photonsis possible but uses either enormously large non-linearities or a large number of resources.Also, operations which take Gaussian states to non-Gaussian states are not well understoodin general and can often be very difficult to implement.This thesis presents three sources of optical non-Gaussian states which demonstrate someof the interesting properties of these states. First, a scheme for universal quantum computingusing superpositions of coherent states is presented. Error correction and the fault toleranceproperties of this scheme is also explored and compared with current single photon architectures.These gates require superpositions of coherent states as resources and a relativelysimple scheme is shown for how these states may be generated. Next a scheme for distillingnear ideal Gaussian entanglement using non-Gaussian operations is presented. The loss andnoise conditions under which ideal distillation can be achieved are presented. Finally, a verysimple way of generating mixed non-Gaussian states from two Gaussian states is presented.These states are shown to give rise to counter-intuitive results when measuring their entanglementand when analysing their operational ability in terms of teleportation and quantumkey distribution.

•Jun 1, 2008•0 citations

Quantum engineering of non-Gaussian resources for continuous-variable quantum computing by photon-number-resolving detection

Miller Eaton, Rajveer Nehra, Olivier Pfister

Continuous-variable quantum computing (CVQC) boasts, by way of quantum optics, one of the largest scalability potentials of all quantum computing platforms. In order to enable universal CVQC, i.e., exponential speedup as well as fault tolerance, one requires quantum resources (states and/or gates) with a non-Gaussian Wigner function. We present several state preparation techniques, using photon-number-resolving detection, that enable the generation of resource states such as GKP or binomial error encodings.

Quantum Communications and Quantum Imaging•Aug 4, 2021•0 citations

Repeat-until-success cubic phase gate for universal continuous-variable quantum computation

Kevin Marshall, Raphael C. Pooser, George Siopsis +1 more

To achieve universal quantum computation using continuous variables, one needs to jump out of the set of Gaussian operations and have a non-Gaussian element, such as the cubic phase gate. However, such a gate is currently very difficult to implement in practice. Here we introduce an experimentally viable ``repeat-until-success'' approach to generating the cubic phase gate, which is achieved using sequential photon subtractions and Gaussian operations. We find that our scheme offers benefits in terms of the expected time until success, as well as the fact that we do not require any complex off-line resource state, although we require a primitive quantum memory.

arXiv:1412.0336•Physical Review A•Mar 24, 2015•81 citations

Resourcefulness of non-classical continuous-variable quantum gates

Massimo Frigerio, Antoine Debray, Nicolas Treps +1 more

In continuous-variable quantum computation, identifying key elements that enable a quantum computational advantage is a long-standing issue. Starting from the standard results on the necessity of Wigner negativity, we develop a comprehensive and versatile approach in which the techniques of ( s ) -ordered quasiprobabilities are exploited to provide rigorous statements on the simulability of photonic quantum circuits consisting of previously characterized gates and thereby identifying the contribution of each quantum gate to the potential achievement of quantum computational advantage. This is achieved by means of an analysis of the so-called transfer function, allowing us to highlight the resourcefulness of a gate set. As such this technique can be straightforwardly applied to current continuous-variables quantum circuits, while also constraining the tolerable amount of losses above which any potential quantum advantage can be ruled out. We use ( s ) -ordered quasiprobability distributions on phase-space to capture the non-classical features in the protocol, and focus our technique entirely on the ordering parameter s . This allows us to highlight the resourcefulness and robustness to loss of a universal set of unitary gates comprising three distinct Gaussian gates and any non-Gaussian unitary gate, providing important insight on the role of non-Gaussianity.

arXiv:2410.09226•Quantum•Jul 8, 2026•4 citations
Universal quantum computation using photonic systems requires gates the Hamiltonians of which are of order greater than quadratic in the quadrature operators. We first review previous proposals to implement such gates, where specific non-Gaussian states are used as resources in conjunction with entangling gates such as the continuous-variable versions of controlled-phase and controlled-not gates. We then propose ON states which are superpositions of the vacuum and the NthN\mathrm{th}Nth Fock state, for use as non-Gaussian resource states. We show that ON states can be used to implement the cubic and higher-order quadrature phase gates to first order in gate strength. There are several advantages to this method such as reduced number of superpositions in the resource state preparation and greater control over the final gate. We also introduce useful figures of merit to characterize gate performance. Utilizing a supply of on-demand resource states one can potentially scale up implementation to greater accuracy, by repeated application of the basic circuit.
We introduce photonic architectures for universal quantum computation. The first step is to produce a resource state which is a superposition of the first four Fock states with a probability greater than or equal to ${10}^{\ensuremath{-}2}$, an increase by a factor of 104{10}^{4}104 over standard sequential photon-subtraction techniques. The resource state is produced with near-perfect fidelity from a quantum gadget that uses displaced squeezed vacuum states, interferometers, and photon-number-resolving detectors. The parameters of this gadget are trained using machine learning algorithms for variational circuits. We discuss in detail various aspects of the non-Gaussian state preparation resulting from the numerical experiments. We then propose a notion of resource farms where these gadgets are stacked in parallel, to increase the success probability further. We find a trade-off between the success probability of the farm, the error tolerance, and the number of gadgets. Using the resource states in conventional gate teleportation techniques, we can then implement weak tunable cubic phase gates. The numerical tools that have been developed could potentially be useful for other applications in photonics as well.
Continuous-variable systems realized in quantum optics play a major role in quantum information processing, and it is also one of the promising candidates for a scalable quantum computer. We introduce a resource theory for continuous-variable systems relevant to universal quantum computation. In our theory, easily implementable operations---Gaussian operations combined with feed-forward---are chosen to be the free operations, making the convex hull of the Gaussian states the natural free states. Since our free operations and free states cannot perform universal quantum computation, genuine non-Gaussian states---states not in the convex hull of Gaussian states---are the necessary resource states for universal quantum computation together with free operations. We introduce a monotone to quantify the genuine non-Gaussianity of resource states, in analogy to the stabilizer theory. A direct application of our resource theory is to bound the conversion rate between genuine non-Gaussian states. Finally, we give a protocol that probabilistically distills genuine non-Gaussianity---increases the genuine non-Gaussianity of resource states---only using free operations and postselection on Gaussian measurements, where our theory gives an upper bound for the distillation rate. In particular, the same protocol allows the distillation of cubic phase states, which enable universal quantum computation when combined with free operations.
Quantum information and quantum computing offer a new range of possibilities in terms ofnew computing algorithms, the ability to perform new types of operations and make statementsabout information in terms of what it is physically possible to know about a system.Experiments in quantum information and quantum computing have been advancing significantly,especially over the last decade. In optical quantum computing there are two maintypes of experiments that are performed today. They are experiments involving single photonswith information encoded on the polarisation of the photon and experiments involvingstates with Gaussian noise profiles in their quadratures. There appears to be no way toperform the required operations for universal quantum computing using operations whichtake Gaussian states to Gaussian states. Universal quantum computing using single photonsis possible but uses either enormously large non-linearities or a large number of resources.Also, operations which take Gaussian states to non-Gaussian states are not well understoodin general and can often be very difficult to implement.This thesis presents three sources of optical non-Gaussian states which demonstrate someof the interesting properties of these states. First, a scheme for universal quantum computingusing superpositions of coherent states is presented. Error correction and the fault toleranceproperties of this scheme is also explored and compared with current single photon architectures.These gates require superpositions of coherent states as resources and a relativelysimple scheme is shown for how these states may be generated. Next a scheme for distillingnear ideal Gaussian entanglement using non-Gaussian operations is presented. The loss andnoise conditions under which ideal distillation can be achieved are presented. Finally, a verysimple way of generating mixed non-Gaussian states from two Gaussian states is presented.These states are shown to give rise to counter-intuitive results when measuring their entanglementand when analysing their operational ability in terms of teleportation and quantumkey distribution.
Continuous-variable quantum computing (CVQC) boasts, by way of quantum optics, one of the largest scalability potentials of all quantum computing platforms. In order to enable universal CVQC, i.e., exponential speedup as well as fault tolerance, one requires quantum resources (states and/or gates) with a non-Gaussian Wigner function. We present several state preparation techniques, using photon-number-resolving detection, that enable the generation of resource states such as GKP or binomial error encodings.
To achieve universal quantum computation using continuous variables, one needs to jump out of the set of Gaussian operations and have a non-Gaussian element, such as the cubic phase gate. However, such a gate is currently very difficult to implement in practice. Here we introduce an experimentally viable ``repeat-until-success'' approach to generating the cubic phase gate, which is achieved using sequential photon subtractions and Gaussian operations. We find that our scheme offers benefits in terms of the expected time until success, as well as the fact that we do not require any complex off-line resource state, although we require a primitive quantum memory.
In continuous-variable quantum computation, identifying key elements that enable a quantum computational advantage is a long-standing issue. Starting from the standard results on the necessity of Wigner negativity, we develop a comprehensive and versatile approach in which the techniques of ( s ) -ordered quasiprobabilities are exploited to provide rigorous statements on the simulability of photonic quantum circuits consisting of previously characterized gates and thereby identifying the contribution of each quantum gate to the potential achievement of quantum computational advantage. This is achieved by means of an analysis of the so-called transfer function, allowing us to highlight the resourcefulness of a gate set. As such this technique can be straightforwardly applied to current continuous-variables quantum circuits, while also constraining the tolerable amount of losses above which any potential quantum advantage can be ruled out. We use ( s ) -ordered quasiprobability distributions on phase-space to capture the non-classical features in the protocol, and focus our technique entirely on the ordering parameter s . This allows us to highlight the resourcefulness and robustness to loss of a universal set of unitary gates comprising three distinct Gaussian gates and any non-Gaussian unitary gate, providing important insight on the role of non-Gaussianity.