相关论文: Universal quantum computation with two- and three-…

We introduce a general scheme for sequential one-way quantum computation where static systems with long-living quantum coherence (memories) interact with moving systems that may possess very short coherence times. Both the generation of the…

Generalized quantum measurements are an important extension of projective or von Neumann measurements, in that they can be used to describe any measurement that can be implemented on a quantum system. We describe how to realize two…

In Ref. [Phys. Rev. A 100, 062317 (2019)], the authors reported an algorithm to implement, in a circuit-based quantum computer, a general quantum measurement (GQM) of a two-level quantum system, a qubit. Even though their algorithm seems…

We propose a method for the implementation of one-way quantum computing in superconducting circuits. Measurement-based quantum computing is a universal quantum computation paradigm in which an initial cluster-state provides the quantum…

Entanglement is a fundamental feature of quantum mechanics and holds great promise for enhancing metrology and communications. Much of the focus of quantum metrology so far has been on generating highly entangled quantum states that offer…

The universal quantum computer is a device capable of simulating any physical system and represents a major goal for the field of quantum information science. Algorithms performed on such a device are predicted to offer significant gains…

What interactions are sufficient to simulate arbitrary quantum dynamics in a composite quantum system? We provide an efficient algorithm to simulate any desired two-body Hamiltonian evolution using any fixed two-body entangling n-qubit…

We present two new quantum union bounds for sequential projective measurements. These bounds estimate the disturbance accumulation and probability of outcomes when the measurements are performed sequentially. These results are based on a…

Operating quantum sensors and quantum computers would make data in the form of quantum states available for purely quantum processing, opening new avenues for studying physical processes and certifying quantum technologies. In this…

In this paper we investigate the linear and nonlinear models of optical quantum computation and discuss their scalability and efficiency. We show how there are significantly different scaling properties in single photon computation when…

Nielsen [quant-ph/0108020] introduced a model of quantum computation by measurement-based simulation of unitary computations. In this model, a consequence of the non-determinism of quantum measurement is the probabilistic termination of…

There are two schools of "measurement-only quantum computation". The first ([11]) using prepared entanglement (cluster states) and the second ([4]) using collections of anyons, which according to how they were produced, also have an…

We propose a new implementation of a universal set of one- and two-qubit gates for quantum computation using the spin states of coupled single-electron quantum dots. Desired operations are effected by the gating of the tunneling barrier…

We show, within the circuit model, how any quantum computation can be efficiently performed using states with only real amplitudes (a result known within the Quantum Turing Machine model). This allows us to identify a 2-qubit (in fact…

In this paper, we present a general theory of finite quantum measurements, for which we assume that the state space of the measured system is a finite dimensional Hilbert space and that the possible outcomes of a measurement is a finite set…

Quantum algorithms designed for realistic quantum many-body systems, such as chemistry and materials, usually require a large number of measurements of the Hamiltonian. Exploiting different ideas, such as {importance sampling,} observable…

It is first pointed out that there is a common mathematical model for the universe and the quantum computer. The former is called the histories approach to quantum mechanics and the latter is called measurement based quantum computation.…

We show that universal quantum computation can be achieved in the standard pure-state circuit model while, at any time, the entanglement entropy of all bipartitions is small---even tending to zero with growing system size. The result is…

We propose a universal quantum circuit design that can estimate any arbitrary one-dimensional periodic functions based on the corresponding Fourier expansion. The quantum circuit contains N-qubits to store the information on the different…

Optimal and finite positive operator valued measurements on a finite number $N$ of identically prepared systems have been presented recently. With physical realization in mind we propose here optimal and minimal generalized quantum…