Preparation of matrix product states with log-depth quantum circuits
We consider the preparation of matrix product states (MPS) on quantum devices via
quantum circuits of local gates. We first prove that faithfully preparing translation-invariant …
quantum circuits of local gates. We first prove that faithfully preparing translation-invariant …
Best approximate quantum compiling problems
We study the problem of finding the best approximate circuit that is the closest (in some
pertinent metric) to a target circuit, and which satisfies a number of hardware constraints, like …
pertinent metric) to a target circuit, and which satisfies a number of hardware constraints, like …
Lattice Boltzmann–Carleman quantum algorithm and circuit for fluid flows at moderate Reynolds number
We present a quantum computing algorithm for fluid flows based on the Carleman-
linearization of the Lattice Boltzmann (LB) method. First, we demonstrate the convergence of …
linearization of the Lattice Boltzmann (LB) method. First, we demonstrate the convergence of …
In order to unitarily evolve a quantum system, an agent requires knowledge of time, a
parameter that no physical clock can ever perfectly characterize. In this Letter, we study how …
parameter that no physical clock can ever perfectly characterize. In this Letter, we study how …
Comparative study of variations in quantum approximate optimization algorithms for the traveling salesman problem
The traveling salesman problem (TSP) is one of the most often-used NP-hard problems in
computer science to study the effectiveness of computing models and hardware platforms. In …
computer science to study the effectiveness of computing models and hardware platforms. In …
Quantum circuit optimization and transpilation via parameterized circuit instantiation
Parameterized circuit instantiation is a common technique encountered in the generation of
circuits for a large class of hybrid quantum-classical algorithms. Despite being supported by …
circuits for a large class of hybrid quantum-classical algorithms. Despite being supported by …
Efficient quantum gate decomposition via adaptive circuit compression
In this work, we report on a novel quantum gate approximation algorithm based on the
application of parametric two-qubit gates in the synthesis process. The utilization of these …
application of parametric two-qubit gates in the synthesis process. The utilization of these …
Tensor quantum programming
A Termanova, A Melnikov, E Mamenchikov… - New Journal of …, 2024 - iopscience.iop.org
Running quantum algorithms often involves implementing complex quantum circuits with
such a large number of multi-qubit gates that the challenge of tackling practical applications …
such a large number of multi-qubit gates that the challenge of tackling practical applications …
Numerical analysis of quantum circuits for state preparation and unitary operator synthesis
We perform optimal-control-theory calculations to determine the minimum number of two-
qubit controlled-not (cnot) gates needed to perform quantum state preparation and unitary …
qubit controlled-not (cnot) gates needed to perform quantum state preparation and unitary …
Quantum-classical tradeoffs and multi-controlled quantum gate decompositions in variational algorithms
The computational capabilities of near-term quantum computers are limited by the noisy
execution of gate operations and a limited number of physical qubits. Hybrid variational …
execution of gate operations and a limited number of physical qubits. Hybrid variational …