Constructing quantum circuits with global gates
- URL: http://arxiv.org/abs/2012.09061v2
- Date: Fri, 5 Mar 2021 11:32:51 GMT
- Title: Constructing quantum circuits with global gates
- Authors: John van de Wetering
- Abstract summary: A particularly popular gate set in the literature on quantum computing consists of arbitrary single-qubit gates and 2-qubit CNOT gates.
A CNOT gate is however not always the natural multi-qubit interaction that can be implemented on a given physical quantum computer.
This calls for an entirely different approach to constructing efficient circuits.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: There are various gate sets that can be used to describe a quantum
computation. A particularly popular gate set in the literature on quantum
computing consists of arbitrary single-qubit gates and 2-qubit CNOT gates. A
CNOT gate is however not always the natural multi-qubit interaction that can be
implemented on a given physical quantum computer, necessitating a compilation
step that transforms these CNOT gates to the native gate set. A particularly
interesting case where compilation is necessary is for ion trap quantum
computers, where the natural entangling operation can act on more than 2 qubits
and can even act globally on all qubits at once. This calls for an entirely
different approach to constructing efficient circuits. In this paper we study
the problem of converting a given circuit that uses 2-qubit gates to one that
uses global gates. Our three main contributions are as follows. First, we find
an efficient algorithm for transforming an arbitrary circuit consisting of
Clifford gates and arbitrary phase gates into a circuit consisting of
single-qubit gates and a number of global interactions proportional to the
number of non-Clifford phases present in the original circuit. Second, we find
a general strategy to transform a global gate that targets all qubits into one
that targets only a subset of the qubits. This approach scales linearly with
the number of qubits that are not targeted, in contrast to the exponential
scaling reported in (Maslov & Nam, N. J. Phys. 2018). Third, we improve on the
number of global gates required to synthesise an arbitrary n-qubit Clifford
circuit from the 12n-18 reported in (Maslov & Nam, N. J. Phys. 2018) to 6n-8.
Related papers
- Unlocking the power of global quantum gates with machine learning [3.9000096678531606]
We propose a circuit ansatze composed of a finite number of global gates and layers of single-qubit unitaries.
By construction, these ansatze are equivalent to linear depth local-gate quantum circuits and are highly expressible.
We demonstrate the capabilities of this approach by applying it to the problem of ground state preparation for the Heisenberg model and the toric code Hamiltonian.
arXiv Detail & Related papers (2025-02-04T15:24:12Z) - Efficient compilation of quantum circuits using multi-qubit gates [0.0]
We present a compilation scheme which implements a general-circuit decomposition to a sequence of Ising-type, long-range, multi-qubit entangling gates.
We numerically test our compilation and show that, compared to conventional realizations with two-qubit gates, our compilations improves the logarithm of quantum volume by $20%$ to $25%$.
arXiv Detail & Related papers (2025-01-28T19:08:13Z) - Error-corrected Hadamard gate simulated at the circuit level [42.002147097239444]
We simulate the logical Hadamard gate in the surface code under a circuit-level noise model.
Our paper is the first to do this for a unitary gate on a quantum error-correction code.
arXiv Detail & Related papers (2023-12-18T19:00:00Z) - Cat-qubit-inspired gate on cos($2\theta$) qubits [77.34726150561087]
We introduce a single-qubit $Z$ gate inspired by the noise-bias preserving gate of the Kerr-cat qubit.
This scheme relies on a $pi$ rotation in phase space via a beamsplitter-like transformation between a qubit and ancilla qubit.
arXiv Detail & Related papers (2023-04-04T23:06:22Z) - Universal qudit gate synthesis for transmons [44.22241766275732]
We design a superconducting qudit-based quantum processor.
We propose a universal gate set featuring a two-qudit cross-resonance entangling gate.
We numerically demonstrate the synthesis of $rm SU(16)$ gates for noisy quantum hardware.
arXiv Detail & Related papers (2022-12-08T18:59:53Z) - Extensive characterization of a family of efficient three-qubit gates at
the coherence limit [0.4471952592011114]
We implement a three-qubit gate by simultaneously applying two-qubit operations.
We generate two classes of entangled states, the GHZ and W states, by applying the new gate only once.
We analyze the experimental and statistical errors on the fidelity of the gates and of the target states.
arXiv Detail & Related papers (2022-07-06T19:42:29Z) - Optimal model for fewer-qubit CNOT gates with Rydberg atoms [8.01045083320546]
We report an optimal model about universal two- and three-qubit CNOT gates mediated by excitation to Rydberg states.
Compared to conventional multi-pulse piecewise schemes, our gate can be realized by simultaneous excitation of atoms to the Rydberg states.
arXiv Detail & Related papers (2021-12-16T09:54:52Z) - Software mitigation of coherent two-qubit gate errors [55.878249096379804]
Two-qubit gates are important components of quantum computing.
But unwanted interactions between qubits (so-called parasitic gates) can degrade the performance of quantum applications.
We present two software methods to mitigate parasitic two-qubit gate errors.
arXiv Detail & Related papers (2021-11-08T17:37:27Z) - 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) - QUANTIFY: A framework for resource analysis and design verification of
quantum circuits [69.43216268165402]
QUANTIFY is an open-source framework for the quantitative analysis of quantum circuits.
It is based on Google Cirq and is developed with Clifford+T circuits in mind.
For benchmarking purposes QUANTIFY includes quantum memory and quantum arithmetic circuits.
arXiv Detail & Related papers (2020-07-21T15:36:25Z) - Improving the Performance of Deep Quantum Optimization Algorithms with
Continuous Gate Sets [47.00474212574662]
Variational quantum algorithms are believed to be promising for solving computationally hard problems.
In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances.
Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
arXiv Detail & Related papers (2020-05-11T17:20:51Z)
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.