Related papers: Gaussian quantum computation with oracle-decision …
We propose a new treatment for the quantum three-body problem. It is based on an expansion of the wave function on harmonic oscillator functions with different sizes in the Jacobi coordinates. The matrix elements of the Hamiltonian can be…
While recent work suggests that quantum computers can speed up the solution of semidefinite programs, little is known about the quantum complexity of more general convex optimization. We present a quantum algorithm that can optimize a…
We demonstrate that continuous-variable quantum error correction based on Gaussian ancilla states and Gaussian operations (for encoding, syndrome extraction, and recovery) can be very useful to suppress the effect of non-Gaussian error…
Combinatorial optimization is a promising application for near-term quantum computers, however, identifying performant algorithms suited to noisy quantum hardware remains as an important goal to potentially realizing quantum computational…
We study the robustness of a fault-tolerant quantum computer subject to Gaussian non-Markovian quantum noise, and we show that scalable quantum computation is possible if the noise power spectrum satisfies an appropriate "threshold…
One of the most promising applications of noisy intermediate-scale quantum computers is the simulation of molecular Hamiltonians using the variational quantum eigensolver. We show that encoding symmetries of the simulated Hamiltonian in the…
Complex computer codes are often too time expensive to be directly used to perform uncertainty propagation studies, global sensitivity analysis or to solve optimization problems. A well known and widely used method to circumvent this…
The constituent parts of a quantum computer are inherently vulnerable to errors. To this end we have developed quantum error-correcting codes to protect quantum information from noise. However, discovering codes that are capable of a…
Achieving reliable performance on early fault-tolerant quantum hardware will depend on protocols that manage noise without incurring prohibitive overhead. We propose a novel framework that integrates quantum computation with the…
We propose a modification of the Variational Quantum Eigensolver algorithm for electronic structure optimization using quantum computers, named non-unitary Variational Quantum Eigensolver (nu-VQE), in which a non-unitary operator is…
It is well known in quantum optics that any process involving the preparation of a multimode gaussian state, followed by a gaussian operation and gaussian measurements, can be efficiently simulated by classical computers. Here, we provide…
We present a new optimization method for small-to-intermediate scale variational algorithms on noisy near-term quantum processors which uses a Gaussian process surrogate model equipped with a classically-evaluated quantum kernel.…
We give a survey of the two remarkable analytical problems of quantum information theory. The main part is a detailed report of the recent (partial) solution of the quantum Gaussian optimizers problem which establishes an optimal property…
In this paper, we estimate the errors of Gaussian transformations implemented using one-way quantum computations on cluster states of various configurations. From all possible cluster state configurations, we choose those that give the…
The main promise of quantum computing is to efficiently solve certain problems that are prohibitively expensive for a classical computer. Most problems with a proven quantum advantage involve the repeated use of a black box, or oracle,…
Constraint satisfiability problems, crucial to several applications, are solved on a quantum computer using Grover's search algorithm, leading to a quadratic improvement over the classical case. The solutions are obtained with high…
We propose an orbital optimized method for unitary coupled cluster theory (OO-UCC) within the variational quantum eigensolver (VQE) framework for quantum computers. OO-UCC variationally determines the coupled cluster amplitudes and also…
Gaussian boson sampling (GBS) is not only a feasible protocol for demonstrating quantum computational advantage, but also mathematically associated with certain graph-related and quantum chemistry problems. In particular, it is proposed…
The response of a test particle, both for the free case and under the harmonic oscillator potential, to circularly polarized gravitational waves is investigated in a noncommutative quantum mechanical setting. The system is quantized…
This paper presents an intrinsic approach for addressing control problems with systems governed by linear ordinary differential equations (ODEs). We use computer algebra to constrain a Gaussian Process on solutions of ODEs. We obtain…