Exact gate decompositions for photonic quantum computing

  title={Exact gate decompositions for photonic quantum computing},
  author={Timjan Kalajdzievski and Juan Miguel Arrazola},
  journal={Physical Review A},
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… 

Quantum algorithm for nonhomogeneous linear partial differential equations

We describe a quantum algorithm for preparing states that encode solutions of non-homogeneous linear partial differential equations. The algorithm is a continuous-variable version of matrix

Fast optimization of parametrized quantum optical circuits

This work presents an algorithm that is orders of magnitude faster than the current state of the art, to recursively compute the exact matrix elements of Gaussian operators and their gradient with respect to a parametrization.

Flow conditions for continuous variable measurement-based quantum computing

It is shown that an MBQC with CV-flow approximates a unitary arbitrarily well in the infinite-squeezing limit, addressing issues of convergence which are unavoidable in the on-the-fly setting of the measurement-based quantum computing setting.

Universal Compiling and (No-)Free-Lunch Theorems for Continuous-Variable Quantum Learning

A range of No-Free-Lunch theorems are proved, demonstrating a linear resource reduction for learning Gaussian unitaries using entangled coherent-Fock states and an exponential resource Reduction for learning arbitrary unitary using Two-Mode-Squeezed states.

Exact and approximate continuous-variable gate decompositions

Gate decomposition techniques for continuous-variable quantum computers are gathered and examined in detail and approximate techniques can cover decompositions for all continuous- variable operations but require significant circuit depth for a modest precision.

A quantum Poisson solver implementable on NISQ devices

A compact quantum algorithm for solving one-dimensional Poisson equation based on simple Ry rotation, which avoids the need to do phase estimation, Hamiltonian simulation and arithmetic.

Scalable estimation of pure multi-qubit states

We introduce an inductive n -qubit pure-state estimation method based on projective measurements on m n  + 1 separable bases or m entangled bases plus the computational basis, with m  ≥ 2. The method

Towards quantum simulation of spin systems using continuous variable quantum devices

We study Bosonic representation of spin Ising model with the application of simulating two level systems using continuous variable quantum processors. We decompose the time evolution of spin systems

Detecting the event of a single photon loss on quantum signals

We design a scheme for detecting a single photon loss from multi-modal quantum signals transmitted via a fiber or in free space. This consists of a special type of unitary coding transformation, the

Alternatives to a nonhomogeneous partial differential equation quantum algorithm

Recently J. M. Arrazola et al. [Phys. Rev. A 100 , 032306 (2019)] proposed a quantum algorithm for solving nonhomogeneous linear partial differential equations of the form Aψ ( r ) = f ( r ) . Its



How to decompose arbitrary continuous-variable quantum operations.

We present a general, systematic, and efficient method for decomposing any given exponential operator of bosonic mode operators, describing an arbitrary multimode Hamiltonian evolution, into a set of

Asymptotically Optimal Topological Quantum Compiling

The problem of compiling quantum operations into braid representations for non-Abelian quasiparticles described by the Fibonacci anyon model is addressed and a probabilistically polynomial algorithm is developed that approximates any given single-qubit unitary to a desired precision by an asymptotically depth-optimal braid pattern.

A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits

We present an algorithm for computing depth-optimal decompositions of logical operations, leveraging a meet-in-the-middle technique to provide a significant speedup over simple brute force

Two-bit gates are universal for quantum computation.

  • DiVincenzo
  • Physics
    Physical review. A, Atomic, molecular, and optical physics
  • 1995
A proof is given, which relies on the commutator algebra of the unitary Lie groups, that quantum gates operating on just two bits at a time are sufficient to construct a general quantum circuit. The

Quantum Computing with Continuous-Variable Clusters

It is proved that there are universal states for which the offline squeezing per mode does not increase with the size of the cluster and the existence of universal continuous-variable resource states is found.

Universal quantum computation with ideal Clifford gates and noisy ancillas (14 pages)

We consider a model of quantum computation in which the set of elementary operations is limited to Clifford unitaries, the creation of the state |0>, and qubit measurement in the computational basis.

Efficient synthesis of universal Repeat-Until-Success circuits

This work presents a probabilistically polynomial-time algorithm to synthesize a RUS circuit to approximate any given single-qubit unitary to precision ϵ over the Clifford+T basis, and surprisingly, the T count of the synthesized R US circuit surpasses the theoretical lower bound.

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

This work introduces an experimentally viable “repeat-until-success” approach to generating the cubic phase gate, which is achieved using sequential photon subtractions and Gaussian operations.

Elementary gates for quantum computation.

U(2) gates are derived, which derive upper and lower bounds on the exact number of elementary gates required to build up a variety of two- and three-bit quantum gates, the asymptotic number required for n-bit Deutsch-Toffoli gates, and make some observations about the number of unitary operations on arbitrarily many bits.

Asymptotically optimal approximation of single qubit unitaries by Clifford and T circuits using a constant number of ancillary qubits

An algorithm is presented for building a circuit that approximates single qubit unitaries with precision ε using O(log(1/ε)) Clifford and T gates and employing up to two ancillary qubits that saturates the lower bound of Lagrange's four-square theorem.