1000/1000
Hot
Most Recent
The quantum computer has been claimed to show more quantum advantage than the classical computer in solving some specific problems. Many companies and research institutes try to develop quantum computers with different physical implementations. Currently, most people only focus on the number of qubits in a quantum computer and consider it as a standard to evaluate the performance of the quantum computer intuitively. However, it is quite misleading in most times, especially for investors or governments. This is because the quantum computer works in a quite different way than classical computers. Thus, quantum benchmarking is of great importance. Currently, many quantum benchmarks are proposed from different aspects.
Name | Number of Qubits | QV | Avg.T1 (μs) | Avg.T2 (μs) | Avg.Readout Fidelity | Avg.CNOT Fidelity |
---|---|---|---|---|---|---|
brooklyn | 65 | 32 | 77.1686 | 74.6345 | 0.9682 | 0.9746 |
manhattan | 65 | 32 | 110.1959 | 101.6078 | 0.9761 | 0.9543 |
hanoi | 27 | 64 | 123.3959 | 93.4341 | 0.9837 | 0.991 |
sydney | 27 | 32 | 266.1433 | 256.6081 | 0.9833 | 0.9898 |
peekskill | 27 | N/A | 97.4474 | 107.0911 | 0.9821 | 0.9896 |
cairo | 27 | 64 | 76.01 | 97.6543 | 0.9796 | 0.989 |
toronto | 27 | 32 | 180.3614 | 155.1329 | 0.9869 | 0.9814 |
kolkata | 27 | 128 | 70.3363 | 75.2432 | 0.9698 | 0.9536 |
mumbai | 27 | 128 | 117.2574 | 92.1067 | 0.9484 | 0.9526 |
montreal | 27 | 128 | 81.004 | 104.678 | 0.938 | 0.4972 |
guadalupe | 16 | 32 | 132.6257 | 40.5357 | 0.977 | 0.9896 |
lagos | 7 | 32 | 158.6 | 57.702 | 0.9697 | 0.9912 |
jakarta | 7 | 16 | 74.214 | 104.008 | 0.9728 | 0.9895 |
perth | 7 | 32 | 155.0078 | 92.217 | 0.9118 | 0.9894 |
casablanca | 7 | 32 | 82.2681 | 96.0744 | 0.9696 | 0.9883 |
nairobi | 7 | 32 | 86.5337 | 107.1733 | 0.9428 | 0.9878 |
quito | 5 | 16 | 130.2629 | 100.9629 | 0.9859 | 0.9932 |
santiago | 5 | 32 | 105.2286 | 98.9143 | 0.9633 | 0.9909 |
manila | 5 | 32 | 100.56 | 101.29 | 0.9739 | 0.99 |
lima | 5 | 8 | 84.0278 | 84.4122 | 0.9829 | 0.9891 |
belem | 5 | 16 | 75.936 | 94.722 | 0.9676 | 0.9828 |
bogota | 5 | 32 | 92.454 | 124.096 | 0.959 | 0.9794 |
armonk | 1 | 1 | 118.1 | 149.22 | 0.967 | N/A |
Reference | Benchmark Name | Problems | Solution | Metrics |
---|---|---|---|---|
[12] | Qpack | Max-Cut, dominating set, and travelling salesman problem (TSP) | VQC | Runtime, best approximation error, success probability, and performance scaling |
[13] | Q-Score | TSP and Max-Cut | VQC | Q-Score |
[14] | F-VQE | Max-Cut | VQC | N/A |
[15] | Variational quantum factoring (VQF) and fermionic simulation | Variational quantum factoring (VQF) and fermionic simulation | VQC | The effective fermionic length of the device |
[16] | Machine learning application | Approximating an unknown probability distribution from data | Data-driven quantum circuit learning algorithm (DDQCL). | qBAS (bars and stripes) score |
[17] | 3 application-motivated quantum circuit | N/A | The quantum circuits include: the deep class of the quantum circuit is taken from the state preparation in the VQE (variational quantum eigensolver) algorithm; the shallow class of quantum circuits refers to the circuits whose depths increases slowly with the growth of width (number of qubits); square is inspired by the quantum volume benchmark. | Heavy output generation probability, cross-entropy difference and l1-norm distance |
[18] | Application-oriented performance benchmarks | N/A | The quantum circuits of the benchmark include: shallow simple Oracle-based algorithms, quantum Fourier transform (QFT), Grover’s search algorithm, phase and amplitude estimation, Monte Carlo sampling, variational quantum eigensolver (VQE), and Shor’s order finding. | The quality and execution time |
[19] | Quantum LINPACK | Dense random matrix in a quantum problem | RAndom Circuit Block-Encoded Matrix (RACBEM). | N/A |
[20] | Quantum chemistry benchmark | Electronic structure calculation instances | reduced unitary coupled cluster ansatz (UCC, a state preparation circuit) and hardware-efficient ansatz (Variational Quantum Eigensolver, VQE). | Performance and accuracy |
[21] | QASMBench | N/A | Quantum circuits are taken from chemistry, simulation, linear algebra, searching, optimization, arithmetic, machine learning, fault tolerance, cryptography. | circuit width, depth, gate density, retention lifespan, measurement density and entanglement variance |