English
Related papers

Related papers: Validating quantum computers using randomized mode…

200 papers

The quantum volume test is a full-system benchmark for quantum computers that is sensitive to qubit number, fidelity, connectivity, and other quantities believed to be important in building useful devices. The test was designed to produce a…

Quantum Physics · Physics 2022-05-11 Charles H. Baldwin , Karl Mayer , Natalie C. Brown , Ciarán Ryan-Anderson , David Hayes

In this work, we propose a generalization of the current most widely used quantum computing hardware metric known as the quantum volume. The quantum volume specifies a family of random test circuits defined such that the logical circuit…

Quantum Physics · Physics 2022-07-18 Keith Miller , Charles Broomfield , Ann Cox , Joe Kinast , Brandon Rodenburg

Quantum volume is a single-number metric which, loosely speaking, reports the number of usable qubits on a quantum computer. While improvements to the underlying hardware are a direct means of increasing quantum volume, the metric is…

Quantum Physics · Physics 2022-04-19 Ryan LaRose , Andrea Mari , Vincent Russo , Dan Strano , William J. Zeng

We improve the quality of quantum circuits on superconducting quantum computing systems, as measured by the quantum volume, with a combination of dynamical decoupling, compiler optimizations, shorter two-qubit gates, and excited state…

Rapid development of quantum computing technology has led to a wide variety of sophisticated quantum devices. Benchmarking these systems becomes crucial for understanding their capabilities and paving the way for future advancements. The…

Quantum Physics · Physics 2026-05-11 Rafał Bistroń , Marcin Rudziński , Ryszard Kukulski , Karol Życzkowski

Various benchmarking metrics have been developed to quantify the performance of quantum computing hardware and help evaluate development. However, it is not always necessary to know the metric values precisely. This is especially true for…

Quantum Physics · Physics 2025-02-04 Brandon Rodenburg

Quantum computers are on the brink of surpassing the capabilities of even the most powerful classical computers. This naturally raises the question of how one can trust the results of a quantum computer when they cannot be compared to…

Universal fault-tolerant quantum computers will require error-free execution of long sequences of quantum gate operations, which is expected to involve millions of physical qubits. Before the full power of such machines will be available,…

In theory, quantum computers can efficiently simulate quantum physics, factor large numbers and estimate integrals, thus solving otherwise intractable computational problems. In practice, quantum computers must operate with noisy devices…

Quantum Physics · Physics 2009-11-10 E. Knill

A quantum computer has now solved a specialized problem believed to be intractable for supercomputers, suggesting that quantum processors may soon outperform supercomputers on scientifically important problems. But flaws in each quantum…

Quantum Physics · Physics 2022-01-21 Timothy Proctor , Kenneth Rudinger , Kevin Young , Erik Nielsen , Robin Blume-Kohout

We show that counting the number of collisions (re-sampled bitstrings) when measuring a random quantum circuit provides a practical benchmark for the quality of a quantum computer and a quantitative noise characterization method. We…

Quantum Physics · Physics 2024-12-05 Andrea Mari

Quantum processors with sizes in the 10-100 qubit range are now increasingly common. However, with increased size comes increased complexity for benchmarking. The effectiveness of a given device may vary greatly between different tasks, and…

Quantum Physics · Physics 2018-06-08 James R. Wootton

Characterizing and mitigating errors in current noisy intermediate-scale devices is important to improve performance of next generations of quantum hardware. In order to investigate the importance of the different noise mechanisms affecting…

Quantum Physics · Physics 2023-02-14 Gabriele Cenedese , Giuliano Benenti , Maria Bondani

Recently Quantum Computation has generated a lot of interest due to the discovery of a quantum algorithm which can factor large numbers in polynomial time. The usefulness of a quantum com puter is limited by the effect of errors. Simulation…

Quantum Physics · Physics 2007-05-23 Kevin M. Obenland , Alvin M. Despain

Compilation and optimization of quantum circuits are critical components in the execution of algorithms on quantum computers. These components must successfully balance two competing priorities: minimizing the number of expensive resources,…

Quantum systems, in general, output data that cannot be simulated efficiently by a classical computer, and hence is useful for solving certain mathematical problems and simulating quantum many-body systems. This also implies, unfortunately,…

Quantum Physics · Physics 2017-10-04 Keisuke Fujii , Masahito Hayashi

Medium-scale quantum devices that integrate about hundreds of physical qubits are likely to be developed in the near future. However, such devices will lack the resources for realizing quantum fault tolerance. Therefore, the main challenge…

Quantum Physics · Physics 2021-12-24 Chao Song , Jing Cui , H. Wang , J. Hao , H. Feng , Ying Li

Quantum tomography is the main method used to assess the quality of quantum information processing devices, but its complexity presents a major obstacle for the characterization of even moderately large systems. The number of experimental…

Quantum Physics · Physics 2015-03-19 Marcus P. da Silva , Olivier Landon-Cardinal , David Poulin

A critical question for the field of quantum computing in the near future is whether quantum devices without error correction can perform a well-defined computational task beyond the capabilities of state-of-the-art classical computers,…

Accurately estimating the performance of quantum hardware is crucial for comparing different platforms and predicting the performance and feasibility of quantum algorithms and applications. In this paper, we tackle the problem of…

‹ Prev 1 2 3 10 Next ›