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

Optimal preparation of superconducting gmon qubits

Dalton Jones

Published Jan 1, 2018• 0 citations
OpenAlex

Abstract

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.

Related papers

Optimal control of superconducting gmon qubits using Pontryagin's minimum principle: Preparing a maximally entangled state with singular bang-bang protocols

Seraph L. Bao, Silken Kleer, Ruoyu Wang +1 more

We apply the theory of optimal control to the dynamics of two ``gmon'' qubits, with the goal of preparing a desired entangled ground state from an initial unentangled one. Given an initial state, a target state, and a Hamiltonian with a set of permissible controls, can we reach the target state with coherent quantum evolution, and, in that case, what is the minimum time required? The adiabatic theorem provides a far from optimal solution in the presence of a spectral gap. Optimal control yields the fastest possible way of reaching the target state and helps identify unreachable states. In the context of a simple quantum system, we provide examples of both reachable and unreachable target ground states, and show that the unreachability is due to a symmetry. We find the optimal protocol in the reachable case using three different approaches: (i) a brute-force numerical minimization, (ii) an efficient numerical minimization using the bang-bang ansatz expected from the Pontryagin minimum principle, and (iii) direct solution of the Pontryagin boundary value problem, which yields an analytical understanding of the numerically obtained optimal protocols. Interestingly, our system provides an example of singular control, where the Pontryagin theorem does not guarantee bang-bang protocols. Nevertheless, all three approaches give the same bang-bang protocol.

arXiv:1704.01423•Physical Review A•Jun 27, 2018•41 citations

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

A blueprint for demonstrating quantum supremacy with superconducting qubits

C. Neill, P. Roushan, Kostyantyn Kechedzhi +29 more

A key step toward demonstrating a quantum system that can address difficult problems in physics and chemistry will be performing a computation beyond the capabilities of any classical computer, thus achieving so-called quantum supremacy. In this study, we used nine superconducting qubits to demonstrate a promising path toward quantum supremacy. By individually tuning the qubit parameters, we were able to generate thousands of distinct Hamiltonian evolutions and probe the output probabilities. The measured probabilities obey a universal distribution, consistent with uniformly sampling the full Hilbert space. As the number of qubits increases, the system continues to explore the exponentially growing number of states. Extending these results to a system of 50 qubits has the potential to address scientific questions that are beyond the capabilities of any classical computer.

arXiv:1709.06678•Science•Apr 12, 2018•469 citations

Optimal preparation of the W state for qubits with XY coupling

Dalton W. Jones, Armin Rahmani

Abstract Using simulated annealing, we find optimal protocols that evolve a simple product state into a three-qubit W state with a Hamiltonian that describes XY coupling and single-qubit gates, and determine the associated quantum speed limit. Applying Pontryagin's minimum principle, we fully characterize the optimal “bang-bang” protocols. While leakage affects performance, the protocols remain robust to implementation errors and operate well within relaxation and decoherence times. Our findings highlight Pontryagin's principle as a powerful tool for designing pulse shapes that directly link device interactions to specific quantum gates and target states.

arXiv:1909.09289•Europhysics Letters (EPL)•Apr 7, 2026•3 citations

Application of Pontryagin's minimum principle to Grover's quantum search problem

Chungwei Lin, Yebin Wang, Grigory Kolesov +1 more

Grover's algorithm is one of the most famous algorithms which explicitly demonstrates how the quantum nature can be utilized to accelerate the searching process. In this work, Grover's quantum search problem is mapped to a time-optimal control problem. Resorting to Pontryagin's minimum principle, we find that the time-optimal solution has the bang-singular-bang structure. This structure can be derived naturally, without integrating the differential equations, using the geometric control technique where Hamiltonians in Schr\"odinger's equation are represented as vector fields. In view of optimal control, Grover's algorithm uses the bang-bang protocol to approximate the optimal protocol with a minimized number of bang-to-bang switchings to reduce the query complexity. Our work provides a concrete example of how Pontryagin's minimum principle is connected to quantum computation, and offers insight into how a quantum algorithm can be designed.

arXiv:1908.09886•Physical Review A•Aug 21, 2019•24 citations

Engineering superconducting qubits : towards a quantum machine

Joachim Sjöstrand

A quantum computer is an information processing machine, much like an ordinary classical computer, but its function is based on quantum mechanical principles. To be able to construct such a machine would be a fantastic accomplishment---to have total control over a quantum system is a dream for both physicists and science-fiction enthusiasts. The basic information unit in a quantum computer is the quantum bit, or qubit for short. A quantum computer consists of many coupled qubits. To get a single qubit to work properly, would be a major step towards building this machine. Here we study two different qubit ideas. The central element in both setups is the superconducting tunnel junction---the Josephson junction. By connecting the Josephson junctions to standard electronics in a clever way, a qubit can be realised. With these constructions it is in principle very easy to manipulate and read out the quantum probabilities, by varying voltages and currents in time. However, this ease of manipulation has a cost: strong interactions with uncontrolled degrees of freedom of the environment transfer information from the qubit. For superconducting qubits this decoherence is typically very fast. There are ways to deal with the decoherence. One way is to tune the circuit parameters so that the decoherence becomes minimal. Another way is to engineer the qubits so fast so that the effect of decoherence becomes small. In this thesis, we will apply both these strategies. Specifically, the measurement speed of the second qubit we study, turns out to be very sensitive to the topology of the phase space of the detector variables.

