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

arXiv:quant-ph/9702041

Superconductive Static Quantum Logic

Xin Xue, Haiqing Wei

Published Feb 20, 1997• 2 citations
arXivHTMLPDF

Abstract

Superconducting rings with exactly $Φ_0/2$ magnetic flux threading are analogous of Ising spins having two degenerate states which can be used to store binary information. When brought close these rings interact by means of magnetic coupling. If the interactions are properly tailored, a system of such superconducting rings can accomplish static quantum logic in the sense that the states of the rings interpreted as Boolean variables satisfy the desired logic relations when and only when the whole system is in the ground state. Such static logic is essential to carry out the static quantum computation [1,2].

DOI
10.48550/arxiv.quant-ph/9702041

Related papers

Static Quantum Computation

Haiqing Wei, Xin Xue

Tailoring many-body interactions among a proper quantum system endows it with computing ability by means of static quantum computation in the sense that some of the physical degrees of freedom can be used to store binary information and the corresponding binary variables satisfy some given logic relations if and only if the system is in the ground state. Two theorems are proved showing that the universal static quantum computer can encode the solutions for any P and NP problem into its ground state using only polynomial number (in the problem input size) of logic gates. The second step is to read out the solutions by relaxing the system. The time complexity is relevant when one tries to read out the solution by relaxing the system, therefore our model of static quantum computation provides a new connection between the computational complexity and the dynamics of a complex system.

arXiv:quant-ph/9702046•Feb 22, 1997•3 citations

Building quantum logic circuits using arrays of superconducting qubits

Jared B. Hertzberg, Antonio D. Corcoles, Maika Takita +6 more

Quantum computing holds the promise of a novel form of information processing in which data resides in quantum states. By exploiting superpositions and entanglement among these states, quantum logic operations are expected to far surpass conventional digital logic in certain classes of problems. To realize this prospect, we employ superconducting circuits at millikelvin temperatures. The nonlinearity of a Josephson tunnel junction enables a two-level quantum system, or qubit, with excitation energy in the microwave regime. Key recent advances in such devices are the demonstration of robust and simple multi-qubit gates, the integration of superconducting qubits into arrays of four or more, and gate fidelities reaching 99%. [1,2,3]

Conference digest•Jun 1, 2016•1 citation

Superconducting Quantum Circuits, Qubits and Computing

Goran P. Wendin, Vitaly S. Shumeiko

This paper gives an introduction to the physics and principles of operation of quantized superconducting electrical circuits for quantum information processing.

arXiv:cond-mat/0508729•Aug 30, 2005•48 citations

Tailoring Many-Body Interactions to Solve Hard Combinatorial Problems

Haiqing Wei, Xin Xue

A quantum machine consisting of interacting linear clusters of atoms is proposed for the 3SAT problem. Each cluster with two relevant states of collective motion can be used to register a Boolean variable. Given any 3SAT Boolean formula the interactions among the clusters can be so tailored that the ground state(s) (possibly degenerate) of the whole system encodes the satisfying truth assignment(s) for it. This relates the 3SAT problem to the dynamics of the properly designed glass system.

arXiv:quant-ph/9702039•Feb 20, 1997•2 citations

Logic gates for superconducting qubits

Matthias Steffen, R. McDermott, Ken B. Cooper +7 more

Bulletin of the American Physical Society•Mar 22, 2005•0 citations

Adiabatic transport properties of an exactly soluble one-dimensional quantum many-body problem

Bill Sutherland, B. Sriram Shastry

We study an interacting one-dimensional quantum lattice gas, based on the Heisenberg-Ising ring. The particles are given a charge, and the ring is threaded by a magnetic flux. We then calculate exactly the energy of the state, which begins as the ground state with zero magnetic flux, when the magnetic flux is adiabatically increased. We find the result that the period of the ground state is two flux quanta, which can be interpreted as charge carriers with half-integer charge.

Physical Review Letters•Oct 8, 1990•86 citations
Superconducting rings with exactly Φ0/2Φ_0/2Φ0​/2 magnetic flux threading are analogous of Ising spins having two degenerate states which can be used to store binary information. When brought close these rings interact by means of magnetic coupling. If the interactions are properly tailored, a system of such superconducting rings can accomplish static quantum logic in the sense that the states of the rings interpreted as Boolean variables satisfy the desired logic relations when and only when the whole system is in the ground state. Such static logic is essential to carry out the static quantum computation [1,2].
Tailoring many-body interactions among a proper quantum system endows it with computing ability by means of static quantum computation in the sense that some of the physical degrees of freedom can be used to store binary information and the corresponding binary variables satisfy some given logic relations if and only if the system is in the ground state. Two theorems are proved showing that the universal static quantum computer can encode the solutions for any P and NP problem into its ground state using only polynomial number (in the problem input size) of logic gates. The second step is to read out the solutions by relaxing the system. The time complexity is relevant when one tries to read out the solution by relaxing the system, therefore our model of static quantum computation provides a new connection between the computational complexity and the dynamics of a complex system.
Quantum computing holds the promise of a novel form of information processing in which data resides in quantum states. By exploiting superpositions and entanglement among these states, quantum logic operations are expected to far surpass conventional digital logic in certain classes of problems. To realize this prospect, we employ superconducting circuits at millikelvin temperatures. The nonlinearity of a Josephson tunnel junction enables a two-level quantum system, or qubit, with excitation energy in the microwave regime. Key recent advances in such devices are the demonstration of robust and simple multi-qubit gates, the integration of superconducting qubits into arrays of four or more, and gate fidelities reaching 99%. [1,2,3]