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

APS

General-Purpose Quantum Simulation with Prethreshold Superconducting Qubits

Emily Pritchett, Colin Benjamin, Andrei Galiautdinov, Michael R. Geller, Andrew T. Sornborger, Phillip C. Stancil, John M. Martinis

Published Mar 1, 2011• 0 citations
OpenAlex

Related papers

Towards Quantum Simulation of Chemical Dynamics with Prethreshold Superconducting Qubits

A.W. Cook, Phillip C. Stancil, Michael R. Geller +2 more

Bulletin of the American Physical Society•Mar 15, 2016•0 citations

Adiabatic quantum simulations with superconducting qubits

Nikolaj Moll, Panagiotis Kl. Barkoutsos, Daniel J. Egger +8 more

Verhandlungen der Deutschen Physikalischen Gesellschaft•Jan 1, 2017•0 citations

Quantum simulation using superconducting qubits coupled to a 1D transmission line

Daniel Campbell, Philip Krantz, Fei Yan +4 more

Bulletin of the American Physical Society•Mar 14, 2017•0 citations

Engineering and control of coupled superconducting qubits arrays for quantum simulation

Edward Henry, Andrew Schmidt, Oliver Viehmann +1 more

Bulletin of the American Physical Society•Mar 18, 2013•0 citations

Toolbox for Quantum Computing and Digital Quantum Simulation with Superconducting Qubits

Yves Salathé

•Jan 1, 2018•2 citations

Universal quantum simulation with prethreshold superconducting qubits: Single-excitation subspace method

Michael R. Geller, John M. Martinis, Andrew T. Sornborger +4 more

Current quantum computing architectures lack the size and fidelity required for universal fault-tolerant operation, limiting the practical implementation of key quantum algorithms to all but the smallest problem sizes. In this work we propose an alternative method for general-purpose quantum computation that is ideally suited for such ``prethreshold'' superconducting hardware. Computations are performed in the $n$-dimensional single-excitation subspace (SES) of a system of $n$ tunably coupled superconducting qubits. The approach is not scalable, but allows many operations in the unitary group SU($n$) to be implemented by a single application of the Hamiltonian, bypassing the need to decompose a desired unitary into elementary gates. This feature makes large, nontrivial quantum computations possible within the available coherence time. We show how to use a programmable SES chip to perform fast amplitude amplification and phase estimation, two versatile quantum subalgorithms. We also show that an SES processor is well suited for Hamiltonian simulation, specifically simulation of the Schr\"odinger equation with a real but otherwise arbitrary $n\ifmmode\times\else\texttimes\fi{}n$ Hamiltonian matrix. We discuss the utility and practicality of such a universal quantum simulator, and propose its application to the study of realistic atomic and molecular collisions.

arXiv:1210.5260•Physical Review A•Jun 8, 2015•31 citations
Current quantum computing architectures lack the size and fidelity required for universal fault-tolerant operation, limiting the practical implementation of key quantum algorithms to all but the smallest problem sizes. In this work we propose an alternative method for general-purpose quantum computation that is ideally suited for such ``prethreshold'' superconducting hardware. Computations are performed in the nnn-dimensional single-excitation subspace (SES) of a system of nnn tunably coupled superconducting qubits. The approach is not scalable, but allows many operations in the unitary group SU(nnn) to be implemented by a single application of the Hamiltonian, bypassing the need to decompose a desired unitary into elementary gates. This feature makes large, nontrivial quantum computations possible within the available coherence time. We show how to use a programmable SES chip to perform fast amplitude amplification and phase estimation, two versatile quantum subalgorithms. We also show that an SES processor is well suited for Hamiltonian simulation, specifically simulation of the Schr\"odinger equation with a real but otherwise arbitrary $n\ifmmode\times\else\texttimes\fi{}n$ Hamiltonian matrix. We discuss the utility and practicality of such a universal quantum simulator, and propose its application to the study of realistic atomic and molecular collisions.