Related papers: A quantum annealer with fully programmable all-to-…
With recent experimental advancements demonstrating high-fidelity universal logic gates and basic programmability, Silicon-based spin quantum bit (qubit) have emerged as promising candidates for scalable quantum computing. However,…
We demonstrate a planar, tunable superconducting qubit with energy relaxation times up to 44 microseconds. This is achieved by using a geometry designed to both minimize radiative loss and reduce coupling to materials-related defects. At…
Quantum Annealing (QA) relies on mixing two Hamiltonian terms, a simple driver and a complex problem Hamiltonian, in a linear combination. The time-dependent schedule for this mixing is often taken to be linear in time: improving on this…
Quantum information processing offers dramatic speedups, yet is famously susceptible to decoherence, the process whereby quantum superpositions decay into mutually exclusive classical alternatives, thus robbing quantum computers of their…
Bosonic codes in superconducting resonators are a hardware-efficient avenue for quantum error correction and benefit from favorable error hierarchies provided by long-lived cavities compared to typical superconducting qubits. The required…
Quantum Annealing (QA) is one of the most promising frameworks for quantum optimization. Here, we focus on the problem of minimizing complex classical cost functions associated with prototypical discrete neural networks, specifically the…
I present a novel use of quantum annealing to solve the Set Splitting Problem using (QUBO) problem formulation. The contribution of the work is in formulating penalty functions that ensure the ground state of the QUBO Hamiltonian…
Quantum annealing is a powerful tool for solving and approximating combinatorial optimization problems such as graph partitioning, community detection, centrality, routing problems, and more. In this paper we explore the use of quantum…
Quantum annealing approximately solves combinatorial optimization problems by leveraging the principles of adiabatic quantum systems. In this approach, the system's Hamiltonian evolves from an initial general state to a problem-specific…
We review recent theoretical and experimental progress in quantum state engineering with Josephson junction devices. The concepts of quantum computing have stimulated an increased activity in the field. Either charges or phases (fluxes) of…
Quantum annealing is a computational approach designed to leverage quantum fluctuations for solving large-scale classical optimization problems. Although incorporating standard transverse field (TF) terms in the annealing process can help…
Counterdiabatic driving, which enforces adiabatic evolution in arbitrary timescales, can be realised by engineering a Floquet Hamiltonian which oscillates between the Hamiltonian and its derivative requiring no additional control terms.…
We propose an effective scheme for manipulating quantum information stored in a superconducting nanocircuit. The Josephson qubits are coupled via their separate interactions with an information bus, a large current-biased Josephson junction…
Superconducting circuits extensively rely on the Josephson junction as a nonlinear electronic element for manipulating quantum information and mediating photon interactions. Despite continuing efforts in designing anharmonic Josephson…
Periodically driven quantum systems exhibit many fascinating phenomena absent in equilibrium systems, but their simulation is more challenging than that of static systems. Consequently, quantum simulation of these systems offers greater…
Quantum Fourier transform (QFT) is a widely used building block for quantum algorithms, whose scalable implementation is challenging in experiments. Here, we propose a protocol of quadratic quantum Fourier transform (QQFT), considering cold…
Josephson junctions have been shown to be a promising solid-state system for implementation of quantum computation. The significant two-qubit gates are generally realized by the capacitive coupling between the nearest neighbour qubits. We…
Tunability of an artificial quantum system is crucial to its capability to process quantum information. However, tunability usually poses significant demand on the design and fabrication of a device. In this work, we demonstrate that…
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…
Quantum annealing machines based on superconducting qubits, which have the potential to solve optimization problems faster than digital computers, are of great interest not only to researchers but also to the general public. Here, we…