Related papers: Scalable Architecture for Adiabatic Quantum Comput…

The high-speed implementation and robustness against of non-adiabatic holonomic quantum computation provide a new idea for overcoming the difficulty of quantum system interacting with the environment easily decoherence, which realizing…

Tremendous efforts have been paid for realization of fault-tolerant quantum computation so far. However, preexisting fault-tolerant schemes assume that a lot of qubits live together in a single quantum system, which is incompatible with…

We analyze the complexity of the quantum optimization algorithm based on adiabatic evolution for the set partition problem. We introduce a cost function defined on a logarithmic scale of the partition residues so that the total number of…

We develop an architecture of hybrid quantum solid-state processing unit for universal quantum computing. The architecture allows distant and nonidentical solid-state qubits in distinct physical systems to interact and work collaboratively.…

Adiabatic operations are powerful tools for robust quantum control in numerous fields of physics, chemistry and quantum information science. The inherent robustness due to adiabaticity can, however, be impaired in applications requiring…

Nonadiabatic geometric quantum computation in decoherence-free subspaces has received increasing attention due to the merits of its high-speed implementation and robustness against both control errors and decoherence. However, all the…

Physical implementations of quantum computation must be scrutinized about their reliability under real conditions, in order to be considered as viable candidates. Among the proposed models, those based on adiabatic quantum dynamics have…

Adiabatic limit is the presumption of the adiabatic geometric quantum computation and of the adiabatic quantum algorithm. But in reality, the variation speed of the Hamiltonian is finite. Here we develop a general formulation of adiabatic…

Multi-Object Tracking (MOT) is most often approached in the tracking-by-detection paradigm, where object detections are associated through time. The association step naturally leads to discrete optimization problems. As these optimization…

We propose a scheme for scalable and robust quantum computing on two-dimensional arrays of qubits with fixed longitudinal coupling. This opens the possibility for bypassing the device complexity associated with tunable couplers required in…

The non-adiabatic holonomic quantum computation with the advantages of fast and robustness attracts widespread attention in recent years. Here, we propose the first scheme for realizing universal single-qubit gates based on an…

Adiabatic quantum optimization offers a new method for solving hard optimization problems. In this paper we calculate median adiabatic times (in seconds) determined by the minimum gap during the adiabatic quantum optimization for an NP-hard…

Quantum adiabatic algorithm is a method of solving computational problems by evolving the ground state of a slowly varying Hamiltonian. The technique uses evolution of the ground state of a slowly varying Hamiltonian to reach the required…

We consider the effects of decoherence on Landau-Zener crossings encountered in a large-scale adiabatic-quantum-computing setup. We analyze the dependence of the success probability, i.e. the probability for the system to end up in its new…

The practical construction of scalable quantum computer hardware capable of executing non-trivial quantum algorithms will require the juxtaposition of different types of quantum systems. We analyze a modular ion trap quantum computer…

We study the fault tolerance of quantum computation by adiabatic evolution, a quantum algorithm for solving various combinatorial search problems. We describe an inherent robustness of adiabatic computation against two kinds of errors,…

We propose a hybrid classical-quantum digitized-counterdiabatic algorithm to tackle the protein folding problem on a tetrahedral lattice. Digitized-counterdiabatic quantum computing is a paradigm developed to compress quantum algorithms via…

Modern adiabatic quantum computers (AQC) are already used to solve difficult combinatorial optimisation problems in various domains of science. Currently, only a few applications of AQC in computer vision have been demonstrated. We review…

Quantum adiabatic processes -that keep constant the populations in the instantaneous eigenbasis of a time-dependent Hamiltonian- are very useful to prepare and manipulate states, but take typically a long time. This is often problematic…

Quantum computation provides exponential speedup for solving certain mathematical problems against classical computers. Motivated by current rapid experimental progress on quantum computing devices, various models of quantum computation…