Awesome Quantum Computing Experiments: Benchmarking Experimental Progress Towards Fault-Tolerant Quantum Computation

• URL: http://arxiv.org/abs/2507.03678v1
• Date: Fri, 04 Jul 2025 15:56:28 GMT
• Title: Awesome Quantum Computing Experiments: Benchmarking Experimental Progress Towards Fault-Tolerant Quantum Computation
• Abstract summary: This work reviews and benchmarks experimental advancements towards fault-tolerant quantum computation (FTQC)<n>We analyze key physical metrics like coherence times, entanglement error, and system size (qubit count)<n>At the logical level, we survey the implementation landscape of QEC codes.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Achieving fault-tolerant quantum computation (FTQC) demands simultaneous progress in physical qubit performance and quantum error correction (QEC). This work reviews and benchmarks experimental advancements towards FTQC across leading platforms, including trapped ions, superconducting circuits, neutral atoms, NV centers, and semiconductors. We analyze key physical metrics like coherence times, entanglement error, and system size (qubit count), fitting observed exponential trends to characterize multi-order-of-magnitude improvements over the past two decades. At the logical level, we survey the implementation landscape of QEC codes, tracking realized parameters $[[n, k, d]]$ and complexity from early demonstrations to recent surface and color code experiments. Synthesizing these physical and logical benchmarks reveals substantial progress enabled by underlying hardware improvements, while also outlining persistent challenges towards scalable FTQC. The experimental databases and analysis code underpinning this review are publicly available at https://github.com/francois-marie/awesome-quantum-computing-experiments.

Related papers

• Continual Quantum Architecture Search with Tensor-Train Encoding: Theory and Applications to Signal Processing [68.35481158940401]
  CL-QAS is a continual quantum architecture search framework.<n>It mitigates challenges of costly encoding amplitude and forgetting in variational quantum circuits.<n>It achieves controllable robustness expressivity, sample-efficient generalization, and smooth convergence without barren plateaus.
  arXiv  Detail & Related papers  (2026-01-10T02:36:03Z)
• Investigation of Hardware Architecture Effects on Quantum Algorithm Performance: A Comparative Hardware Study [0.0]
  Cloud-accessible quantum processors enable direct execution of quantum algorithms on heterogeneous hardware platforms.<n>We benchmark five representative quantum algorithms across trapped-ion, superconducting, and simulator backends using Amazon Braket.
  arXiv  Detail & Related papers  (2026-01-07T15:29:52Z)
• QuSquare: Scalable Quality-Oriented Benchmark Suite for Pre-Fault-Tolerant Quantum Devices [0.19116784879310025]
  QuSquare consists of four benchmark tests that evaluate quantum hardware performance at both the system and application levels.<n>These benchmarks offer an integral, hardware-agnostic, and impartial methodology to quantify the quality and capabilities of current quantum computers.
  arXiv  Detail & Related papers  (2025-12-22T18:44:01Z)
• The EU Quantum Flagship's Key Performance Indicators for Quantum Computing [0.12099984425168675]
  We present a suite of scalable quantum computing benchmarks developed as key performance indicators (KPIs) within the EU Quantum Flagship.<n>These benchmarks are designed to assess holistic system performance rather than isolated components.
  arXiv  Detail & Related papers  (2025-12-22T18:30:06Z)
• Benchmarking Distributed Quantum Computing Emulators [1.031136645551641]
  Distributed quantum computing (DQC) addresses this challenge by interconnecting smaller quantum nodes through quantum communication protocols.<n>We introduce a benchmarking framework to evaluate DQC emulators.<n>We benchmark four representative emulators: Qiskit Aer, SquidASM, Interlin-q, and SQUANCH.
  arXiv  Detail & Related papers  (2025-12-01T15:42:06Z)
• QHackBench: Benchmarking Large Language Models for Quantum Code Generation Using PennyLane Hackathon Challenges [4.826802034066811]
  This paper benchmarks Large Language Models for PennyLane-based quantum code generation using real-world challenges from the Quantum Hackathon (QHack)<n>We introduce QHackBench, a novel benchmark dataset derived from QHack competitions, and evaluate model performance under vanilla prompting and Retrieval-Augmented Generation (RAG)<n>Results indicate that RAG-enhanced models, supplemented with an augmented PennyLane dataset, approximately generate similar results as the standard prompting, particularly in complex quantum algorithms.
  arXiv  Detail & Related papers  (2025-06-24T20:54:56Z)
