Exact gate decompositions for photonic quantum computing
arXiv:1811.10651 · doi:10.1103/PhysRevA.99.022341
Abstract
We propose a method for decomposing continuous-variable operations into a universal gate set, without the use of any approximations. We fully characterize a set of transformations admitting exact decompositions and describe a process for obtaining them systematically. Gates admitting these decompositions can be synthesized exactly, using circuits that are several orders of magnitude smaller than those achievable with previous methods. Our method relies on strategically using unitary conjugation and a lemma to the Baker-Campbell-Hausdorff formula to derive new exact decompositions from previously known ones, leading to exact decompositions for a large class of gates. We demonstrate the wide applicability of these exact gate decompositions by identifying several quantum algorithms and simulations of bosonic systems that can be implemented with higher precision and shorter circuit depths using our techniques.
References in corpus (41)
- Elementary gates for quantum computation
- Quantum information with continuous variables
- Gaussian Quantum Information
- Quantum algorithm for solving linear systems of equations
- Encoding a qubit in an oscillator
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- Simulated Quantum Computation of Molecular Energies
- Quantum computation over continuous variables
- Two-Bit Gates are Universal for Quantum Computation
- Universal Quantum Computation with Continuous-Variable Cluster States
- Exponential algorithmic speedup by quantum walk
- Simulation of Many-Body Fermi Systems on a Universal Quantum Computer
- Quantum algorithm for systems of linear equations with exponentially improved dependence on precision
- Toward the first quantum simulation with quantum speedup
- A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits
- Fault-Tolerant Measurement-Based Quantum Computing with Continuous-Variable Cluster States
- Quantum Computing with Continuous-Variable Clusters
- Quantum speedup of Monte Carlo methods
- Preconditioned quantum linear system algorithm
- Finding Exponential Product Formulas of Higher Orders
- A quantum linear system algorithm for dense matrices
- N-representability is QMA-complete
- Higher Order Decompositions of Ordered Operator Exponentials
- Efficient synthesis of universal Repeat-Until-Success circuits
- Asymptotically optimal approximation of single qubit unitaries by Clifford and T circuits using a constant number of ancillary qubits
- Asymptotically Optimal Topological Quantum Compiling
- Quantum machine learning over infinite dimensions
- Dipolar Molecules in Optical Lattices
- Exponentially More Precise Quantum Simulation of Fermions in the Configuration Interaction Representation
- A passive CPHASE gate via cross-Kerr nonlinearities
- Repeat-until-success cubic phase gate for universal continuous-variable quantum computation
- Mitigating algorithmic errors in Hamiltonian simulation
- Mott Transition in the Two-Dimensional Hubbard Model
- How to decompose arbitrary continuous-variable quantum operations
- General implementation of arbitrary nonlinear quadrature phase gates
- Reservoir engineering of bosonic lattices using chiral symmetry and localized dissipation
- Continuous-variable gate decomposition for the Bose-Hubbard model
- A measurement-induced optical Kerr interaction
- Quantum searching with continuous variables
- A framework for exact synthesis
- Photonic quantum algorithm for Monte Carlo integration
Cited by in corpus (17)
- Quantum algorithm for non-homogeneous linear partial differential equations
- Building a large-scale quantum computer with continuous-variable optical technologies
- All-optical quantum computing using cubic phase gates
- Exact and approximate continuous-variable gate decompositions
- Fast optimization of parametrized quantum optical circuits
- Scalable estimation of pure multi-qubit states
- Photonic counterdiabatic quantum optimization algorithm
- Implementing arbitrary multi-mode continuous-variable quantum gates with fixed non-Gaussian states and adaptive linear optics
- Flow conditions for continuous variable measurement-based quantum computing
- Fixed-point quantum continuous search algorithm with optimal query complexity
- Towards quantum simulation of spin systems using continuous variable quantum devices
- Generating Gottesman-Kitaev-Preskill qubit using a cross-Kerr interaction between a squeezed light and Fock states in optics
- Alternatives to a nonhomogeneous partial differential equation quantum algorithm
- Graphical Framework for Non-Gaussian Quantum States
- Universal compiling and (No-)Free-Lunch theorems for continuous variable quantum learning
- Detecting the event of a single photon loss on quantum signals
- Quantum computational resources for lattice QCD in the strong-coupling limit