A QUBO Formulation for Qubit Allocation
- URL: http://arxiv.org/abs/2009.00140v2
- Date: Sat, 28 Nov 2020 22:09:44 GMT
- Title: A QUBO Formulation for Qubit Allocation
- Authors: Bryan Dury, Olivia Di Matteo
- Abstract summary: present-day quantum computers have a limited number of qubits, connectivity constraints, and varying gate fidelities.
In this work we formulate and implement the qubit placement problem as a quadratic, unconstrained binary optimization (QUBO) problem and solve it using simulated annealing to obtain a spectrum of initial placements.
Compared to contemporary allocation methods available in t|ket$rangle $ and Qiskit, the QUBO method yields allocations with improved circuit depth for $>$50% of a large set of benchmark circuits, with many also requiring fewer CX gates.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: To run an algorithm on a quantum computer, one must choose an assignment from
logical qubits in a circuit to physical qubits on quantum hardware. This task
of initial qubit placement, or qubit allocation, is especially important on
present-day quantum computers which have a limited number of qubits,
connectivity constraints, and varying gate fidelities. In this work we
formulate and implement the qubit placement problem as a quadratic,
unconstrained binary optimization (QUBO) problem and solve it using simulated
annealing to obtain a spectrum of initial placements. Compared to contemporary
allocation methods available in t|ket$\rangle $ and Qiskit, the QUBO method
yields allocations with improved circuit depth for $>$50% of a large set of
benchmark circuits, with many also requiring fewer CX gates.
Related papers
- Efficient Variational Quantum Algorithms via Circuit Knitting and Architecture Search [14.667623160371013]
We introduce CKVQA, a framework that applies circuit knitting to variational quantum algorithms (VQAs)<n>CKVQA aims to minimize the sampling overhead by identifying parameterized quantum circuits that achieve a favorable balance between algorithmic performance and sampling overhead.<n>We have developed a subcircuit-level optimization method to accelerate the training of VQAs and reduce overall execution time.
arXiv Detail & Related papers (2025-08-05T12:27:19Z) - Optimization and Synthesis of Quantum Circuits with Global Gates [44.99833362998488]
We use global interactions, such as the Global Molmer-Sorensen gate present in ion trap hardware, to optimize and synthesize quantum circuits.<n>The algorithm is based on the ZX-calculus and uses a specialized circuit extraction routine that groups entangling gates into Global MolmerSorensen gates.<n>We benchmark the algorithm in a variety of circuits, and show how it improves their performance under state-of-the-art hardware considerations.
arXiv Detail & Related papers (2025-07-28T10:25:31Z) - Efficient Algorithms for Quantum Hashing [0.0]
We present a circuit that implements the phase form of quantum hashing using $2n-1$ CNOT gates.<n>We also propose an algorithm that provides a trade-off between the number of CNOT gates and the precision of rotation angles.
arXiv Detail & Related papers (2025-07-09T16:32:15Z) - Optimizing Quantum Circuits via ZX Diagrams using Reinforcement Learning and Graph Neural Networks [38.499527873574436]
We introduce a framework based on ZX calculus, graph-neural networks and reinforcement learning for quantum circuit optimization.
By combining reinforcement learning and tree search, our method addresses the challenge of selecting optimal sequences of ZX calculus rewrite rules.
We demonstrate our method's competetiveness with state-of-the-art circuit generalizations and capabilities on large sets of diverse random circuits.
arXiv Detail & Related papers (2025-04-04T13:19:08Z) - 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) - Resource-aware scheduling of multiple quantum circuits on a hardware device [0.0]
We consider an optimization problem which schedules as many circuits as possible for execution in parallel on the hardware.
An integer linear programming formulation to ensure maximum fidelity while preserving the nearest neighbor arrangement among interacting qubits is presented.
arXiv Detail & Related papers (2024-07-12T02:33:07Z) - A Fast and Adaptable Algorithm for Optimal Multi-Qubit Pathfinding in Quantum Circuit Compilation [0.0]
This work focuses on multi-qubit pathfinding as a critical subroutine within the quantum circuit compilation mapping problem.
We introduce an algorithm, modelled using binary integer linear programming, that navigates qubits on quantum hardware optimally with respect to circuit SWAP-gate depth.
We have benchmarked the algorithm across a variety of quantum hardware layouts, assessing properties such as computational runtimes, solution SWAP depths, and accumulated SWAP-gate error rates.
arXiv Detail & Related papers (2024-05-29T05:59:15Z) - Digitized Counterdiabatic Quantum Algorithms for Logistics Scheduling [33.04597339860113]
We propose digitized counterdiabatic quantum optimization (DCQO)algorithms for two scheduling problems.<n>For the job-shop scheduling problem, we aim at finding the optimal schedule for a robot executing a number of tasks under specific constraints.<n>For the traveling salesperson problem, the goal is to find the path that covers all cities and is associated with the shortest traveling distance.
arXiv Detail & Related papers (2024-05-24T16:53:30Z) - Quantum circuit for multi-qubit Toffoli gate with optimal resource [6.727984016678534]
We design new quantum circuits for the $n$-Toffoli gate and general multi-controlled unitary, which have only $O(log n)$-depth and $O(n)$-size.
We demonstrate that without the assistance of ancillary qubit, any quantum circuit implementation of multi-qubit Toffoli gate must employ exponential precision gates.
arXiv Detail & Related papers (2024-02-07T17:53:21Z) - A two-circuit approach to reducing quantum resources for the quantum lattice Boltzmann method [41.66129197681683]
Current quantum algorithms for solving CFD problems use a single quantum circuit and, in some cases, lattice-based methods.
We introduce the a novel multiple circuits algorithm that makes use of a quantum lattice Boltzmann method (QLBM)
The problem is cast as a stream function--vorticity formulation of the 2D Navier-Stokes equations and verified and tested on a 2D lid-driven cavity flow.
arXiv Detail & Related papers (2024-01-20T15:32:01Z) - 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) - 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) - Qubit-reuse compilation with mid-circuit measurement and reset [0.0]
We introduce the idea of qubit-reuse compilation, which takes as input a quantum circuit and produces as output a compiled circuit.
We show that optimal qubit-reuse compilation requires the same number of qubits to execute a circuit as its dual.
We experimentally realize an 80-qubit QAOA MaxCut circuit on the 20-qubit Quantinuum H1-1 trapped ion quantum processor.
arXiv Detail & Related papers (2022-10-14T18:11:43Z) - 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) - 2D Qubit Placement of Quantum Circuits using LONGPATH [1.6631602844999722]
Two algorithms are proposed to optimize the number of SWAP gates in any arbitrary quantum circuit.
Our approach has a significant reduction in number of SWAP gates in 1D and 2D NTC architecture.
arXiv Detail & Related papers (2020-07-14T04:09:52Z) - 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.