Related papers: Coherent coupled qubits for quantum annealing
Quantum computing is no longer a nascent field. Programmable quantum annealing devices with more that 1000 qubits are commercially available. How does one know that a putative quantum annealing device is indeed quantum? How should one go…
Quantum annealing is a promising algorithm for solving combinatorial optimization problems. It searches for the ground state of the Ising model, which corresponds to the optimal solution of a given combinatorial optimization problem. The…
Parallel Quantum Annealing is a technique to solve multiple optimization problems simultaneously. Parallel quantum annealing aims to optimize the utilization of available qubits on a quantum topology by addressing multiple independent…
Large scale quantum computers will consist of many interacting qubits. In this paper we expand the two flux qubit coupling scheme first devised in [Phys. Rev. B {\bf 70}, 140501 (2004)] and realized in [Science {\bf 314}, 1427 (2006)] to a…
We discuss a practical design for tunably coupling a pair of flux qubits via the quantum inductance of a third high-frequency qubit. The design is particularly well suited for realizing a recently proposed microwave-induced parametric…
We investigate the performance of penalty-based quantum annealing (PQA) and constrained quantum annealing (CQA) in solving the graph partitioning problem under various noise models, including depolarizing, bit-flip, and phase-flip noise. We…
A method to suppress noise, which is one of the major obstacles to obtain an optimal solution in quantum annealers, is proposed. We generalize the conventionally used Hamiltonian, i.e., the transverse field Hamiltonian, by introducing an…
In a typical quantum annealing protocol, the system starts with a transverse field Hamiltonian which is gradually turned off and replaced by a longitudinal Ising Hamiltonian. The ground state of the Ising Hamiltonian encodes the solution to…
We propose a floating tunable coupler that does not rely on direct qubit-qubit coupling capacitances to achieve the zero-coupling condition. We show that the polarity of the qubit-coupler couplings can be engineered to offset the otherwise…
In the endeavour to make quantum computers a reality, integrated superconducting circuits have become a promising architecture. A major challenge of this approach is decoherence originating from spurious atomic tunneling defects at the…
Quantum annealing offers a novel approach to finding the optimal solutions for a variety of computational problems, where the quantum annealing controls influence the observed performance and error mechanisms by tuning the underlying…
Modern quantum annealers can find high-quality solutions to combinatorial optimisation objectives given as quadratic unconstrained binary optimisation (QUBO) problems. Unfortunately, obtaining suitable QUBO forms in computer vision remains…
Quantum annealing is a powerful alternative model for quantum computing, which can succeed in the presence of environmental noise even without error correction. However, despite great effort, no conclusive proof of a quantum speedup…
We propose a novel architecture for superconducting circuits to improve the efficiency of a quantum annealing system. To increase the capability of a circuit, it is desirable for a qubit to be coupled not only with adjacent qubits but also…
Recent theoretical and experimental studies have suggested that quantum Monte Carlo (QMC) simulation can behave similarly to quantum annealing (QA). The theoretical analysis was based on calculating transition rates between local minima, in…
Scaling the number of qubits while maintaining high-fidelity quantum gates remains a key challenge for quantum computing. Presently, superconducting quantum processors with >50-qubits are actively available. For such systems,…
We develop a hybrid type of quantum annealing in which we control temperature and quantum field simultaneously. We study the efficiency of proposed quantum annealing and find a good schedule of changing thermal fluctuation and quantum…
Controllable interaction between superconducting qubits is desirable for large-scale quantum computation and simulation. Here, based on a theoretical proposal by Yan et al. [Phys. Rev. Appl. 10, 054061 (2018)] we experimentally demonstrate…
Quantum annealing algorithms belong to the class of meta-heuristic tools, applicable for solving binary optimization problems. Hardware implementations of quantum annealing, such as the quantum processing units (QPUs) produced by D-Wave…
As superconducting quantum processors increase in complexity, techniques to overcome constraints on frequency crowding are needed. The recently developed method of laser-annealing provides an effective post-fabrication method to adjust the…