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

Scientific Reports

Superconducting quantum circuit of NOR in quantum annealing

Daisuke Saida, Mutsuo Hidaka, Kouhei Miyake, Kentaro Imafuku, Yuki Yamanashi

Published Sep 23, 2022• 6 citations
Publisher

Abstract

The applicability of quantum annealing to various problems can be improved by expressing the Hamiltonian using a circuit satisfiability problem. We investigate the detailed characteristics of the NOR/NAND functions of a superconducting quantum circuit, which are the basic building blocks to implementing various types of problem Hamiltonians. The circuit is composed of superconducting flux qubits with all-to-all connectivity, where direct magnetic couplers are utilized instead of the variable couplers in the conventional superconducting quantum circuit. This configuration provides efficient scalability because the problem Hamiltonian is implemented using fewer qubits. We present an experiment with a complete logic operation of NOR/NAND, in which the circuit produces results with a high probability of success for arbitrary combinations of inputs. The features of the quantum circuit agree qualitatively with the theory, especially the mechanism for an operation under external flux modulation. Moreover, by calibrating the bias conditions to compensate for the offset flux from the surrounding circuit, the quantum circuit quantitatively agrees with the theory. To achieve true quantum annealing, we discuss the effects of the reduction in electric noise in quantum annealing.

DOI
10.1038/s41598-022-20172-0

Related papers

Experimental Demonstrations of Native Implementation of Boolean Logic Hamiltonian in a Superconducting Quantum Annealer

Daisuke Saida, Yuki Yamanashi, Mutsuo Hidaka +4 more

Experimental demonstrations of quantum annealing with “native” implementation of Boolean logic Hamiltonians are reported. As a superconducting integrated circuit, a problem Hamiltonian whose set of ground states is consistent with a given truth table is implemented for quantum annealing with no redundant qubits. As examples of the truth table,nandandnorare successfully fabricated as an identical circuit. Similarly, a native implementation of a multiplier comprising six superconducting flux qubits is also demonstrated. These native implementations of Hamiltonians consistent with Boolean logic provide an efficient and scalable way of applying annealing computation to so-called circuit satisfiability problems that aim to find a set of inputs consistent with a given output over any Boolean logic functions, especially those like factorization through a multiplier Hamiltonian. A proof-of-concept demonstration of a hybrid computing architecture for domain-specific quantum computing is described.

arXiv:2106.08681•IEEE Transactions on Quantum Engineering•Jan 1, 2021•8 citations

Factorization by quantum annealing using superconducting flux qubits implementing a multiplier Hamiltonian

Daisuke Saida, Mutsuo Hidaka, Kentaro Imafuku +1 more

Prime factorization (P = M × N) is a promising application for quantum computing. Shor's algorithm is a key concept for breaking the limit for analyzing P, which cannot be effectively solved by classical computation; however, the algorithm requires error-correctable logical qubits. Here, we describe a quantum annealing method for solving prime factorization. A superconducting quantum circuit with native implementation of the multiplier Hamiltonian provides combinations of M and N as a solution for number P after annealing. This circuit is robust and can be expanded easily to scale up the analysis. We present an experimental and theoretical exploration of the multiplier unit. We demonstrate the 2-bit factorization in a circuit simulation and experimentally at 10 mK. We also explain how the current conditions can be used to obtain high success probability and all candidate factorized elements.

Scientific Reports•Aug 11, 2022•7 citations

Tunable three-body interactions between superconducting flux qubits for quantum annealing

Denis Melanson

The field of quantum information has been a fast growing field of research in the last few decades. The reason for this development is the potentially immense power of quantum computers, capable of solving hard problems in a fraction of the time it would take a classical computer. Quantum annealers are a type of quantum computer that seek to solve computational problems by finding the ground state of a quantum system. This type of quantum computer has been implemented on a large scale using superconducting flux quantum bits, but the computational power is limited. One potential improvement to help in this context is the implementation of multi-body interactions between quantum bits. Many-body interactions would be useful in allowing quantum annealers to solve more complex problems that are relevant in various areas of quantum information and science and implementing quantum error correction. \n \nWe present a superconducting device that implements a strong and tunable in sign and magnitude three-body interaction between superconducting flux quantum bits. The circuit design proposed has vanishing two-body interactions and robustness against noise and parameter variations. This circuit behaves as an ideal computational basis ZZZ coupler in a simulated three-qubit quantum annealing experiment. These properties are confirmed by calculations based on the Born-Oppenheimer approximation, a two-level spin model for the coupling circuit, and full numerical diagonalization. \n \nThe proposed circuit is based on already available technology and therefore could be readily implemented in the next generation of quantum annealing hardware. This work will be relevant for advanced quantum annealing protocols and future developments of high-order many-body interactions in quantum computers and simulators.

•Sep 3, 2019•0 citations

Customized Quantum Annealing Schedules

Mostafa Khezri, Xi Dai, Rui Liang Yang +3 more

