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

A Quantum Instruction Set Implemented on a Superconducting Quantum Processor

Morten Kjærgaard, Mollie E. Schwartz, Alex Greene, Gabriel Samach, Anders Bengtsson, Michael F. O’Keeffe, Christopher M. McNally, Jochen Braumüller, David K. Kim, Philip Krantz, Milad Marvian, Alexander J. Melville, Bethany M. Niedzielski, Yun‐Mo Sung, Roni Winik, Jonilyn Yoder, Danna Rosenberg, Kevin Obenland, Seth Lloyd, Terry P. Orlando, Iman Marvian, Simon Gustavsson, William D. Oliver

Published Jan 23, 2020• 10 citations
OpenAlex

Abstract

A quantum algorithm consists of a sequence of operations and measurements applied to a quantum processor. To date, the instruction set which defines this sequence has been provided by a classical computer and passed via control hardware to the quantum processor. Here, we demonstrate the first experimental realization of a quantum instruction set, in which a fixed sequence of classically-defined gates perform an operation that is fully determined only by a quantum input to the fixed sequence. Specifically, we implement the density matrix exponentiation algorithm, which consumes $N$ copies of the instruction state $\rho$ to approximate the operation $e^{-i \rho \theta}$ ($\theta$ an arbitrary angle). Our implementation relies on a 99.7% fidelity controlled-phase gate between two superconducting transmon qubits. We achieve an average algorithmic fidelity $\approx 0.9$, independent of the setting of $\rho$, to circuit depth nearly 90. This new paradigm for quantum instructions has applications to resource-efficient protocols for validating entanglement spectra, principal component analysis of large quantum states, and universal quantum emulation.

Related papers

Programming a quantum computer with quantum instructions

Morten Kjærgaard, Mollie E. Schwartz, Alex Greene +20 more

The equivalence between the instructions used to define programs and the input data on which the instructions operate is a basic principle of classical computer architectures and programming. Replacing classical data with quantum states enables fundamentally new computational capabilities with scaling advantages for many applications, and numerous models have been proposed for realizing quantum computation. However, within each of these models, the quantum data are transformed by a set of gates that are compiled using solely classical information. Conventional quantum computing models thus break the instruction-data symmetry: classical instructions and quantum data are not directly interchangeable. In this work, we use a density matrix exponentiation protocol to execute quantum instructions on quantum data. In this approach, a fixed sequence of classically-defined gates performs an operation that uniquely depends on an auxiliary quantum instruction state. Our demonstration relies on a 99.7% fidelity controlled-phase gate implemented using two tunable superconducting transmon qubits, which enables an algorithmic fidelity surpassing 90% at circuit depths exceeding 70. The utilization of quantum instructions obviates the need for costly tomographic state reconstruction and recompilation, thereby enabling exponential speedup for a broad range of algorithms, including quantum principal component analysis, the measurement of entanglement spectra, and universal quantum emulation.

arXiv:2001.08838•Jan 23, 2020•49 citations

Demonstration of Two-Qubit Quantum Algorithms with a Solid-State Electronic Processor

L. DiCarlo, Jerry M. Chow, Jay Gambetta +6 more

We present the experimental implementation of two-qubit quantum algorithms in a superconducting circuit. Our processor incorporates local and fast flux biasing of two transmon qubits within a circuit QED architecture. An off-resonant cavity bus shields the qubits from the external environment and couples them to each other via virtual photon exchange. Meanwhile, integrated short-circuited coplanar waveguides proximal to each qubit allow nanosecond control of their frequencies. We demonstrate flux-controlled single-qubit z rotations and a qubit-qubit conditional phase (c-phase) interaction with a coupling strength tunable by two orders of magnitude. These operations are combined with frequency-multiplexed x and y rotations to form a set of gates universal for quantum computation. Dispersive frequency shifts of the cavity bus allow tomography of the two-qubit state, and accurate determination of state purity, fidelity and entanglement. The processor is first programmed to generate and detect entanglement on demand using sequences of five single-qubit operations and one c-phase. The four Bell states are generated with fidelities better than 90%, corresponding to a concurrence of 0.85 or an entanglement of formation of 0.8. Next, the Grover search algorithm is implemented by concatenating eight single-qubit and two c-phases operations. The fidelity of the algorithm output states to the theoretical ideal is ~ 80%, consistent with the observed T1 times ~ 1 us and the total duration ~ 130 ns of the algorithm sequence. We also program and execute the Deutsch-Jozsa algorithm, finding similar performance. Prospects for scaling the processor beyond two qubits will be discussed. Research supported by NSF, NSA and ARO.

Conference on Lasers and Electro-Optics•Jan 1, 2009•1 citation

Efficient nnn-qubit entangling operations via a superconducting quantum router

