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

Universal Formalism and Software for Obtaining and Analyzing Hamiltonians of an Arbitrary Superconducting Circuits and Qubits.

Andrey R. Klots, L. B. Ioffe, R. McDermott

Published Mar 6, 2020• 0 citations
OpenAlex

Related papers

Quantum simulation of arbitrary Hamiltonians with superconducting circuits

Colin Benjamin, Emily Pritchett, Michael R. Geller +4 more

Bulletin of the American Physical Society•May 29, 2010•0 citations

Free-mode removal and mode decoupling for simulating general superconducting quantum circuits

Dawei Ding, Hsiang‐Sheng Ku, Yaoyun Shi +1 more

Superconducting quantum circuits is one of the leading candidates for a universal quantum computer. Designing novel qubit and multiqubit superconducting circuits requires the ability to simulate and analyze the properties of a general circuit. In particular, going outside the transmon approach, we cannot make assumptions on anharmonicity, thus precluding blackbox quantization approaches and necessitating the formal circuit quantization approach. We consider and solve two issues involved in simulating general superconducting circuits. One of the issues is the handling of free modes in the circuit, that is, circuit modes with no potential term in the Hamiltonian. Another issue is circuit size, namely, the challenge of simulating strongly coupled multimode circuits. The main mathematical tool we use to address these issues is the linear canonical transformation in the setting of quantum mechanics. We address the first issue by giving a provably correct algorithm for removing free modes by performing a linear canonical transformation to completely decouple the free modes from other circuit modes. We address the second by giving a series of different linear canonical transformations to reduce intermode couplings, thereby reducing the problem to the weakly coupled case and greatly mitigating the overhead for classical simulation. We benchmark our decoupling methods by applying them to the circuit of two inductively coupled fluxonium qubits, obtaining several orders of magnitude reduction in the size of the Hilbert space that needs to be simulated.

arXiv:2011.10564•Physical review. B./Physical review. B•May 3, 2021•10 citations

Superconducting Qubits: Circuit Theory, Hamiltonian Analysis and Design Tools

Zlatko Minev

Bulletin of the American Physical Society•Mar 19, 2021•1 citation

Hamiltonian quantum computing with superconducting qubits

Alessandro Ciani, Barbara M. Terhal, David Peter Divincenzo

Abstract We consider how the Hamiltonian Quantum Computing scheme introduced in (2016 New J. Phys. 18 023042) can be implemented using a 2D array of superconducting transmon qubits. We show how the scheme requires the engineering of strong attractive cross-Kerr and weak flip-flop or hopping interactions and we detail how this can be achieved. Our proposal uses a new electric circuit for obtaining the attractive cross-Kerr coupling between transmons via a dipole-like element. We discuss and numerically analyze the forward motion and execution of the computation and its dependence on coupling strengths and their variability. We extend (2016 New J. Phys. 18 023042) by explicitly showing how to construct a direct Toffoli gate, thus establishing computational universality via the Hadamard and Toffoli gate or via controlled-Hadamard, Hadamard and CNOT.

arXiv:1812.00454•Quantum Science and Technology•Apr 12, 2019•12 citations

Effective Hamiltonian in superconducting qubits

Mohammad H. Ansari

Bulletin of the American Physical Society•Mar 8, 2018•0 citations

Aalto University KQCircuits: Aalto University software package and open-source-license file for KQCircuits, a design software for superconducting qubits and other circuits.

Johannes Heinsoo

•May 15, 2021•0 citations
Superconducting quantum circuits is one of the leading candidates for a universal quantum computer. Designing novel qubit and multiqubit superconducting circuits requires the ability to simulate and analyze the properties of a general circuit. In particular, going outside the transmon approach, we cannot make assumptions on anharmonicity, thus precluding blackbox quantization approaches and necessitating the formal circuit quantization approach. We consider and solve two issues involved in simulating general superconducting circuits. One of the issues is the handling of free modes in the circuit, that is, circuit modes with no potential term in the Hamiltonian. Another issue is circuit size, namely, the challenge of simulating strongly coupled multimode circuits. The main mathematical tool we use to address these issues is the linear canonical transformation in the setting of quantum mechanics. We address the first issue by giving a provably correct algorithm for removing free modes by performing a linear canonical transformation to completely decouple the free modes from other circuit modes. We address the second by giving a series of different linear canonical transformations to reduce intermode couplings, thereby reducing the problem to the weakly coupled case and greatly mitigating the overhead for classical simulation. We benchmark our decoupling methods by applying them to the circuit of two inductively coupled fluxonium qubits, obtaining several orders of magnitude reduction in the size of the Hilbert space that needs to be simulated.
Abstract We consider how the Hamiltonian Quantum Computing scheme introduced in (2016 New J. Phys. 18 023042) can be implemented using a 2D array of superconducting transmon qubits. We show how the scheme requires the engineering of strong attractive cross-Kerr and weak flip-flop or hopping interactions and we detail how this can be achieved. Our proposal uses a new electric circuit for obtaining the attractive cross-Kerr coupling between transmons via a dipole-like element. We discuss and numerically analyze the forward motion and execution of the computation and its dependence on coupling strengths and their variability. We extend (2016 New J. Phys. 18 023042) by explicitly showing how to construct a direct Toffoli gate, thus establishing computational universality via the Hadamard and Toffoli gate or via controlled-Hadamard, Hadamard and CNOT.