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

Bulletin of the American Physical Society

Designing, programming, and optimizing a (small) quantum computer

Krysta M. Svore

Published Mar 13, 2017• 0 citations
OpenAlex

Related papers

Building a Quantum Computer

Jack D. Hidary

Springer eBooks•Jan 1, 2019•3 citations

A Verified Optimizer for Quantum Circuits

Kesha Hietala, Robert Rand, Liyi Li +3 more

We present voqc , the first verified optimizer for quantum circuits, written using the Coq proof assistant. Quantum circuits are expressed as programs in a simple, low-level language called sqir , a small quantum intermediate representation, which is deeply embedded in Coq. Optimizations and other transformations are expressed as Coq functions, which are proved correct with respect to a semantics of sqir programs. sqir programs denote complex-valued matrices, as is standard in quantum computation, but we treat matrices symbolically to reason about programs that use an arbitrary number of quantum bits. sqir ’s careful design and our provided automation make it possible to write and verify a broad range of optimizations in voqc , including full-circuit transformations from cutting-edge optimizers.

ACM Transactions on Programming Languages and Systems•Jul 12, 2023•19 citations

Building a Quantum Computer

Jack D. Hidary

Springer eBooks•Jan 1, 2021•1 citation

Quantum supremacy in end-to-end intelligent IT. PT. III. Quantum software engineering – quantum approximate optimization algorithm on small quantum processors

Иванцова О. В., V. Korenkov, Olga Tyatyushkina +2 more

Principles and methodologies of quantum algorithmic gate-based design on small quantum computer described. The possibilities of quantum algorithmic gates simulation on classical computers discussed. A new approach to a circuit implementation design of quantum algorithm gates for fast quantum massive parallel computing presented. SW & HW support sophisticated smart toolkit of supercomputing accelerator of quantum algorithm simulation on small quantum programmable computer algorithm gate (that can program in SW to implement arbitrary quantum algorithms by executing any sequence of universal quantum logic gates) described

System Analysis in Science and Education•Jun 30, 2020•1 citation

Programming Your Quantum Computer

Brian Hayes

American Scientist•Dec 17, 2013•11 citations

The Quantum Geometry® Grand Challenge: A Multiyear Prize and Benchmark Program for Quantum Computing in Geometry, CAD, GIS, and Meshing

W Randolph Franklin

This paper proposes the Quantum Geometry® Grand Challenge, a five-year prize and benchmark program for quantum and hybrid quantum–classical methods in computational geometry, computer-aided design (CAD), geographic information science (GIS), and meshing. The central question is where, if anywhere, quantum computation improves a complete geometric workflow. Comparisons would include data preparation, encoding, execution, and output validation. The program would begin by defining benchmarks, without requiring an initial demonstration of quantum advantage. A proposed 2027 pilot would select a small number of spatial-optimization and mesh-partitioning problems and publish classical reference solvers and independent validators. Separate award categories would recognize reproducible positive and negative findings. Two illustrative problems show how the evaluation would work. The paper sets out submission requirements, comparison metrics, judging safeguards, and a staged expansion to CAD, geometric algorithms, and data representations. Quantum Geometry® LLC would initially administer the program and offer conditional founding matching support of up to $100,000 over five years. Expansion would depend on secured resources and independently reproducible pilot results. The contribution is a research-program design that can be tested and evaluation resources that others can reuse; it is not a claim of demonstrated quantum advantage.

•Oct 31, 2026•0 citations
We present voqc , the first verified optimizer for quantum circuits, written using the Coq proof assistant. Quantum circuits are expressed as programs in a simple, low-level language called sqir , a small quantum intermediate representation, which is deeply embedded in Coq. Optimizations and other transformations are expressed as Coq functions, which are proved correct with respect to a semantics of sqir programs. sqir programs denote complex-valued matrices, as is standard in quantum computation, but we treat matrices symbolically to reason about programs that use an arbitrary number of quantum bits. sqir ’s careful design and our provided automation make it possible to write and verify a broad range of optimizations in voqc , including full-circuit transformations from cutting-edge optimizers.
Principles and methodologies of quantum algorithmic gate-based design on small quantum computer described. The possibilities of quantum algorithmic gates simulation on classical computers discussed. A new approach to a circuit implementation design of quantum algorithm gates for fast quantum massive parallel computing presented. SW & HW support sophisticated smart toolkit of supercomputing accelerator of quantum algorithm simulation on small quantum programmable computer algorithm gate (that can program in SW to implement arbitrary quantum algorithms by executing any sequence of universal quantum logic gates) described
This paper proposes the Quantum Geometry® Grand Challenge, a five-year prize and benchmark program for quantum and hybrid quantum–classical methods in computational geometry, computer-aided design (CAD), geographic information science (GIS), and meshing. The central question is where, if anywhere, quantum computation improves a complete geometric workflow. Comparisons would include data preparation, encoding, execution, and output validation. The program would begin by defining benchmarks, without requiring an initial demonstration of quantum advantage. A proposed 2027 pilot would select a small number of spatial-optimization and mesh-partitioning problems and publish classical reference solvers and independent validators. Separate award categories would recognize reproducible positive and negative findings. Two illustrative problems show how the evaluation would work. The paper sets out submission requirements, comparison metrics, judging safeguards, and a staged expansion to CAD, geometric algorithms, and data representations. Quantum Geometry® LLC would initially administer the program and offer conditional founding matching support of up to $100,000 over five years. Expansion would depend on secured resources and independently reproducible pilot results. The contribution is a research-program design that can be tested and evaluation resources that others can reuse; it is not a claim of demonstrated quantum advantage.