Hardware-Tailored Diagonalization Circuits
- URL: http://arxiv.org/abs/2203.03646v2
- Date: Tue, 30 Aug 2022 16:13:02 GMT
- Title: Hardware-Tailored Diagonalization Circuits
- Authors: Daniel Miller, Laurin E. Fischer, Igor O. Sokolov, Panagiotis Kl.
Barkoutsos, Ivano Tavernelli
- Abstract summary: A central building block of many quantum algorithms is the diagonalization of Pauli operators.
We introduce a theoretical framework for constructing hardware-tailored diagonalization circuits.
- Score: 0.9187159782788579
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: A central building block of many quantum algorithms is the diagonalization of
Pauli operators. Although it is always possible to construct a quantum circuit
that simultaneously diagonalizes a given set of commuting Pauli operators, only
resource-efficient circuits are reliably executable on near-term quantum
computers. Generic diagonalization circuits can lead to an unaffordable
Swap-gate overhead on quantum devices with limited hardware connectivity. A
common alternative is excluding two-qubit gates, however, this comes at the
cost of restricting the class of diagonalizable sets of Pauli operators to
tensor product bases (TPBs). In this letter, we introduce a theoretical
framework for constructing hardware-tailored (HT) diagonalization circuits. We
apply our framework to group the Pauli operators occurring in the decomposition
of a given Hamiltonian into jointly-HT-diagonalizable sets. We investigate
several classes of popular Hamiltonians and observe that our approach requires
a smaller number of measurements than conventional TPB approaches. Finally, we
experimentally demonstrate the practical applicability of our technique, which
showcases the great potential of our circuits for near-term quantum computing.
Related papers
- Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
We develop a reinforcement learning-based quantum compiler for a superconducting processor.
We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths.
Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
arXiv Detail & Related papers (2024-06-18T01:49:48Z) - Neutron-nucleus dynamics simulations for quantum computers [49.369935809497214]
We develop a novel quantum algorithm for neutron-nucleus simulations with general potentials.
It provides acceptable bound-state energies even in the presence of noise, through the noise-resilient training method.
We introduce a new commutativity scheme called distance-grouped commutativity (DGC) and compare its performance with the well-known qubit-commutativity scheme.
arXiv Detail & Related papers (2024-02-22T16:33:48Z) - Reducing circuit depth with qubitwise diagonalization [0.0]
We propose an algorithm yielding quantum circuits with depths $O(n log r)$ diagonalizing $n$-qubit operators generated by $r$ Pauli operators.
We observe that our algorithm performs favorably in producing quantum circuits diagonalizing randomly generated Hamiltonians as well as molecular Hamiltonians with short depths and low two-qubit gate counts.
arXiv Detail & Related papers (2023-05-31T20:34:06Z) - Near-optimal quantum circuit construction via Cartan decomposition [4.900041609957432]
We show the applicability of the Cartan decomposition of Lie algebras to quantum circuits.
This approach can be used to synthesize circuits that can efficiently implement any desired unitary operation.
arXiv Detail & Related papers (2022-12-25T17:01:13Z) - Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
We study the problem of designing worst-case to average-case reductions for quantum algorithms.
We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
arXiv Detail & Related papers (2022-12-06T22:01:49Z) - FABLE: Fast Approximate Quantum Circuits for Block-Encodings [0.0]
We propose FABLE, a method to generate approximate quantum circuits for block-encodings of matrices in a fast manner.
FABLE circuits have a simple structure and are directly formulated in terms of one- and two-qubit gates.
We show that FABLE circuits can be compressed and sparsified.
arXiv Detail & Related papers (2022-04-29T21:06:07Z) - Variational Adiabatic Gauge Transformation on real quantum hardware for
effective low-energy Hamiltonians and accurate diagonalization [68.8204255655161]
We introduce the Variational Adiabatic Gauge Transformation (VAGT)
VAGT is a non-perturbative hybrid quantum algorithm that can use nowadays quantum computers to learn the variational parameters of the unitary circuit.
The accuracy of VAGT is tested trough numerical simulations, as well as simulations on Rigetti and IonQ quantum computers.
arXiv Detail & Related papers (2021-11-16T20:50:08Z) - Approaching the theoretical limit in quantum gate decomposition [0.0]
We propose a novel numerical approach to decompose general quantum programs in terms of single- and two-qubit quantum gates with a $CNOT$ gate count.
Our approach is based on a sequential optimization of parameters related to the single-qubit rotation gates involved in a pre-designed quantum circuit used for the decomposition.
arXiv Detail & Related papers (2021-09-14T15:36:22Z) - Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems.
By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
arXiv Detail & Related papers (2021-08-03T17:49:09Z) - Synthesis of Quantum Circuits with an Island Genetic Algorithm [44.99833362998488]
Given a unitary matrix that performs certain operation, obtaining the equivalent quantum circuit is a non-trivial task.
Three problems are explored: the coin for the quantum walker, the Toffoli gate and the Fredkin gate.
The algorithm proposed proved to be efficient in decomposition of quantum circuits, and as a generic approach, it is limited only by the available computational power.
arXiv Detail & Related papers (2021-06-06T13:15:25Z) - Circuit optimization of Hamiltonian simulation by simultaneous
diagonalization of Pauli clusters [1.0587959762260986]
Quantum circuits for exact time evolution of single Pauli operators are well known, and can be extended trivially to sums of commuting Paulis.
In this paper we reduce the circuit complexity of Hamiltonian simulation by partitioning the Pauli operators into mutually commuting clusters.
We show that the proposed approach can help to significantly reduce both the number of CNOT operations and circuit depth for Hamiltonians arising in quantum chemistry.
arXiv Detail & Related papers (2020-03-30T16:29:40Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.