# A QUBO Formulation for Qubit Allocation

@article{Dury2020AQF, title={A QUBO Formulation for Qubit Allocation}, author={Bryan Dury and Olivia Di Matteo}, journal={arXiv: Quantum Physics}, year={2020} }

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…

## Figures and Tables from this paper

## 2 Citations

### Efficient Quantum Circuit Design with a Standard Cell Approach

- Computer Science
- 2022

This work designs quantum circuits by using a standard cell approach, and forms standard cells to support Toffoli gate decompositions and presents evidence that this method achieves shallower 3D circuits (by at least 2.5x) and with less SWAPs.

### NetQASM—a low-level instruction set architecture for hybrid quantum–classical programs in a quantum internet

- Computer ScienceQuantum Science and Technology
- 2022

NetQASM is a universal, platform-independent and extendable instruction set with support for local quantum gates, powerful classical logic and quantum networking operations for remote entanglement generation, which enables quantum network applications to be programmed in high-level platform- independent software, which is not possible using any other QASM variants.

## References

SHOWING 1-7 OF 7 REFERENCES

### Demonstration of quantum volume 64 on a superconducting quantum computing system

- Physics, Computer Science
- 2020

We improve the quality of quantum circuits on superconducting quantum computing systems, as measured by the quantum volume (QV), with a combination of dynamical decoupling, compiler optimizations,…

### Optimal Layout Synthesis for Quantum Computing

- Computer Science2020 IEEE/ACM International Conference On Computer Aided Design (ICCAD)
- 2020

Two synthesizers are presented, one optimal and one approximate but nearly optimal, which outperforms some leading heuristic approaches and reduces time and space complexity exponentially compared to some leading optimal approaches to layout synthesis.

### Mapping NP-hard and NP-complete optimisation problems to Quadratic Unconstrained Binary Optimisation problems

- BusinessArXiv
- 2019

Several mappings from well-known NP-hard problems to Quadratic Unconstrained Binary Optimisation problems which are treated incorrectly by Lucas are discussed and counterexamples are provided to correct the mappings.

### Neural Networks for Fast Estimation of Social Network Centrality Measures

- Computer Science
- 2015

It is shown that neural networks can be effective in learning and estimating the ordering of vertices in a social network based on centrality measures, requiring far less computational effort, and proving to be faster than early termination of the power grid method that can be used for computing these measures.

### Handbook of Combinatorial Optimization

- Computer Science
- 1998

The Steiner Ratio of Banach-Minkowski Space and Probabilistic Verification and Non-Approximability and Network-Based Model and Algorithms in Data Mining and Knowledge Discovery are studied.

### Efficient implementation of quantum circuits with limited qubit interactions

- Physics, Computer ScienceQuantum Inf. Comput.
- 2017

This work provides an interaction graph together with an efficient method for compiling quantum circuits so that gates are applied only locally and enables the network to emulate a single monolithic device with minimal overhead.

### Efficient sequential consistency via conflict ordering

- Computer ScienceASPLOS XVII
- 2012

This paper identifies those conflicting memory operations whose ordering is critical for the maintenance of SC and explicitly order them, which allows us to safely (non-speculatively) complete memory operations past pending writes, thus reducing memory ordering stalls.