•Jan 1, 2006•1 citation
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.
We apply the theory of optimal control to the dynamics of two ``gmon'' qubits, with the goal of preparing a desired entangled ground state from an initial unentangled one. Given an initial state, a target state, and a Hamiltonian with a set of permissible controls, can we reach the target state with coherent quantum evolution, and, in that case, what is the minimum time required? The adiabatic theorem provides a far from optimal solution in the presence of a spectral gap. Optimal control yields the fastest possible way of reaching the target state and helps identify unreachable states. In the context of a simple quantum system, we provide examples of both reachable and unreachable target ground states, and show that the unreachability is due to a symmetry. We find the optimal protocol in the reachable case using three different approaches: (i) a brute-force numerical minimization, (ii) an efficient numerical minimization using the bang-bang ansatz expected from the Pontryagin minimum principle, and (iii) direct solution of the Pontryagin boundary value problem, which yields an analytical understanding of the numerically obtained optimal protocols. Interestingly, our system provides an example of singular control, where the Pontryagin theorem does not guarantee bang-bang protocols. Nevertheless, all three approaches give the same bang-bang protocol.
A key step toward demonstrating a quantum system that can address difficult problems in physics and chemistry will be performing a computation beyond the capabilities of any classical computer, thus achieving so-called quantum supremacy. In this study, we used nine superconducting qubits to demonstrate a promising path toward quantum supremacy. By individually tuning the qubit parameters, we were able to generate thousands of distinct Hamiltonian evolutions and probe the output probabilities. The measured probabilities obey a universal distribution, consistent with uniformly sampling the full Hilbert space. As the number of qubits increases, the system continues to explore the exponentially growing number of states. Extending these results to a system of 50 qubits has the potential to address scientific questions that are beyond the capabilities of any classical computer.
Abstract Using simulated annealing, we find optimal protocols that evolve a simple product state into a three-qubit W state with a Hamiltonian that describes XY coupling and single-qubit gates, and determine the associated quantum speed limit. Applying Pontryagin's minimum principle, we fully characterize the optimal “bang-bang” protocols. While leakage affects performance, the protocols remain robust to implementation errors and operate well within relaxation and decoherence times. Our findings highlight Pontryagin's principle as a powerful tool for designing pulse shapes that directly link device interactions to specific quantum gates and target states.
Grover's algorithm is one of the most famous algorithms which explicitly demonstrates how the quantum nature can be utilized to accelerate the searching process. In this work, Grover's quantum search problem is mapped to a time-optimal control problem. Resorting to Pontryagin's minimum principle, we find that the time-optimal solution has the bang-singular-bang structure. This structure can be derived naturally, without integrating the differential equations, using the geometric control technique where Hamiltonians in Schr\"odinger's equation are represented as vector fields. In view of optimal control, Grover's algorithm uses the bang-bang protocol to approximate the optimal protocol with a minimized number of bang-to-bang switchings to reduce the query complexity. Our work provides a concrete example of how Pontryagin's minimum principle is connected to quantum computation, and offers insight into how a quantum algorithm can be designed.
A quantum computer is an information processing machine, much like an ordinary classical computer, but its function is based on quantum mechanical principles. To be able to construct such a machine would be a fantastic accomplishment---to have total control over a quantum system is a dream for both physicists and science-fiction enthusiasts. The basic information unit in a quantum computer is the quantum bit, or qubit for short. A quantum computer consists of many coupled qubits. To get a single qubit to work properly, would be a major step towards building this machine. Here we study two different qubit ideas. The central element in both setups is the superconducting tunnel junction---the Josephson junction. By connecting the Josephson junctions to standard electronics in a clever way, a qubit can be realised. With these constructions it is in principle very easy to manipulate and read out the quantum probabilities, by varying voltages and currents in time. However, this ease of manipulation has a cost: strong interactions with uncontrolled degrees of freedom of the environment transfer information from the qubit. For superconducting qubits this decoherence is typically very fast. There are ways to deal with the decoherence. One way is to tune the circuit parameters so that the decoherence becomes minimal. Another way is to engineer the qubits so fast so that the effect of decoherence becomes small. In this thesis, we will apply both these strategies. Specifically, the measurement speed of the second qubit we study, turns out to be very sensitive to the topology of the phase space of the detector variables.