Quantum circuit synthesis describes the process of converting arbitrary unitary operations into a gate sequence of a fixed universal gate set, usually defined by the operations native to a given hardware platform. Most current synthesis algorithms are designed to synthesize towards a set of single qubit rotations and an additional entangling two qubit gate, such as CX, CZ, or the Molmer Sorensen gate. However, with the emergence of neutral atom based hardware and their native support for gates with more than two qubits, synthesis approaches tailored to these new gate sets become necessary. In this work, we present an approach to synthesize multi controlled phase gates using ZX calculus. By representing quantum circuits as graph like ZX diagrams, one can utilize the distinct graph structure of diagonal gates to identify multi controlled phase gates inherently present in some quantum circuits even if none were explicitly defined in the original circuit. We evaluate the approach on a wide range of benchmark circuits and compare them to the standard Qiskit synthesis regarding its circuit execution time for neutral atom based hardware with native support of multi controlled gates. Our results show possible advantages for current state of the art hardware and represent the first exact synthesis algorithm supporting arbitrary sized multi controlled phase gates.
Quantum circuit synthesis describes the process of converting arbitrary unitary operations into a gate sequence of a fixed universal gate set, usually defined by the operations native to a given hardware platform. Most current synthesis algorithms are designed to synthesize towards a set of single qubit rotations and an additional entangling two qubit gate, such as CX, CZ, or the Molmer Sorensen gate. However, with the emergence of neutral atom based hardware and their native support for gates with more than two qubits, synthesis approaches tailored to these new gate sets become necessary. In this work, we present an approach to synthesize multi controlled phase gates using ZX calculus. By representing quantum circuits as graph like ZX diagrams, one can utilize the distinct graph structure of diagonal gates to identify multi controlled phase gates inherently present in some quantum circuits even if none were explicitly defined in the original circuit. We evaluate the approach on a wide range of benchmark circuits and compare them to the standard Qiskit synthesis regarding its circuit execution time for neutral atom based hardware with native support of multi controlled gates. Our results show possible advantages for current state of the art hardware and represent the first exact synthesis algorithm supporting arbitrary sized multi controlled phase gates.
Abstract Compiling quantum circuits to account for hardware restrictions is an essential part of the quantum computing stack. Circuit compilation allows us to adapt algorithm descriptions into a sequence of operations supported by real quantum hardware, and has the potential to significantly improve their performance when optimisation techniques are added to the process. One such optimisation technique is reducing the number of quantum gates that are needed to execute a circuit. For instance, methods for reducing the number of non-Clifford gates or CNOT gates from a circuit are an extensive research area that has gathered significant interest over the years. For certain hardware platforms such as trapped-ion quantum computers, we can leverage some of their special properties to further reduce the cost of executing a quantum circuit in them. In this work we use global interactions, such as the Global Mølmer–Sørensen (MS) gate present in trapped-ion hardware, to optimise and synthesise quantum circuits. We design and implement an algorithm that is able to compile an arbitrary quantum circuit into another circuit that uses global gates as the entangling operation, while optimising the number of global interactions needed. The algorithm is based on the ZX -calculus and uses a specialised circuit extraction routine that groups entangling gates into Global MS gates. We benchmark the algorithm in a variety of circuits, and show how it improves their performance under state-of-the-art hardware considerations in comparison to a naive algorithm and the Qiskit optimiser.
A clever choice and design of gate sets can reduce the depth of a quantum circuit, and can improve the quality of the solution one obtains from a quantum algorithm. This is especially important for near-term quantum computers that suffer from various sources of error that propagate with the circuit depth. Parametrized gates in particular have found use in both near-term algorithms and circuit compilation. The one- and two-qubit versions of these gates have been demonstrated on various computing architectures. The neutral-atom platform has the capability to implement native N-qubit gates (for $N\ensuremath{\ge}2$). However, one needs to first find the control functions that implement these gates on the hardware. We study the numerical optimization of neural networks towards obtaining families of controls---laser pulses to excite an atom to Rydberg states---that implement phase gates with one and two controls, the C1P and C2P gates, respectively, on neutral-atom hardware. The pulses we obtain have a duration significantly shorter than the loss time scale, set by decay from the Rydberg state. In addition, they do not require single-site addressability and are smooth. Hence, we expect our gates to have immediate benefits for quantum algorithms implemented on current neutral-atom hardware.
Abstract With the ongoing advances in noisy intermediate-scale quantum hardware, variational quantum algorithms have demonstrated significant potential in a range of quantum applications. However, obtaining high-performance, shallow-parameterized quantum circuits typically requires repeated optimization of the gate parameters over a large set of candidate circuits, resulting in prohibitively high evaluation costs. To address this challenge, this study proposes a novel predictor-based quantum architecture search (PQAS-ZX) method that leverages ZX-calculus. In this approach, a quantum circuit is first represented as a ZX diagram that supports multi-step equivalent simplifications at the diagram level. By applying these equivalence transformations, multiple circuit variants that share the same performance metric are generated, thereby significantly expanding the training dataset and enhancing the ability of the predictor to manage diverse circuit structures. ZX diagrams offer more flexible characterizations of multi-qubit entanglement and phase interactions, as well as higher-level equivalent transformations, compared with the state-of-the-art predictor-based quantum architecture search with graph measures (PQAS-GM). Numerical simulations of three variational quantum eigensolver tasks, namely the transverse-field Ising, Heisenberg, and BeH2 molecular models, demonstrated that PQAS-ZX required only approximately 80.9%, 82.9%, and 76.1% of the queries required by PQAS-GM, respectively, to achieve the same probability of reaching the target ground-state energy. These results highlight the advantage of using ZX diagrams to identify high-quality circuits efficiently and alleviate the evaluation burden of quantum architecture searches.
A clever choice and design of gate sets can reduce the depth of a quantum circuit, and can improve the quality of the solution one obtains from a quantum algorithm. This is especially important for near-term quantum computers that suffer from various sources of error that propagate with the circuit depth. Parametrized gates in particular have found use in both near-term algorithms and circuit compilation. The one- and two-qubit versions of these gates have been demonstrated on various computing architectures. The neutral atom platform has the capability to implement native N-qubit gates (for N≥2). However, one needs to first find the control functions that implement these gates on the hardware. We study the numerical optimization of neural networks towards obtaining families of controls − laser pulses to excite an atom to Rydberg states − that implement phase gates with one and two controls, the C1P and C2P gates respectively, on neutral atom hardware. The pulses we obtain have a duration significantly shorter than the loss time scale, set by decay from the Rydberg state. Further, they do not require single-site addressability and are smooth. Hence, we expect our gates to have immediate benefits for quantum algorithms implemented on current neutral atom hardware.
We give an overview of the circuit optimisation methods used by tket, a compiler system for quantum software developed by Cambridge Quantum Computing Ltd. We focus on a novel technique based around phase gadgets, a family of multi-qubit quantum operations which occur naturally in a wide range of quantum circuits of practical interest. The phase gadgets have a simple presentation in the ZX-calculus, which makes it easy to reason about them. Taking advantage of this, we present an efficient method to translate the phase gadgets back to CNOT gates and single qubit operations suitable for execution on a quantum computer with significant reductions in gate count and circuit depth. We demonstrate the effectiveness of these methods on a quantum chemistry benchmarking set based on variational circuits for ground state estimation of small molecules.
Circuit synthesis of multi-controlled gates is crucial for qudit (d-level) quantum computing. This paper presents efficient synthesis schemes that reduce the elementary gate count for multi-controlled single-qudit gates. For synthesizing general (n−1)-controlled unitaries on n qudits, we reduce the controlled-increment (CINC) and generalized controlled-X (GCX) gate counts to O(n2), improving upon existing O(n2+log2d) CINC and O(n3) GCX bounds. For (n−1)-controlled special unitaries, this complexity is further reduced to O(n). Furthermore, we present a method for approximately synthesizing multi-controlled unitary gates with a linear complexity in the number of control qudits. By utilizing the proposed circuit, we present qudit-based circuit constructions for isometries and quantum channels from n to m qudits. Moreover, for the first time, we present a circuit synthesis scheme for single-controlled gates using SUM gates and single-qudit gates when d is prime. This enables all CINC-based circuits for various quantum operations to be converted into SUM-gate circuits while preserving the same asymptotic complexity. Finally, we establish a theoretical lower bound on the number of SUM and CINC gates required to synthesize general n-qudit unitaries.