In a typical quantum annealing protocol, the system starts with a transverse field Hamiltonian that is gradually turned off and replaced by a longitudinal Ising Hamiltonian. The ground state of the Ising Hamiltonian encodes the solution to the computational problem of interest, and the state overlap with this ground state gives the success probability of the annealing protocol. The form of the annealing schedule can have a significant impact on the ground-state overlap at the end of the anneal, so precise control over these annealing schedules can be a powerful tool for increasing success probabilities of annealing protocols. Here we show how superconducting circuits, in particular capacitively shunted flux qubits, can be used to construct quantum annealing systems by providing tools for mapping circuit flux biases to Pauli coefficients. We use this mapping to find customized annealing schedules: appropriate circuit control biases that yield a desired annealing schedule, while accounting for the physical limitations of the circuitry. We then provide examples and proposals that utilize this capability to improve quantum annealing performance.

arXiv:2103.06461•Physical Review Applied•Apr 4, 2022•14 citations

Application in Adiabatic Quantum Annealing

Siyuan Han

This chapter focuses on the application of Nb Josephson junctions (JJs) in quantum annealing (QA). It begins with a brief introduction to diffident strategies for implementing quantum computation (QC) with an emphasis on quantum annealing. The chapter presents the basic physics of the simplest superconducting flux qubit: radio frequency superconducting quantum interference devices (RF-SQUID). It gives a brief description on the design and realization of couplers, and control and measurement circuitry using Nb Josephson junctions. The chapter describes a scalable architecture upon which quantum annealing processors consisting up to 1024 superconducting flux qubits made of more than 104 Nb Josephson junctions. It discusses evidence on whether D-Wave 2X, which is the latest quantum annealing processor available, works as expected. The chapter also focuses on the physics and application of RF-SQUID flux qubits because the fundamental building blocks of the most advanced quantum annealers demonstrated so far are variations of superconducting flux qubits with one Josephson junction, a.k.a. the RF-SQUID.

•Aug 22, 2017•0 citations

Circuit design for multi-body interactions in superconducting quantum annealing systems with applications to a scalable architecture

Nicholas Chancellor, S. Zohren, Paul A. Warburton

Abstract Quantum annealing provides a way of solving optimization problems by encoding them as Ising spin models which are implemented using physical qubits. The solution of the optimization problem then corresponds to the ground state of the system. Quantum tunneling is harnessed to enable the system to move to the ground state in a potentially high non-convex energy landscape. A major difficulty in encoding optimization problems in physical quantum annealing devices is the fact that many real world optimization problems require interactions of higher connectivity, as well as multi-body terms beyond the limitations of the physical hardware. In this work we address the question of how to implement multi-body interactions using hardware which natively only provides two-body interactions. The main result is an efficient circuit design of such multi-body terms using superconducting flux qubits in which effective N -body interactions are implemented using N ancilla qubits and only two inductive couplers. It is then shown how this circuit can be used as the unit cell of a scalable architecture by applying it to a recently proposed embedding technique for constructing an architecture of logical qubits with arbitrary connectivity using physical qubits which have nearest-neighbor four-body interactions. It is further shown that this design is robust to non-linear effects in the coupling loops, as well as mismatches in some of the circuit parameters.

