Clifford Circuit Optimization with Templates and Symbolic Pauli Gates
- URL: http://arxiv.org/abs/2105.02291v2
- Date: Thu, 11 Nov 2021 21:22:53 GMT
- Title: Clifford Circuit Optimization with Templates and Symbolic Pauli Gates
- Authors: Sergey Bravyi, Ruslan Shaydulin, Shaohan Hu, Dmitri Maslov
- Abstract summary: The Clifford group is a finite subgroup of the unitary group generated by the Hadamard, the CNOT, and the Phase gates.
Here we consider the problem of finding a short quantum circuit implementing a given Clifford group element.
Our methods aim to minimize the entangling gate count assuming all-to-all qubit connectivity.
- Score: 11.978356827088595
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: The Clifford group is a finite subgroup of the unitary group generated by the
Hadamard, the CNOT, and the Phase gates. This group plays a prominent role in
quantum error correction, randomized benchmarking protocols, and the study of
entanglement. Here we consider the problem of finding a short quantum circuit
implementing a given Clifford group element. Our methods aim to minimize the
entangling gate count assuming all-to-all qubit connectivity. First, we
consider circuit optimization based on template matching and design
Clifford-specific templates that leverage the ability to factor out Pauli and
SWAP gates. Second, we introduce a symbolic peephole optimization method. It
works by projecting the full circuit onto a small subset of qubits and
optimally recompiling the projected subcircuit via dynamic programming. CNOT
gates coupling the chosen subset of qubits with the remaining qubits are
expressed using symbolic Pauli gates. Software implementation of these methods
finds circuits that are only 0.2% away from optimal for 6 qubits and reduces
the two-qubit gate count in circuits with up to 64 qubits by 64.7% on average,
compared with the Aaronson-Gottesman canonical form.
Related papers
- Linear Circuit Synthesis using Weighted Steiner Trees [45.11082946405984]
CNOT circuits are a common building block of general quantum circuits.
This article presents state-of-the-art algorithms for optimizing the number of CNOT gates.
A simulated evaluation shows that the suggested is almost always beneficial and reduces the number of CNOT gates by up to 10%.
arXiv Detail & Related papers (2024-08-07T19:51:22Z) - Efficient Implementation of Multi-Controlled Quantum Gates [0.0]
We present an implementation of multi-controlled quantum gates which provides significant reductions of cost compared to state-of-the-art methods.
We extend our methods for any number of target qubits, and provide further cost reductions if additional ancilla qubits are available.
arXiv Detail & Related papers (2024-04-02T20:13:18Z) - Efficient DCQO Algorithm within the Impulse Regime for Portfolio
Optimization [41.94295877935867]
We propose a faster digital quantum algorithm for portfolio optimization using the digitized-counterdiabatic quantum optimization (DCQO) paradigm.
Our approach notably reduces the circuit depth requirement of the algorithm and enhances the solution accuracy, making it suitable for current quantum processors.
We experimentally demonstrate the advantages of our protocol using up to 20 qubits on an IonQ trapped-ion quantum computer.
arXiv Detail & Related papers (2023-08-29T17:53:08Z) - Optimization at the Interface of Unitary and Non-unitary Quantum
Operations in PCOAST [0.3496513815948205]
Pauli-based Circuit Optimization, Analysis and Synthesis Toolchain (PCOAST) introduced as framework for optimizing quantum circuits.
In this paper, we focus on the set of subroutines which look to optimize the PCOAST graph in cases involving unitary and non-unitary operations.
We evaluate the PCOAST optimization subroutines using the Intel Quantum SDK on examples of the Variational Quantum Eigensolver (VQE) algorithm.
arXiv Detail & Related papers (2023-05-16T22:58:14Z) - Tackling the Qubit Mapping Problem with Permutation-Aware Synthesis [9.885057869188087]
We propose a novel hierarchical qubit mapping and routing algorithm.
In the second stage permutation-aware synthesis (PAS), each block is optimized and synthesized in isolation.
In the third stage a permutation-aware mapping (PAM) algorithm maps the blocks to the target device based on the information from the second stage.
arXiv Detail & Related papers (2023-05-04T15:39:54Z) - Iterative Qubit Coupled Cluster using only Clifford circuits [36.136619420474766]
An ideal state preparation protocol can be characterized by being easily generated classically.
We propose a method that meets these requirements by introducing a variant of the iterative qubit coupled cluster (iQCC)
We demonstrate the algorithm's correctness in ground-state simulations and extend our study to complex systems like the titanium-based compound Ti(C5H5)(CH3)3 with a (20, 20) active space.
arXiv Detail & Related papers (2022-11-18T20:31:10Z) - Demonstrating scalable randomized benchmarking of universal gate sets [0.0]
We introduce and demonstrate a technique for scalable Randomized (RB) of many universal and continuously parameterized gate sets.
We use our technique to benchmark universal gate sets on four qubits of the Advanced Quantum Testbed.
We demonstrate that our technique scales to many qubits with experiments on a 27-qubit IBM Q processor.
arXiv Detail & Related papers (2022-07-15T03:41:21Z) - 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) - A Generic Compilation Strategy for the Unitary Coupled Cluster Ansatz [68.8204255655161]
We describe a compilation strategy for Variational Quantum Eigensolver (VQE) algorithms.
We use the Unitary Coupled Cluster (UCC) ansatz to reduce circuit depth and gate count.
arXiv Detail & Related papers (2020-07-20T22:26:16Z) - 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.