Scalable Full-Stack Benchmarks for Quantum Computers
Quantum processors are now able to run quantum circuits that are infeasible to simulate classically, creating a need for benchmarks that assess a quantum processor's rate of errors when running these circuits. Here, we introduce a general technique for creating efficient benchmarks from a...
Saved in:
Main Authors: | Jordan Hines, Timothy Proctor |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2024-01-01
|
Series: | IEEE Transactions on Quantum Engineering |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/10538040/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Learning a Quantum Computer's Capability
by: Daniel Hothem, et al.
Published: (2024-01-01) -
Evolutionary Algorithms and Quantum Computing: Recent Advances, Opportunities, and Challenges
by: Junaid Ur Rehman, et al.
Published: (2025-01-01) -
A Non-Redundant Benchmark for Symmetric Protein Docking
by: Yumeng Yan, et al.
Published: (2019-06-01) -
Quantum algorithms for enhanced educational technologies
by: Basil Hanafi, et al.
Published: (2025-01-01) -
Digital quantum simulation of cosmological particle creation with IBM quantum computers
by: Marco D. Maceda, et al.
Published: (2025-01-01)