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

High fidelity fermionic simulation gates with superconducting gmon qubits

Brooks Foxen, B. Chiaro, Matthew McEwen, John M. Martinis

Published Mar 4, 2019• 0 citations
OpenAlex

Related papers

Characterization and performance of gmon superconducting qubits for quantum simulation

B. Chiaro, A. Dunsworth, Charles Neill +4 more

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

Optimal preparation of superconducting gmon qubits

Dalton Jones

Great strides have recently been made in developing stable and coherent quantum systems. One such system is the superconducting gmon qubit architecture developed by Martinis et. al [1]. Martinis et. al presents a simple coherent system with highly tuneable qubit-qubit couplings, making it a great candidate for use in quantum computing. Of specific interest to the field of quantum computing is the controlled evolution of these qubit systems to process information. To achieve this type of evolution we worked within the gmon qubit architecture and found optimal solutions for evolving a three qubit system from an easily achieved product state to a more difficult to achieve maximally entangled state. These solutions were found using a simulated annealing algorithm that minimized the error between the maximally entangled state and the final state of the system with respect to the protocols of the coupling parameters that compose the Hamiltonian of the system. These protocols, confirmed using Pontryagin's minimum principle, turned out to be simple bang-bang protocols that greatly shortcut adiabatic evolution and offer a structure that can be used to help employ quantum gates or regulate the energy of a quantum computer.

•Jan 1, 2018•0 citations

Demonstrating a Continuous Set of Two-qubit Gates for Near-term Quantum Algorithms

Brooks Foxen, Charles Neill, A. Dunsworth +55 more

Quantum algorithms offer a dramatic speedup for computational problems in material science and chemistry. However, any near-term realizations of these algorithms will need to be optimized to fit within the finite resources offered by existing noisy hardware. Here, taking advantage of the adjustable coupling of gmon qubits, we demonstrate a continuous two-qubit gate set that can provide a threefold reduction in circuit depth as compared to a standard decomposition. We implement two gate families: an imaginary swap-like (iSWAP-like) gate to attain an arbitrary swap angle, θ, and a controlled-phase gate that generates an arbitrary conditional phase, ϕ. Using one of each of these gates, we can perform an arbitrary two-qubit gate within the excitation-preserving subspace allowing for a complete implementation of the so-called Fermionic simulation (fSim) gate set. We benchmark the fidelity of the iSWAP-like and controlled-phase gate families as well as 525 other fSim gates spread evenly across the entire fSim(θ,ϕ) parameter space, achieving a purity-limited average two-qubit Pauli error of 3.8×10^{-3} per fSim gate.

arXiv:2001.08343•Physical Review Letters•Sep 15, 2020•296 citations

Simulation of gate-based quantum computers with superconducting qubits

Dennis Willsch, Madita Nocon, Fengping Jin +2 more

•Jan 1, 2017•0 citations

Quantum gates for superconducting qubits

Chad T. Rigetti

•Jan 1, 2009•10 citations

High-fidelity gates in Josephson phase qubits

Erik A. Lucero, M. Ansmann, Radoslaw C. Bialczak +7 more

Bulletin of the American Physical Society•Mar 11, 2008•0 citations
Great strides have recently been made in developing stable and coherent quantum systems. One such system is the superconducting gmon qubit architecture developed by Martinis et. al [1]. Martinis et. al presents a simple coherent system with highly tuneable qubit-qubit couplings, making it a great candidate for use in quantum computing. Of specific interest to the field of quantum computing is the controlled evolution of these qubit systems to process information. To achieve this type of evolution we worked within the gmon qubit architecture and found optimal solutions for evolving a three qubit system from an easily achieved product state to a more difficult to achieve maximally entangled state. These solutions were found using a simulated annealing algorithm that minimized the error between the maximally entangled state and the final state of the system with respect to the protocols of the coupling parameters that compose the Hamiltonian of the system. These protocols, confirmed using Pontryagin's minimum principle, turned out to be simple bang-bang protocols that greatly shortcut adiabatic evolution and offer a structure that can be used to help employ quantum gates or regulate the energy of a quantum computer.
Quantum algorithms offer a dramatic speedup for computational problems in material science and chemistry. However, any near-term realizations of these algorithms will need to be optimized to fit within the finite resources offered by existing noisy hardware. Here, taking advantage of the adjustable coupling of gmon qubits, we demonstrate a continuous two-qubit gate set that can provide a threefold reduction in circuit depth as compared to a standard decomposition. We implement two gate families: an imaginary swap-like (iSWAP-like) gate to attain an arbitrary swap angle, θ, and a controlled-phase gate that generates an arbitrary conditional phase, ϕ. Using one of each of these gates, we can perform an arbitrary two-qubit gate within the excitation-preserving subspace allowing for a complete implementation of the so-called Fermionic simulation (fSim) gate set. We benchmark the fidelity of the iSWAP-like and controlled-phase gate families as well as 525 other fSim gates spread evenly across the entire fSim(θ,ϕ) parameter space, achieving a purity-limited average two-qubit Pauli error of 3.8×10^{-3} per fSim gate.