Resourcefulness of non-classical continuous-variable quantum gates

Abstract

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.

18 pages, 5 figures

References in corpus (33)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Quantum computational advantage using photons
• Characterizing Quantum Supremacy in Near-Term Devices
• Quantum Computational Supremacy
• Gaussian Boson Sampling
• Positive Wigner functions render classical simulation of quantum computation efficient
• Efficient Classical Simulation of Continuous Variable Quantum Information Processes
• Negative Quasi-Probability as a Resource for Quantum Computation
• Quantum Computing with Continuous-Variable Clusters
• Boson Sampling from Gaussian States
• Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
• Estimating outcome probabilities of quantum circuits using quasiprobabilities
• Computational advantage of quantum random sampling
• Sufficient Conditions for Efficient Classical Simulation of Quantum Optics
• Gaussian Boson Sampling using threshold detectors
• Efficient algorithm for boson sampling with partially distinguishable photons
• Simulating boson sampling in lossy architectures
• The Boundary for Quantum Advantage in Gaussian Boson Sampling
• Regimes of classical simulability for noisy Gaussian boson sampling
• Universal Gate Set for Continuous-Variable Quantum Computation with Microwave Circuits
• Resources for bosonic quantum computational advantage
• Classical algorithm for simulating experimental Gaussian boson sampling
• Boson sampling with Gaussian measurements
• Continuous-Variable Sampling from Photon-Added or Photon-Subtracted Squeezed States
• Simulating complex networks in phase space: Gaussian boson sampling
• Simulability of Imperfect Gaussian and Superposition Boson Sampling
• The computational power of random quantum circuits in arbitrary geometries
• Efficient simulatability of continuous-variable circuits with large Wigner negativity
• Efficient simulation of Gottesman-Kitaev-Preskill states with Gaussian circuits
• The vacuum provides quantum advantage to otherwise simulatable architectures
• Sufficient condition for universal quantum computation using bosonic circuits
• Phase-space negativity as a computational resource for quantum kernel methods
• Approximating outcome probabilities of linear optical circuits