Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Springer eBooks

Experiments Leading Towards Quantum Computation

Hanns‐Christoph Nägerl, Dietrich G. Leibfried, Ferdinand Schmidt‐Kaler, Jürgen Eschner, R. Blatt, M. Brune, J. M. Raimond, S. Haroche, W. Lange, H. Baldauf, HERBERT WALTHER, Jonathan A. Jones

Published Jan 1, 2000• 0 citations
Publisher
DOI
10.1007/978-3-662-04209-0_5

Related papers

Experimental Aspects of Quantum Computing

Henry O. Everitt

Springer eBooks•Jan 1, 2005•38 citations

Gaussian boson sampling: Benchmarking quantum advantage

Ned Goodman, Alexander S. Dellios, Margaret D. Reid +1 more

Quantum computers solve intractable problems which classically require an exponentially long time to compute. With the development of large-scale experiments that claim quantum advantage, a vital issue has now emerged. What are the errors, and how do they affect the complexity of the problem solved? Large-scale Gaussian boson sampling (GBS) experiments give an example in which random numbers are generated. Despite classical hardness, these have computable benchmarks for checking data validity. While there are other quantum computing architectures, Gaussian boson sampling is uniquely testable at all scales. Several large, pioneering quantum computing (QC) experiments have been carried out to investigate quantum advantage. Here, we introduce a highly scalable but classical algorithm that can solve GBS approximately. Our numerical simulation of the output count data is closer to the exact solution than current experiments up to 1152 modes. This algorithm outperforms all previous classical, approximate algorithms and scales efficiently to larger experiments. Our results show that effects beyond losses can cause the errors that allow classical simulability. This work will lead to more precise algorithms and is a step towards understanding how QC quantum advantage is affected by the underlying physics.

quant-pharXiv:2604.12330•Apr 15, 2026•0 citations

Quantum Computing for High-School Students An Experience Report

Prashanti Priya Angara, Ulrike Stege, Andrew MacLean

Quantum computing is an emerging field that can revolutionize our ability to solve problems and enable breakthroughs in many areas including optimization, machine learning, chemistry, and drug design. With the increasing computational power of quantum computers and the proliferation of quantum development kits, the demand for a skilled workforce in quantum computing increases significantly. The theory of quantum computing lies at the crossroads of quantum physics, mathematics, and computer science. The field of quantum computing has matured and can now be explored by all students. While today, quantum computers and simulators are readily accessible and programmable over the internet, quantum computing education is just ramping up. This paper describes our experiences in organizing and delivering quantum computing workshops for high-school students with little or no experience in the abovementioned fields. We introduce students to the world of quantum computing in innovative ways, such as newly designed “unplugged” activities for teaching basic quantum computing concepts. Overall, we take a programmatic approach and introduce students to the IBM Q Experience using Qiskit and Jupyter notebooks. Our experiences and findings suggest that basic quantum computing concepts are palatable for high-school students, and-due to significant differences between classical and quantum computing-early exposure to quantum computing is a valuable addition to the set of problem-solving and computing skills that high-schoolers obtain before entering university.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Oct 1, 2020•35 citations

Experimental aspects of quantum computing

Dipankar Bhattacharyya, Jyotirmoy Guha

Institute of Physics eBooks•Jan 1, 2022•1 citation

Advances in Quantum Computation

Kazem Mahdavi, Deborah Koslover

Contemporary mathematics - American Mathematical Society•Jan 1, 2009•8 citations

Quantum Software Experiments: A Reporting and Laboratory Package Structure Guidelines Proposal

Enrique Moguel, José Antonio Parejo, Antonio Ruiz–Cortés +2 more