Xuntao Wu, Haoxiong Yan, Gustav Andersson +13 more

Quantum algorithms on near-term quantum processors are typically executed using shallow quantum circuits composed of one- and two-qubit gates. However, as circuit depth and gate number increase, gate imperfections and qubit decoherence begin to dominate, limiting algorithmic complexity. An alternative approach is to explore gates involving more than two qubits. In previous work (X. Wu et al., Physical Review X 14, 041030 (2024)), we demonstrated a new superconducting qubit architecture with user-selectable two-qubit interactions via a reconfigurable router, used to connect pairs of qubits. Here, we leverage this novel architecture to realize programmable and efficient multi-qubit operations involving more than two qubits, resulting in faster preparation of multi-qubit entangled states with good fidelities. We also successfully apply model-free reinforcement learning to perform multi-qubit gates, including training a two-qubit controlled-Z gate as well as three-qubit controlled-SWAP and controlled-controlled-phase (Fredkin and Toffoli) gates. Higher $n$th-order gates may also be feasible, using our high-connectivity router design. This could provide a more efficient and higher-fidelity implementation of complex quantum algorithms and a more practical approach to quantum computation.

quant-pharXiv:2604.15432•Apr 20, 2026•1 citation

An experimental microarchitecture for a superconducting quantum processor

Xiang Fu, Michiel Adriaan Rol, Cornelis Christiaan Bultink +10 more

Quantum computers promise to solve certain problems that are intractable for classical computers, such as factoring large numbers and simulating quantum systems. To date, research in quantum computer engineering has focused primarily at opposite ends of the required system stack: devising high-level programming languages and compilers to describe and optimize quantum algorithms, and building reliable low-level quantum hardware. Relatively little attention has been given to using the compiler output to fully control the operations on experimental quantum processors. Bridging this gap, we propose and build a prototype of a flexible control microarchitecture supporting quantum-classical mixed code for a superconducting quantum processor. The microarchitecture is based on three core elements: (i) a codeword-based event control scheme, (ii) queue-based precise event timing control, and (iii) a flexible multilevel instruction decoding mechanism for control. We design a set of quantum microinstructions that allows flexible control of quantum operations with precise timing. We demonstrate the microarchitecture and microinstruction set by performing a standard gate-characterization experiment on a transmon qubit.

arXiv:1708.07677•IEEE/ACM International Symposium on Microarchitecture (MICRO)•Oct 14, 2017•106 citations

Implementing quantum computing on superconducting qubits

Paul Yuan Zheng Tan

Quantum computing utilizes quantum mechanics to perform computations with superconducting qubits being the more mature technology as of writing in realizing a quantum computer. In this thesis, we describe an implementation of a Quantum Processor Unit (QPU), which is used to execute instructions in the form of microwave pulses on a superconducting qubit device through the use of signal generators and to perform qubit readout. We further extend the QPU as a platform to perform qubit characterization tasks such as spectroscopy and decoherence measurements in order to determine and optimize the working parameters to perform quantum gate operations. We also demonstrate the use of the QPU in performing qubit experiments such as Gauss Sum Factorization in determining the factors of an integer and the Bell Inequality test in examining the entanglement strength between a pair of qubits. We bridge the divide of quantum computation and qubit hardware in the compilation of quantum circuits into microwave pulse sequences for the QPU to execute. The process of compilation, as well as hardware limitations and pre-compilation optimization procedures are discussed. Finally, we show an example of executing a variational quantum algorithm and break down this example in all layers from the quantum circuit provided by the user to the pulse sequence that will be executed on the QPU.

•Jan 1, 2022•0 citations

Quantum Programmable Reflections

Eddie Schoute, Dmitry Grinko, Yiğit Subaşı +1 more

Similar to a classical processor, which is an algorithm for reading a program and executing its instructions on input data, a universal programmable quantum processor is a fixed quantum channel that reads a quantum program $\lvertψ_{U}\rangle$ that causes the processor to approximately apply an arbitrary unitary $U$ to a quantum data register. The present work focuses on a class of simple programmable quantum processors for implementing reflection operators, i.e. $U = e^{i π\lvertψ\rangle\langleψ\rvert}$ for an arbitrary pure state $\lvertψ\rangle$ of finite dimension $d$. Unlike quantum programs that assume query access to $U$, our program takes the form of independent copies of the state to be reflected about $\lvertψ_U\rangle = \lvertψ\rangle^{\otimes n}$. We then identify the worst-case optimal algorithm among all processors of the form $\text{tr}_{\text{Program}}[V (\lvertϕ\rangle\langleϕ\rvert \otimes (\lvertψ\rangle\langleψ\rvert)^{\otimes n}) V^\dagger]$ where the algorithm $V$ is a unitary linear combination of permutations. By generalizing these algorithms to processors for arbitrary-angle rotations, $e^{i α\lvertψ\rangle\langleψ\rvert}$ for $α\in \mathbb R$, we give a construction for a universal programmable processor with better scaling in $d$. For programming reflections, we obtain a tight analytical lower bound on the program dimension by bounding the Holevo information of an ensemble of reflections applied to an entangled probe state. The lower bound makes use of a block decomposition of the uniform ensemble of reflected states with respect to irreps of the partially transposed permutation matrix algebra, and two representation-theoretic conjectures based on extensive numerical evidence.