arXiv:1603.09521•npj Quantum Information•Jun 5, 2017•75 citations
The applicability of quantum annealing to various problems can be improved by expressing the Hamiltonian using a circuit satisfiability problem. We investigate the detailed characteristics of the NOR/NAND functions of a superconducting quantum circuit, which are the basic building blocks to implementing various types of problem Hamiltonians. The circuit is composed of superconducting flux qubits with all-to-all connectivity, where direct magnetic couplers are utilized instead of the variable couplers in the conventional superconducting quantum circuit. This configuration provides efficient scalability because the problem Hamiltonian is implemented using fewer qubits. We present an experiment with a complete logic operation of NOR/NAND, in which the circuit produces results with a high probability of success for arbitrary combinations of inputs. The features of the quantum circuit agree qualitatively with the theory, especially the mechanism for an operation under external flux modulation. Moreover, by calibrating the bias conditions to compensate for the offset flux from the surrounding circuit, the quantum circuit quantitatively agrees with the theory. To achieve true quantum annealing, we discuss the effects of the reduction in electric noise in quantum annealing.
Experimental demonstrations of quantum annealing with “native” implementation of Boolean logic Hamiltonians are reported. As a superconducting integrated circuit, a problem Hamiltonian whose set of ground states is consistent with a given truth table is implemented for quantum annealing with no redundant qubits. As examples of the truth table,nandandnorare successfully fabricated as an identical circuit. Similarly, a native implementation of a multiplier comprising six superconducting flux qubits is also demonstrated. These native implementations of Hamiltonians consistent with Boolean logic provide an efficient and scalable way of applying annealing computation to so-called circuit satisfiability problems that aim to find a set of inputs consistent with a given output over any Boolean logic functions, especially those like factorization through a multiplier Hamiltonian. A proof-of-concept demonstration of a hybrid computing architecture for domain-specific quantum computing is described.
Prime factorization (P = M × N) is a promising application for quantum computing. Shor's algorithm is a key concept for breaking the limit for analyzing P, which cannot be effectively solved by classical computation; however, the algorithm requires error-correctable logical qubits. Here, we describe a quantum annealing method for solving prime factorization. A superconducting quantum circuit with native implementation of the multiplier Hamiltonian provides combinations of M and N as a solution for number P after annealing. This circuit is robust and can be expanded easily to scale up the analysis. We present an experimental and theoretical exploration of the multiplier unit. We demonstrate the 2-bit factorization in a circuit simulation and experimentally at 10 mK. We also explain how the current conditions can be used to obtain high success probability and all candidate factorized elements.
The field of quantum information has been a fast growing field of research in the last few decades. The reason for this development is the potentially immense power of quantum computers, capable of solving hard problems in a fraction of the time it would take a classical computer. Quantum annealers are a type of quantum computer that seek to solve computational problems by finding the ground state of a quantum system. This type of quantum computer has been implemented on a large scale using superconducting flux quantum bits, but the computational power is limited. One potential improvement to help in this context is the implementation of multi-body interactions between quantum bits. Many-body interactions would be useful in allowing quantum annealers to solve more complex problems that are relevant in various areas of quantum information and science and implementing quantum error correction. \n \nWe present a superconducting device that implements a strong and tunable in sign and magnitude three-body interaction between superconducting flux quantum bits. The circuit design proposed has vanishing two-body interactions and robustness against noise and parameter variations. This circuit behaves as an ideal computational basis ZZZ coupler in a simulated three-qubit quantum annealing experiment. These properties are confirmed by calculations based on the Born-Oppenheimer approximation, a two-level spin model for the coupling circuit, and full numerical diagonalization. \n \nThe proposed circuit is based on already available technology and therefore could be readily implemented in the next generation of quantum annealing hardware. This work will be relevant for advanced quantum annealing protocols and future developments of high-order many-body interactions in quantum computers and simulators.
In a typical quantum annealing protocol, the system starts with a transverse field Hamiltonian that is gradually turned off and replaced by a longitudinal Ising Hamiltonian. The ground state of the Ising Hamiltonian encodes the solution to the computational problem of interest, and the state overlap with this ground state gives the success probability of the annealing protocol. The form of the annealing schedule can have a significant impact on the ground-state overlap at the end of the anneal, so precise control over these annealing schedules can be a powerful tool for increasing success probabilities of annealing protocols. Here we show how superconducting circuits, in particular capacitively shunted flux qubits, can be used to construct quantum annealing systems by providing tools for mapping circuit flux biases to Pauli coefficients. We use this mapping to find customized annealing schedules: appropriate circuit control biases that yield a desired annealing schedule, while accounting for the physical limitations of the circuitry. We then provide examples and proposals that utilize this capability to improve quantum annealing performance.
This chapter focuses on the application of Nb Josephson junctions (JJs) in quantum annealing (QA). It begins with a brief introduction to diffident strategies for implementing quantum computation (QC) with an emphasis on quantum annealing. The chapter presents the basic physics of the simplest superconducting flux qubit: radio frequency superconducting quantum interference devices (RF-SQUID). It gives a brief description on the design and realization of couplers, and control and measurement circuitry using Nb Josephson junctions. The chapter describes a scalable architecture upon which quantum annealing processors consisting up to 1024 superconducting flux qubits made of more than 104 Nb Josephson junctions. It discusses evidence on whether D-Wave 2X, which is the latest quantum annealing processor available, works as expected. The chapter also focuses on the physics and application of RF-SQUID flux qubits because the fundamental building blocks of the most advanced quantum annealers demonstrated so far are variations of superconducting flux qubits with one Josephson junction, a.k.a. the RF-SQUID.
Abstract Quantum annealing provides a way of solving optimization problems by encoding them as Ising spin models which are implemented using physical qubits. The solution of the optimization problem then corresponds to the ground state of the system. Quantum tunneling is harnessed to enable the system to move to the ground state in a potentially high non-convex energy landscape. A major difficulty in encoding optimization problems in physical quantum annealing devices is the fact that many real world optimization problems require interactions of higher connectivity, as well as multi-body terms beyond the limitations of the physical hardware. In this work we address the question of how to implement multi-body interactions using hardware which natively only provides two-body interactions. The main result is an efficient circuit design of such multi-body terms using superconducting flux qubits in which effective N -body interactions are implemented using N ancilla qubits and only two inductive couplers. It is then shown how this circuit can be used as the unit cell of a scalable architecture by applying it to a recently proposed embedding technique for constructing an architecture of logical qubits with arbitrary connectivity using physical qubits which have nearest-neighbor four-body interactions. It is further shown that this design is robust to non-linear effects in the coupling loops, as well as mismatches in some of the circuit parameters.