Quantum spin dynamics as a model for quantum computer operation

Computer Physics Communications

et al. 2017

With the advent of public access to small gate-based quantum processors, it becomes necessary to develop a benchmarking methodology such that independent researchers can validate the operation of these processors. We explore the usefulness of a number of simple quantum circuits as benchmarks for gate-based quantum computing devices and show that circuits performing identity operations are very simple, scalable and sensitive to gate errors and are therefore very well suited for this task. We illustrate the procedure by presenting benchmark results for the IBM Quantum Experience, a cloud-based platform for gate-based quantum computing.Comment: Accepted for publication in Computer Physics Communication

Section: Identity Operationsmentioning

confidence: 99%

“…q [3] q [4] c 5 0 1 2 3 4 Figure 5: (color online) Circuit diagram to encode the central qubit |Q 2 into the logical codeword |Q 2 L given by Eqs. (10) and (11).…”

Section: Distance-three 5-qubit Codementioning

confidence: 99%

Section: The Ibm Quantum Experiencementioning

confidence: 99%

Section: The Ibm Quantum Experiencementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Benchmarking gate-based quantum computers

Michielsen

Nocon

Computer Physics Communications

et al. 2017

Benchmarking Advantage and D-Wave 2000Q quantum annealers with exact cover problems

Calaza

et al. 2022

Quantum Inf Process

We benchmark the quantum processing units of the largest quantum annealers to date, the $$5000+$$ 5000 + qubit quantum annealer Advantage and its 2000+ qubit predecessor D-Wave 2000Q, using tail assignment and exact cover problems from aircraft scheduling scenarios. The benchmark set contains small, intermediate, and large problems with both sparsely connected and almost fully connected instances. We find that Advantage outperforms D-Wave 2000Q for almost all problems, with a notable increase in success rate and problem size. In particular, Advantage is also able to solve the largest problems with 120 logical qubits that D-Wave 2000Q cannot solve anymore. Furthermore, problems that can still be solved by D-Wave 2000Q are solved faster by Advantage. We find, however, that D-Wave 2000Q can achieve better success rates for sparsely connected problems that do not require the many new couplers present on Advantage, so improving the connectivity of a quantum annealer does not per se improve its performance.

Massively parallel quantum computer simulator, eleven years later

Raedt

Jin

Computer Physics Communications

et al. 2019

A revised version of the massively parallel simulator of a universal quantum computer, described in this journal eleven years ago, is used to benchmark various gate-based quantum algorithms on some of the most powerful supercomputers that exist today. Adaptive encoding of the wave function reduces the memory requirement by a factor of eight, making it possible to simulate universal quantum computers with up to 48 qubits on the Sunway TaihuLight and on the K computer. The simulator exhibits close-to-ideal weak-scaling behavior on the Sunway TaihuLight, on the K computer, on an IBM Blue Gene/Q, and on Intel Xeon based clusters, implying that the combination of parallelization and hardware can track the exponential scaling due to the increasing number of qubits. Results of executing simple quantum circuits and Shor's factorization algorithm on quantum computers containing up to 48 qubits are presented.