相关论文: ALEPH-QP: Universal hybrid quantum processors
Quantum gates are the fundamental instructions of digital quantum computers. Current programming languages, systems, and software development toolkits identify these operational gates by their titles, which requires a shared understanding…
We consider a hybrid quantum system consisting of a qubit system continuously evolving according to its fixed own Hamiltonian and a quantum computer. The qubit system couples to a quantum computer through a fixed interaction Hamiltonian,…
Today's quantum computers operate with a binary encoding that is the quantum analog of classical bits. Yet, the underlying quantum hardware consists of information carriers that are not necessarily binary, but typically exhibit a rich…
Quantum computers use quantum mechanical phenomena to perform conventionally intractable calculations for specific problems. Despite being universal machines, quantum computers are not expected to replace classical computers, but rather, to…
We present an algorithm for compiling arbitrary unitaries into a sequence of gates native to a quantum processor. As accurate CNOT gates are hard for the foreseeable Noisy- Intermediate-Scale Quantum devices era, our A* inspired algorithm…
A novel universal and fault-tolerant basis (set of gates) for quantum computation is described. Such a set is necessary to perform quantum computation in a realistic noisy environment. The new basis consists of two single-qubit gates…
We analyze a scheme for quantum computation where quantum gates can be continuously changed from standard dynamic gates to purely geometric ones. These gates are enacted by controlling a set of parameters that are subject to unwanted…
In a series of recent works, an interesting quantum generative model based on parameterized instantaneous polynomial quantum (IQP) circuits has emerged as they can be trained efficiently classically using any loss function that depends only…
It is an ongoing quest to realize topologically ordered quantum states on different platforms including condensed matter systems, quantum simulators and digital quantum processors. Unlike conventional states characterized by their local…
Arbitrary exponentially large unitaries cannot be implemented efficiently by quantum circuits. However, we show that quantum circuits can efficiently implement any unitary provided it has at most polynomially many nonzero entries in any row…
Quantum computer is the key to controlling complex processes. If its hardware, in general is successfully created on the basis of the physical baggage of the 20th century, the mathematical software is fundamentally lagging behind. Feynman's…
The promise of universal quantum computing requires scalable single- and inter-qubit control interactions. Currently, three of the leading candidate platforms for quantum computing are based on superconducting circuits, trapped ions, and…
Any quantum computational network can be constructed with a sequence of the two-qubit diagonal quantum gates and one-qubit gates in two-state quantum systems. The universal construction of these quantum gates in the quantum systems and of…
Quantum state discrimination is a fundamental primitive in quantum statistics where one has to correctly identify the state of a system that is in one of two possible known states. A programmable discrimination machine performs this task…
Quantum algorithms profit from the interference of quantum states in an exponentially large Hilbert space and the fact that unitary transformations on that Hilbert space can be broken down to universal gates that act only on one or two…
Measurement-based quantum computation describes a scheme where entanglement of resource states is utilized to simulate arbitrary quantum gates via local measurements. Recent works suggest that symmetry-protected topologically non-trivial,…
The quantum switch is a quantum computational primitive that provides computational advantage by applying operations in a superposition of orders. In particular, it can reduce the number of gate queries required for solving promise problems…
We present a class of hybrid classical systems using quantum co-processors and point out that unlike purely quantum computers, such hybrids can be both universal and Turing complete; we introduce such quantum-classical hybrids as…
We show how quantum dynamics (a unitary transformation) can be captured in the state of a quantum system, in such a way that the system can be used to perform, at a later time, the stored transformation almost perfectly on some other…
It is shown that a family of analytically solvable pulses can be used to obtain high fidelity quantum phase gates with surprising robustness against imperfections in the system or pulse parameters. Phase gates are important because they can…