Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

How to benchmark a 100-qubit quantum computer using fewer than 100 circuits.

Timothy J Proctor, Kenneth Rudinger, Stefan Seritan, Daniel Stefan, Daniel Hothem, Jordan Hines, Thomas Catanach, Robin Blume-Kohout, Kevin C Young

Published Mar 1, 2022• 0 citations
Publisher
DOI
10.2172/2001913

Related papers

CNOT Gate Optimizations via Qubit Permutations for IBM's Quantum Architectures

Alexandre A. A. de Almeida, Gerhard W. Dueck, Alexandre César Rodrigues da Silva

IBM offers a number of quantum processors on which scientist can perform experiments. All single qubit gates from the Clifford+T gate library are implemented, but only a subset of the possible CNOT are provided. It is well known that the functionally of the missing gates can be obtained with a sequence of gates. The sequence of gates is based on SWAP gates. Up to seven elementary gates are required to implement a SWAP gate. In this paper we show how the same effect can be achieved with fewer gates. Then, we propose an approach to find all the possible mappings for the missing CNOT gates. IBM's QX5 is used as target architecture. The proposed approach was compared to an algorithm that maps quantum circuits to IBM architectures. The benchmarks without optimizations techniques showed that our approach found circuits with up to 50% fewer gates and with up to 47% fewer levels. To optimize the benchmark circuits the quantum computing framework Qiskit was used. Comparing the optimized mapped circuits, our approach found circuits with up to 50% fewer gates and with up to 49% fewer levels.

Journal of Low Power Electronics•Jun 1, 2019•5 citations

Benchmarking quantum processors with a single qubit

Oktay Göktaş, W. K. Tham, Kent Bonsma-Fisher +1 more

arXiv:1905.05775•Quantum Information Processing•Mar 18, 2020•7 citations

Technique for two‐dimensional nearest neighbour realisation of quantum circuits using weighted look‐ahead

Lalengmawia Chhangte, Alok Chakrabarty

Quantum computers that are based on technologies like superconducting and quantum dots impose a physical constraint that requires interacting qubits to be adjacent. The initial placement of qubits and the swap gate insertion techniques affect the circuit cost. The authors proposed a global qubit ordering technique that considers fewer permutations for the number of interactions a qubit does with other qubits of its circuit. They also performed the local re‐ordering of qubits by attempting to reduce the cost as much as possible; the cost is estimated by defining a window with weights assigned in such a way that nearby gates to the current gate in question are given higher weightage. Experiments have been conducted on NCV benchmarks, and results have been compared with those of recent state‐of‐the‐art techniques. When compared with the existing works, the proposed method shows improvements of up to 53.3% for smaller benchmarks and up to 51.61% for larger benchmarks.

IET Computers & Digital Techniques•Sep 18, 2020•4 citations

How to Benchmark Quantum Computers with Any Quantum Algorithm.

Stefan Seritan, Kenneth Rudinger, Aidan Wilber-Gauthier +4 more

•Oct 1, 2022•0 citations

Effective Quantum Simulator for Many 64-qubit Circuits.

Anh Quoc Nguyen, Michael Anshel

MSV•Jan 1, 2005•0 citations

A QUBO Formulation for Qubit Allocation

Bryan Dury, Olivia Di Matteo

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.

arXiv:2009.00140•Aug 31, 2020•17 citations
IBM offers a number of quantum processors on which scientist can perform experiments. All single qubit gates from the Clifford+T gate library are implemented, but only a subset of the possible CNOT are provided. It is well known that the functionally of the missing gates can be obtained with a sequence of gates. The sequence of gates is based on SWAP gates. Up to seven elementary gates are required to implement a SWAP gate. In this paper we show how the same effect can be achieved with fewer gates. Then, we propose an approach to find all the possible mappings for the missing CNOT gates. IBM's QX5 is used as target architecture. The proposed approach was compared to an algorithm that maps quantum circuits to IBM architectures. The benchmarks without optimizations techniques showed that our approach found circuits with up to 50% fewer gates and with up to 47% fewer levels. To optimize the benchmark circuits the quantum computing framework Qiskit was used. Comparing the optimized mapped circuits, our approach found circuits with up to 50% fewer gates and with up to 49% fewer levels.
Quantum computers that are based on technologies like superconducting and quantum dots impose a physical constraint that requires interacting qubits to be adjacent. The initial placement of qubits and the swap gate insertion techniques affect the circuit cost. The authors proposed a global qubit ordering technique that considers fewer permutations for the number of interactions a qubit does with other qubits of its circuit. They also performed the local re‐ordering of qubits by attempting to reduce the cost as much as possible; the cost is estimated by defining a window with weights assigned in such a way that nearby gates to the current gate in question are given higher weightage. Experiments have been conducted on NCV benchmarks, and results have been compared with those of recent state‐of‐the‐art techniques. When compared with the existing works, the proposed method shows improvements of up to 53.3% for smaller benchmarks and up to 51.61% for larger benchmarks.
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.