Efficient Quantum Circuit Compilation for Near-Term Quantum Advantage

• URL: http://arxiv.org/abs/2501.07387v1
• Date: Mon, 13 Jan 2025 15:04:39 GMT
• Title: Efficient Quantum Circuit Compilation for Near-Term Quantum Advantage
• Authors: Yuchen Guo, Shuo Yang,
• Abstract summary: We propose an approximate method for compiling target quantum circuits into brick-wall layouts. This new circuit design consists of two-qubit CNOT gates that can be directly implemented on real quantum computers.
• Score: 17.38734393793605
• License:
• Abstract: Quantum noise in real-world devices poses a significant challenge in achieving practical quantum advantage, since accurately compiled and executed circuits are typically deep and highly susceptible to decoherence. To facilitate the implementation of complex quantum algorithms on noisy hardware, we propose an approximate method for compiling target quantum circuits into brick-wall layouts. This new circuit design consists of two-qubit CNOT gates that can be directly implemented on real quantum computers, in conjunction with optimized one-qubit gates, to approximate the essential dynamics of the original circuit while significantly reducing its depth. Our approach is evaluated through numerical simulations of time-evolution circuits for the critical Ising model, quantum Fourier transformation, and Haar-random quantum circuits, as well as experiments on IBM quantum platforms. By accounting for compilation error and circuit noise, we demonstrate that time evolution and quantum Fourier transformation circuits achieve high compression rates, while random quantum circuits are less compressible. The degree of compression is related to the rate of entanglement accumulation in the target circuit. In particular, experiments on IBM platforms achieve a compression rate of $12.5$ for $N=12$, significantly extending the application of current quantum devices. Furthermore, large-scale numerical simulations for system sizes up to $N=30$ reveal that the optimal depth $d_{\mathrm{max}}$ to achieve maximal overall fidelity is independent of system size $N$, suggesting the scalability of our method for large quantum devices in terms of quantum resources.

Related papers

• Redesign Quantum Circuits on Quantum Hardware Device [6.627541720714792]
  We present a new architecture which enables one to redesign large-scale quantum circuits on quantum hardware. For concreteness, we apply this architecture to three crucial applications in circuit optimization, including the equivalence checking of (non-) parameterized circuits. The feasibility of our approach is demonstrated by the excellent results of these applications, which are implemented both in classical computers and current NISQ hardware.
  arXiv  Detail & Related papers  (2024-12-30T12:05:09Z)
• 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)
• Quantum Fourier Transform using Dynamic Circuits [0.0]
  In dynamic quantum circuits, classical information from mid-circuit measurements is fed forward during circuit execution. In particular, the scaling of resource requirements is reduced from $O(n)$ two-qubit gates in a standard unitary formulation to $O(n)$ mid-circuit measurements in its dynamic counterpart.
  arXiv  Detail & Related papers  (2024-03-14T15:58:00Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• Efficient implementation of discrete-time quantum walks on quantum computers [0.0]
  We propose an efficient and scalable quantum circuit implementing the discrete-time quantum walk (DTQW) model. For $t$ time-steps of the DTQW, the proposed circuit requires only $O(n2 + nt)$ two-qubit gates compared to the $O(n2 t)$ of the current most efficient implementation.
  arXiv  Detail & Related papers  (2024-02-02T19:11:41Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
  We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most. We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
  arXiv  Detail & Related papers  (2022-04-12T19:39:31Z)
• 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)
• Exploiting dynamic quantum circuits in a quantum algorithm with superconducting qubits [0.207811670193148]
  We build dynamic quantum circuits on a superconducting-based quantum system. We exploit one of the most fundamental quantum algorithms, quantum phase estimation, in its adaptive version. We demonstrate that the version of real-time quantum computing with dynamic circuits can offer a substantial and tangible advantage.
  arXiv  Detail & Related papers  (2021-02-02T18:51:23Z)
• Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
  Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling. We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
  arXiv  Detail & Related papers  (2020-05-05T20:11:53Z)

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.