English
Related papers

Related papers: Coherent coupled qubits for quantum annealing

200 papers

Superconducting quantum technologies require qubit systems whose properties meet several often conflicting requirements, such as long coherence times and high anharmonicity. Here, we provide an engineering framework based on a generalized…

We consider whether quantum coherence in the form of mutual entanglement between a pair of qubits is susceptible to decay that may be more rapid than the decay of the coherence of either qubit individually. An instance of potential…

Quantum Physics · Physics 2009-11-10 Ting Yu , J. H. Eberly

Quantum addition based on the quantum Fourier transform can be an integral part of a quantum circuit and proved to be more efficient than the existing classical ripple carry adder. Our study includes identifying the quantum resource…

In previous work, we have proposed an entanglement indicator for a general multiqubit state, which can be "learned" by a quantum system, acting as a neural network. The indicator can be used for a pure or a mixed state, and it need not be…

Quantum Physics · Physics 2017-02-07 E. C. Behrman , N. H. Nguyen , J. E. Steck , M. McCann

Quantum computation is a promising emerging technology, and by utilizing the principles of quantum mechanics, it is expected to achieve faster computations than classical computers for specific problems. There are two distinct architectures…

Quantum Physics · Physics 2025-03-13 Takashi Imoto , Yuki Susa , Ryoji Miyazaki , Yuichiro Matsuzaki

Quantum annealers are specialized quantum computers for solving combinatorial optimization problems using special characteristics of quantum computing (QC), such as superposition, entanglement, and quantum tunneling. Theoretically, quantum…

Software Engineering · Computer Science 2024-07-29 Xinyi Wang , Asmar Muqeet , Tao Yue , Shaukat Ali , Paolo Arcaini

The fluxonium qubit is a promising candidate for quantum computation due to its long coherence times and large anharmonicity. We present a tunable coupler that realizes strong inductive coupling between two heavy-fluxonium qubits, each with…

Quantum error-correcting codes (QECCs) is at the heart of fault-tolerant quantum computing. As the size of quantum platforms is expected to grow, one of the open questions is to design new optimal codes of ever-increasing size. A related…

Quantum Physics · Physics 2024-07-08 Refat Ismail , Ashish Kakkar , Anatoly Dymarsky

We propose a prime factorizer operated in a framework of quantum annealing (QA). The idea is inverse operation of a multiplier implemented with QA-based Boolean logic circuits. We designed the QA machine on an…

A quantum annealer exploits quantum effects to solve a particular type of optimization problem. The advantage of this specialized hardware is that it effectively considers all possible solutions in parallel, thereby potentially…

Programming Languages · Computer Science 2018-04-03 Scott Pakin

We have observed coherent time evolution between two quantum states of a superconducting flux qubit comprising three Josephson junctions in a loop. The superposition of the two states carrying opposite macroscopic persistent currents is…

Mesoscale and Nanoscale Physics · Physics 2009-11-10 I. Chiorescu , Y. Nakamura , C. J. P. M. Harmans , J. E. Mooij

We have measured flux-noise correlations in a tunable superconducting flux qubit. The device consists of two loops that independently control the qubit's energy splitting and tunnel coupling. Low frequency flux noise in the loops causes…

By simultaneously coupling multiple two-level artificial atoms to two superconducting resonators, we design a quantum switch that tunes the resonator-resonator coupling strength from zero to a large value proportional to the number of…

Quantum Physics · Physics 2018-10-23 Qi-Ming Chen , Re-Bing Wu , Luyan Sun , Yu-xi Liu

Major breakthrough in quantum computation has recently been achieved using quantum annealing to develop analog quantum computers instead of gate based computers. After a short introduction to quantum computation, we retrace very briefly the…

History and Philosophy of Physics · Physics 2013-12-02 Asim Ghosh , Sudip Mukherjee

Quantum Annealing, or Quantum Stochastic Optimization, is a classical randomized algorithm which provides good heuristics for the solution of hard optimization problems. The algorithm, suggested by the behaviour of quantum systems, is an…

Quantum Physics · Physics 2011-07-06 Diego de Falco , Dario Tamascelli

With a combination of the quantum repeater and the cluster state approaches, we show that efficient quantum computation can be constructed even if all the entangling quantum gates only succeed with an arbitrarily small probability $p$. The…

Quantum Physics · Physics 2009-11-11 L. -M. Duan , R. Raussendorf

We present a quantum annealing-based solution method for topology optimization (TO). In particular, we consider TO in a more general setting, i.e., applied to structures of continuum domains where designs are represented as distributed…

Numerical Analysis · Mathematics 2023-01-30 Zisheng Ye , Xiaoping Qian , Wenxiao Pan

Quantum repeaters enable the generation of reliable entanglement across long distances despite the underlying channel noise. Nevertheless, realizing quantum repeaters poses a difficult engineering challenge due to various device constraints…

Quantum Physics · Physics 2025-12-29 Shin Sun , Daniel Bhatti , Shaobo Gao , David Elkouss , Hiroki Takahashi

To solve an optimization problem using a commercial quantum annealer, one has to represent the problem of interest as an Ising or a quadratic unconstrained binary optimization (QUBO) problem and submit its coefficients to the annealer,…

Quantum Physics · Physics 2023-06-13 Elijah Pelofske , Georg Hahn , Hristo Djidjev

A Quantum Internet, i.e., a global interconnection of quantum devices, is the long term goal of quantum communications, and has so far been based on two-dimensional systems (qubits). Recent years have seen a significant development of…

Quantum Physics · Physics 2022-03-11 Davide Bacco , Jacob F. F. Bulmer , Manuel Erhard , Marcus Huber , Stefano Paesani