arXiv:2411.03648•Nov 6, 2024•7 citations
A quantum algorithm consists of a sequence of operations and measurements applied to a quantum processor. To date, the instruction set which defines this sequence has been provided by a classical computer and passed via control hardware to the quantum processor. Here, we demonstrate the first experimental realization of a quantum instruction set, in which a fixed sequence of classically-defined gates perform an operation that is fully determined only by a quantum input to the fixed sequence. Specifically, we implement the density matrix exponentiation algorithm, which consumes NNN copies of the instruction state ρ\rhoρ to approximate the operation e−iρθe^{-i \rho \theta}e−iρθ (θ\thetaθ an arbitrary angle). Our implementation relies on a 99.7% fidelity controlled-phase gate between two superconducting transmon qubits. We achieve an average algorithmic fidelity ≈0.9\approx 0.9≈0.9, independent of the setting of ρ\rhoρ, to circuit depth nearly 90. This new paradigm for quantum instructions has applications to resource-efficient protocols for validating entanglement spectra, principal component analysis of large quantum states, and universal quantum emulation.
The equivalence between the instructions used to define programs and the input data on which the instructions operate is a basic principle of classical computer architectures and programming. Replacing classical data with quantum states enables fundamentally new computational capabilities with scaling advantages for many applications, and numerous models have been proposed for realizing quantum computation. However, within each of these models, the quantum data are transformed by a set of gates that are compiled using solely classical information. Conventional quantum computing models thus break the instruction-data symmetry: classical instructions and quantum data are not directly interchangeable. In this work, we use a density matrix exponentiation protocol to execute quantum instructions on quantum data. In this approach, a fixed sequence of classically-defined gates performs an operation that uniquely depends on an auxiliary quantum instruction state. Our demonstration relies on a 99.7% fidelity controlled-phase gate implemented using two tunable superconducting transmon qubits, which enables an algorithmic fidelity surpassing 90% at circuit depths exceeding 70. The utilization of quantum instructions obviates the need for costly tomographic state reconstruction and recompilation, thereby enabling exponential speedup for a broad range of algorithms, including quantum principal component analysis, the measurement of entanglement spectra, and universal quantum emulation.
We present the experimental implementation of two-qubit quantum algorithms in a superconducting circuit. Our processor incorporates local and fast flux biasing of two transmon qubits within a circuit QED architecture. An off-resonant cavity bus shields the qubits from the external environment and couples them to each other via virtual photon exchange. Meanwhile, integrated short-circuited coplanar waveguides proximal to each qubit allow nanosecond control of their frequencies. We demonstrate flux-controlled single-qubit z rotations and a qubit-qubit conditional phase (c-phase) interaction with a coupling strength tunable by two orders of magnitude. These operations are combined with frequency-multiplexed x and y rotations to form a set of gates universal for quantum computation. Dispersive frequency shifts of the cavity bus allow tomography of the two-qubit state, and accurate determination of state purity, fidelity and entanglement. The processor is first programmed to generate and detect entanglement on demand using sequences of five single-qubit operations and one c-phase. The four Bell states are generated with fidelities better than 90%, corresponding to a concurrence of 0.85 or an entanglement of formation of 0.8. Next, the Grover search algorithm is implemented by concatenating eight single-qubit and two c-phases operations. The fidelity of the algorithm output states to the theoretical ideal is ~ 80%, consistent with the observed T1 times ~ 1 us and the total duration ~ 130 ns of the algorithm sequence. We also program and execute the Deutsch-Jozsa algorithm, finding similar performance. Prospects for scaling the processor beyond two qubits will be discussed. Research supported by NSF, NSA and ARO.
Quantum algorithms on near-term quantum processors are typically executed using shallow quantum circuits composed of one- and two-qubit gates. However, as circuit depth and gate number increase, gate imperfections and qubit decoherence begin to dominate, limiting algorithmic complexity. An alternative approach is to explore gates involving more than two qubits. In previous work (X. Wu et al., Physical Review X 14, 041030 (2024)), we demonstrated a new superconducting qubit architecture with user-selectable two-qubit interactions via a reconfigurable router, used to connect pairs of qubits. Here, we leverage this novel architecture to realize programmable and efficient multi-qubit operations involving more than two qubits, resulting in faster preparation of multi-qubit entangled states with good fidelities. We also successfully apply model-free reinforcement learning to perform multi-qubit gates, including training a two-qubit controlled-Z gate as well as three-qubit controlled-SWAP and controlled-controlled-phase (Fredkin and Toffoli) gates. Higher nnnth-order gates may also be feasible, using our high-connectivity router design. This could provide a more efficient and higher-fidelity implementation of complex quantum algorithms and a more practical approach to quantum computation.
Quantum computers promise to solve certain problems that are intractable for classical computers, such as factoring large numbers and simulating quantum systems. To date, research in quantum computer engineering has focused primarily at opposite ends of the required system stack: devising high-level programming languages and compilers to describe and optimize quantum algorithms, and building reliable low-level quantum hardware. Relatively little attention has been given to using the compiler output to fully control the operations on experimental quantum processors. Bridging this gap, we propose and build a prototype of a flexible control microarchitecture supporting quantum-classical mixed code for a superconducting quantum processor. The microarchitecture is based on three core elements: (i) a codeword-based event control scheme, (ii) queue-based precise event timing control, and (iii) a flexible multilevel instruction decoding mechanism for control. We design a set of quantum microinstructions that allows flexible control of quantum operations with precise timing. We demonstrate the microarchitecture and microinstruction set by performing a standard gate-characterization experiment on a transmon qubit.
Quantum computing utilizes quantum mechanics to perform computations with superconducting qubits being the more mature technology as of writing in realizing a quantum computer. In this thesis, we describe an implementation of a Quantum Processor Unit (QPU), which is used to execute instructions in the form of microwave pulses on a superconducting qubit device through the use of signal generators and to perform qubit readout. We further extend the QPU as a platform to perform qubit characterization tasks such as spectroscopy and decoherence measurements in order to determine and optimize the working parameters to perform quantum gate operations. We also demonstrate the use of the QPU in performing qubit experiments such as Gauss Sum Factorization in determining the factors of an integer and the Bell Inequality test in examining the entanglement strength between a pair of qubits. We bridge the divide of quantum computation and qubit hardware in the compilation of quantum circuits into microwave pulse sequences for the QPU to execute. The process of compilation, as well as hardware limitations and pre-compilation optimization procedures are discussed. Finally, we show an example of executing a variational quantum algorithm and break down this example in all layers from the quantum circuit provided by the user to the pulse sequence that will be executed on the QPU.
Similar to a classical processor, which is an algorithm for reading a program and executing its instructions on input data, a universal programmable quantum processor is a fixed quantum channel that reads a quantum program ∣ψU⟩\lvertψ_{U}\rangle∣ψU​⟩ that causes the processor to approximately apply an arbitrary unitary UUU to a quantum data register. The present work focuses on a class of simple programmable quantum processors for implementing reflection operators, i.e. U=eiπ∣ψ⟩⟨ψ∣U = e^{i π\lvertψ\rangle\langleψ\rvert}U=eiπ∣ψ⟩⟨ψ∣ for an arbitrary pure state ∣ψ⟩\lvertψ\rangle∣ψ⟩ of finite dimension ddd. Unlike quantum programs that assume query access to UUU, our program takes the form of independent copies of the state to be reflected about ∣ψU⟩=∣ψ⟩⊗n\lvertψ_U\rangle = \lvertψ\rangle^{\otimes n}∣ψU​⟩=∣ψ⟩⊗n. We then identify the worst-case optimal algorithm among all processors of the form trProgram[V(∣ϕ⟩⟨ϕ∣⊗(∣ψ⟩⟨ψ∣)⊗n)V†]\text{tr}_{\text{Program}}[V (\lvertϕ\rangle\langleϕ\rvert \otimes (\lvertψ\rangle\langleψ\rvert)^{\otimes n}) V^\dagger]trProgram​[V(∣ϕ⟩⟨ϕ∣⊗(∣ψ⟩⟨ψ∣)⊗n)V†] where the algorithm VVV is a unitary linear combination of permutations. By generalizing these algorithms to processors for arbitrary-angle rotations, eiα∣ψ⟩⟨ψ∣e^{i α\lvertψ\rangle\langleψ\rvert}eiα∣ψ⟩⟨ψ∣ for α∈Rα\in \mathbb Rα∈R, we give a construction for a universal programmable processor with better scaling in ddd. For programming reflections, we obtain a tight analytical lower bound on the program dimension by bounding the Holevo information of an ensemble of reflections applied to an entangled probe state. The lower bound makes use of a block decomposition of the uniform ensemble of reflected states with respect to irreps of the partially transposed permutation matrix algebra, and two representation-theoretic conjectures based on extensive numerical evidence.