• VQC-MLPNet: An Unconventional Hybrid Quantum-Classical Architecture for Scalable and Robust Quantum Machine Learning [60.996803677584424]
  Variational Quantum Circuits (VQCs) offer a novel pathway for quantum machine learning.<n>Their practical application is hindered by inherent limitations such as constrained linear expressivity, optimization challenges, and acute sensitivity to quantum hardware noise.<n>This work introduces VQC-MLPNet, a scalable and robust hybrid quantum-classical architecture designed to overcome these obstacles.
  arXiv  Detail & Related papers  (2025-06-12T01:38:15Z)
• An Efficient Quantum Classifier Based on Hamiltonian Representations [50.467930253994155]
  Quantum machine learning (QML) is a discipline that seeks to transfer the advantages of quantum computing to data-driven tasks.<n>We propose an efficient approach that circumvents the costs associated with data encoding by mapping inputs to a finite set of Pauli strings.<n>We evaluate our approach on text and image classification tasks, against well-established classical and quantum models.
  arXiv  Detail & Related papers  (2025-04-13T11:49:53Z)
• Exploring experimental limit of deep quantum signal processing using a trapped-ion simulator [8.799262240357171]
  We report the first experimental realization of deep QSP circuits in a trapped-ion quantum simulator.<n>Our results reveal a crucial trade-off between the precision of function simulation and the concomitant accumulation of hardware noise.<n>This work addresses a key gap in understanding the scalability and limitations of QSP-based algorithms on quantum hardware.
  arXiv  Detail & Related papers  (2025-02-27T15:37:42Z)
• Benchmarking quantum devices beyond classical capabilities [1.2499537119440245]
  The Quantum Volume (QV) test is one of the most widely used benchmarks for evaluating quantum computer performance.<n>We propose modifications of the QV test that allow for direct determination of the most probable outcomes.
  arXiv  Detail & Related papers  (2025-02-04T18:50:47Z)
• Sparse Quantum State Preparation for Strongly Correlated Systems [0.0]
  In principle, the encoding of the exponentially scaling many-electron wave function onto a linearly scaling qubit register offers a promising solution to overcome the limitations of traditional quantum chemistry methods. An essential requirement for ground state quantum algorithms to be practical is the initialisation of the qubits to a high-quality approximation of the sought-after ground state. Quantum State Preparation (QSP) allows the preparation of approximate eigenstates obtained from classical calculations, but it is frequently treated as an oracle in quantum information.
  arXiv  Detail & Related papers  (2023-11-06T18:53:50Z)
• Quantum Machine Learning on Near-Term Quantum Devices: Current State of Supervised and Unsupervised Techniques for Real-World Applications [1.7041248235270652]
  This survey focuses on selected supervised and unsupervised learning applications executed on quantum hardware. It covers techniques like encoding, ansatz structure, error mitigation, and gradient methods to address these challenges.
  arXiv  Detail & Related papers  (2023-07-03T10:12:34Z)
• Quantum Imitation Learning [74.15588381240795]
  We propose quantum imitation learning (QIL) with a hope to utilize quantum advantage to speed up IL. We develop two QIL algorithms, quantum behavioural cloning (Q-BC) and quantum generative adversarial imitation learning (Q-GAIL) Experiment results demonstrate that both Q-BC and Q-GAIL can achieve comparable performance compared to classical counterparts.
  arXiv  Detail & Related papers  (2023-04-04T12:47:35Z)
• QuanGCN: Noise-Adaptive Training for Robust Quantum Graph Convolutional Networks [124.7972093110732]
  We propose quantum graph convolutional networks (QuanGCN), which learns the local message passing among nodes with the sequence of crossing-gate quantum operations. To mitigate the inherent noises from modern quantum devices, we apply sparse constraint to sparsify the nodes' connections. Our QuanGCN is functionally comparable or even superior than the classical algorithms on several benchmark graph datasets.
  arXiv  Detail & Related papers  (2022-11-09T21:43:16Z)
• Quantum circuit architecture search on a superconducting processor [56.04169357427682]
  Variational quantum algorithms (VQAs) have shown strong evidences to gain provable computational advantages for diverse fields such as finance, machine learning, and chemistry. However, the ansatz exploited in modern VQAs is incapable of balancing the tradeoff between expressivity and trainability. We demonstrate the first proof-of-principle experiment of applying an efficient automatic ansatz design technique to enhance VQAs on an 8-qubit superconducting quantum processor.
  arXiv  Detail & Related papers  (2022-01-04T01:53:42Z)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06:27Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.