Automated Auxiliary Qubit Allocation in High-Level Quantum Programming

• URL: http://arxiv.org/abs/2412.20543v1
• Date: Sun, 29 Dec 2024 18:19:06 GMT
• Title: Automated Auxiliary Qubit Allocation in High-Level Quantum Programming
• Authors: Evandro C. R. Rosa, Jerusa Marchi, Eduardo I. Duzzioni, Rafael de Santiago,
• Abstract summary: We present a method for optimizing quantum circuit compilation by automating the allocation of auxiliary qubits for multi-qubit gate decompositions. This approach is implemented and evaluated within the high-level quantum programming platform Ket.
• Score: 0.31457219084519
• License:
• Abstract: We present a method for optimizing quantum circuit compilation by automating the allocation of auxiliary qubits for multi-qubit gate decompositions. This approach is implemented and evaluated within the high-level quantum programming platform Ket. Our results indicate that the decomposition of multi-qubit gates is more effectively handled by the compiler, which has access to all circuit parameters, rather than through a quantum programming API. To evaluate the approach, we compared our implementation against Qiskit, a widely used quantum programming platform, by analyzing two quantum algorithms. Using a 16-qubit QPU, we observed a reduction of 87% in the number of CNOT gates in Grover's algorithm for 9 qubits. For a state preparation algorithm with 7 qubits, the number of CNOT gates was reduced from $2.8\times10^7$ to $5.7\times10^3$, leveraging additional Ket optimizations for high-level quantum program constructions. Overall, a quadratic reduction in the number of CNOT gates in the final circuit was observed, with greater improvements achieved when more auxiliary qubits were available. These findings underscore the importance of automatic resource management, such as auxiliary qubit allocation, in optimizing quantum applications and improving their suitability for near-term quantum hardware.

Related papers

• Tackling Coherent Noise in Quantum Computing via Cross-Layer Compiler Optimization [1.6436891312063917]
  Quantum computing hardware is affected by quantum noise that undermine the quality of results of an executed quantum program. Coherent error that caused by parameter drifting and miscalibration remains critical. This work proposes a cross-layer approach for coherent error mitigation.
  arXiv  Detail & Related papers  (2024-10-12T22:39:06Z)
• SWAP-less Implementation of Quantum Algorithms [0.0]
  We present a formalism based on tracking the flow of parity quantum information to implement algorithms on devices with limited connectivity. We leverage the fact that entangling gates not only manipulate quantum states but can also be exploited to transport quantum information.
  arXiv  Detail & Related papers  (2024-08-20T14:51:00Z)
• Route-Forcing: Scalable Quantum Circuit Mapping for Scalable Quantum Computing Architectures [41.39072840772559]
  Route-Forcing is a quantum circuit mapping algorithm that shows an average speedup of $3.7times$. We present a quantum circuit mapping algorithm that shows an average speedup of $3.7times$ compared to the state-of-the-art scalable techniques.
  arXiv  Detail & Related papers  (2024-07-24T14:21:41Z)
• Optimizing Gate Decomposition for High-Level Quantum Programming [0.0]
  Multi-controlled quantum gates naturally arise in high-level quantum programming. This paper presents novel methods for optimizing multi-controlled quantum gates. We demonstrate significant reductions in the number of CNOT gates.
  arXiv  Detail & Related papers  (2024-06-08T21:36:08Z)
• 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)
• 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)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• Hardware-Conscious Optimization of the Quantum Toffoli Gate [11.897854272643634]
  This manuscript expands the analytical and numerical approaches for optimizing quantum circuits at this abstraction level. We present a procedure for combining the strengths of analytical native gate-level optimization with numerical optimization. Our optimized Toffoli gate implementation demonstrates an $18%$ reduction in infidelity compared with the canonical implementation.
  arXiv  Detail & Related papers  (2022-09-06T17:29:22Z)
• Space-efficient binary optimization for variational computing [68.8204255655161]
  We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem. We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
  arXiv  Detail & Related papers  (2020-09-15T18:17:27Z)
• 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.