Replicability and verifiability of empirical results are the cornerstones of scientific endeavor. In the specific area of software engineering, there are widely accepted guidelines for reporting and creating laboratory packages. However, in the realm of quantum computing, the landscape is remarkably different. Current practices in quantum computing involve complex and disparate computing architectures, and, to the best of our knowledge, there exists a notable absence of tailored guidelines for reporting and assembling laboratory packages specific to quantum computing experiments. This gap presents significant challenges to achieving replicability and verifiability in quantum computing research. Addressing this need, our paper introduces a comprehensive framework for reporting software experiments in the quantum computing domain. It adapts Jedlitschka's widely recognized reporting guidelines to the unique requirements of quantum computing. Furthermore, we propose an innovative structure for laboratory packages, synthesizing the methodologies of Guevara et al., and Solari et al., with additional elements tailored to the specificities of quantum computing experiments. This dual approach aims to enhance the replicability and verifiability of experiments in this cutting-edge field, fostering the rigorous and reliable scientific inquiry of quantum software engineering.

IEEE International Conference on Quantum Software (QSW)•Jul 7, 2025•0 citations
Quantum computers solve intractable problems which classically require an exponentially long time to compute. With the development of large-scale experiments that claim quantum advantage, a vital issue has now emerged. What are the errors, and how do they affect the complexity of the problem solved? Large-scale Gaussian boson sampling (GBS) experiments give an example in which random numbers are generated. Despite classical hardness, these have computable benchmarks for checking data validity. While there are other quantum computing architectures, Gaussian boson sampling is uniquely testable at all scales. Several large, pioneering quantum computing (QC) experiments have been carried out to investigate quantum advantage. Here, we introduce a highly scalable but classical algorithm that can solve GBS approximately. Our numerical simulation of the output count data is closer to the exact solution than current experiments up to 1152 modes. This algorithm outperforms all previous classical, approximate algorithms and scales efficiently to larger experiments. Our results show that effects beyond losses can cause the errors that allow classical simulability. This work will lead to more precise algorithms and is a step towards understanding how QC quantum advantage is affected by the underlying physics.
Quantum computing is an emerging field that can revolutionize our ability to solve problems and enable breakthroughs in many areas including optimization, machine learning, chemistry, and drug design. With the increasing computational power of quantum computers and the proliferation of quantum development kits, the demand for a skilled workforce in quantum computing increases significantly. The theory of quantum computing lies at the crossroads of quantum physics, mathematics, and computer science. The field of quantum computing has matured and can now be explored by all students. While today, quantum computers and simulators are readily accessible and programmable over the internet, quantum computing education is just ramping up. This paper describes our experiences in organizing and delivering quantum computing workshops for high-school students with little or no experience in the abovementioned fields. We introduce students to the world of quantum computing in innovative ways, such as newly designed “unplugged” activities for teaching basic quantum computing concepts. Overall, we take a programmatic approach and introduce students to the IBM Q Experience using Qiskit and Jupyter notebooks. Our experiences and findings suggest that basic quantum computing concepts are palatable for high-school students, and-due to significant differences between classical and quantum computing-early exposure to quantum computing is a valuable addition to the set of problem-solving and computing skills that high-schoolers obtain before entering university.
Replicability and verifiability of empirical results are the cornerstones of scientific endeavor. In the specific area of software engineering, there are widely accepted guidelines for reporting and creating laboratory packages. However, in the realm of quantum computing, the landscape is remarkably different. Current practices in quantum computing involve complex and disparate computing architectures, and, to the best of our knowledge, there exists a notable absence of tailored guidelines for reporting and assembling laboratory packages specific to quantum computing experiments. This gap presents significant challenges to achieving replicability and verifiability in quantum computing research. Addressing this need, our paper introduces a comprehensive framework for reporting software experiments in the quantum computing domain. It adapts Jedlitschka's widely recognized reporting guidelines to the unique requirements of quantum computing. Furthermore, we propose an innovative structure for laboratory packages, synthesizing the methodologies of Guevara et al., and Solari et al., with additional elements tailored to the specificities of quantum computing experiments. This dual approach aims to enhance the replicability and verifiability of experiments in this cutting-edge field, fostering the rigorous and reliable scientific inquiry of quantum software engineering.