Algorithmic qubits

Algorithmic Qubits (AQ) are an application based benchmark of quantum computers. Introduced by IonQ in 2020, the goal was to define a "single number figure of merit to evaluate the performance of quantum computers for solving a representative set of quantum algorithms."[1] While other benchmarks such as IBM's Quantum volume are run on random quantum circuits that do not necessarily have practical applications, AQ is measured on specific algorithms which are known to have value by industry, such as those defined by the Quantum Economic Development Consortium. [1]

Definition

IonQ published code for calculating AQ in a Git code repository. [2] The formal definition of calculating AQ is composed of several steps:

  • Let the set of circuits in the benchmark suite be denoted by C.
  • Locate each circuit c ∈ C as a point on the 2D plot by its Width, wc (Number of qubits), and Depth, dc (Number of Controlled NOT (CX) gates)
  • Define success probability for a Quantum circuit c, Fc
    • The circuit passes if Fc - ϵc > t, where ϵc is the statistical error based on the number of shots, where sc is the number of runs, and t = 1/e = 0.37 is the threshold.
  • Then, #AQ = N, where N=max.

The data is usually shown graphically as a volumetric plot.

Algorithms used to define AQ 1.0

Algorithm Circuit width Number of circuits per width
Quantum Fourier transform >2 3
Quantum phase estimation algorithm >3 3
Quantum amplitude estimation >3 3
Monte Carlo sampling >4 1
VQE simulation Even numbers between 4–12 3
Hamiltonian simulation Even numbers between 2–20 1

Table of scores

Date Company Machine AQ
March 2023 IonQ Aria 20 [2]
March 2023 Quantinuum H1 12 [2]
March 2023 IBM Guadalupe 6[2]
March 2023 Rigetti Aspen-M1 5[2]
September 2023 IonQ Forte 29[3]
March 2024 Quantinuum H2-1 26[4]
March 2024 IonQ Forte 9[4]
March 2024 Quantinuum H2-1 32[4]
March 2024 IonQ Forte 29[4]
December 2024 IonQ Forte Enterprise 36[5]
September 2025 IonQ Tempo 64[6]

Limitations and criticisms

There are several known limitations of the benchmark. Error mitigation techniques can enhance the performance of quantum computers being tested. Specifically, certain mitigations do not scale well to the size of the computer can result with misleading results. Additionally, the restricted number of different circuits used during protocol affects the robustness of results.[3]

The metric has been criticized as easy to manipulate. Quantinuum's Dr. Charlie Baldwin states "error mitigation, including plurality voting, may be a useful tool for some near-term quantum computing but it doesn’t work for every problem and it’s unlikely to be scalable to larger systems."[4]

References

  1. ^ "IonQ Algorithmic Qubits (#AQ)". IonQ. Retrieved 2025-09-19.
  2. ^ a b c d "Algorithmic Qubits: A Better Single-Number Metric". IonQ. Retrieved 2025-09-19.
  3. ^ a b "Algorithmic Qubit Benchmark". Quantum Benchmark Zoo. 16 September 2025. Retrieved 19 September 2025.
  4. ^ a b c d e "Debunking algorithmic qubits". www.quantinuum.com. Retrieved 2025-09-19.
  5. ^ "IonQ Unveils Its First Quantum Computer in Europe, Online Now at a Record #AQ36". IonQ. Retrieved 2025-09-19.
  6. ^ "IonQ Achieves Record Breaking Quantum Performance Milestone of #AQ 64". IonQ. Retrieved 2025-09-26.

Content Disclaimer

Informasi ini disarikan dari Wikipedia dan disajikan kembali untuk tujuan edukasi. Konten tersedia di bawah lisensi CC BY-SA 3.0. Kami tidak bertanggung jawab atas ketidakakuratan data yang bersumber dari kontribusi publik tersebut.

  1. The information displayed on this website is sourced in part or in whole from Wikipedia and has been adapted for the purpose of restating it. We strive to provide accurate and relevant information, however:
  2. There is no guarantee of absolute accuracy. Wikipedia is an open, collaborative project that can be edited by anyone, so information is subject to change.
  3. It is not intended to constitute professional advice. The content displayed is for informational and educational purposes only. For important decisions (e.g., medical, legal, or financial), please consult a professional.
  4. Content copyright. Wikipedia is licensed under the Creative Commons Attribution-ShareAlike License (CC BY-SA). This means that content may be reused with appropriate attribution and shared under a similar license.
  5. Responsible use. Any risk arising from the use of information from this website is entirely the responsibility of the user.