Design and synthesis of scalable quantum programs
read the original abstract
We present a scalable, robust approach to creating quantum programs of arbitrary size and complexity. The approach is based on the true abstraction of the problem. The quantum program is expressed in terms of a high-level model together with constraints and objectives on the final program. Advanced synthesis algorithms transform the model into a low-level quantum program that meets the user's specification and is directed at a stipulated hardware. This separation of description from implementation is essential for scale. The technology adapts electronic design automation methods to quantum computing, finding feasible implementations in a virtually unlimited functional space. The results show clear superiority over the compilation and transpilation methods used today. We expect that this technological approach will take over and prevail as quantum software become more demanding, complex, and essential.
This paper has not been read by Pith yet.
Forward citations
Cited by 3 Pith papers
-
Low-cost quantum error mitigation via auxiliary qubit return validation
Post-selection on auxiliary qubit return-to-zero measurements, informed by backward light cones, reduces false-negative rate by ~10% while discarding ~1% of valid shots in simulations.
-
Optimal Approximation of Single Qubit Rotations within a Quantum Circuit
Mapping approximation strategy allocation in quantum circuits to a 1D Ising model enables a linear-time optimal algorithm that reduces gate count by 26% on average.
-
Coined Quantum Walks on Complex Networks for Quantum Computers
Dual-register encoding enables coined quantum walks on degree-varying complex networks with circuit depth scaling as N^1.9, shown via simulations on standard models and small IBM hardware executions.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.