相关论文: Quantum Computation as a Dynamical Process

With a combination of the quantum repeater and the cluster state approaches, we show that efficient quantum computation can be constructed even if all the entangling quantum gates only succeed with an arbitrarily small probability $p$. The…

New physical implementations of quantum computing elementary operations by pulse manipulations with electron spins of paramagnetic ions having two electrons and spin S=1 in a zero magnetic field are proposed. New type of microwave pulses…

Quantum computation is a subject of much theoretical promise, but has not been realized in large scale, despite the discovery of fault-tolerant procedures to overcome decoherence. Part of the reason is that the theoretically modest…

Arrays of weakly-coupled quantum systems can be made to compute by subjecting them to a sequence of electromagnetic pulses of well-defined frequency and length. Such pulsed arrays are true quantum computers: bits can be placed in…

The higher than classical efficiency exhibited by some quantum algorithms is here ascribed to their non-mechanistic character, which becomes evident by joining the notions of entanglement and quantum measurement. Measurement analogically…

We present a framework that utilizes quantum algorithms, an architecture aware quantum noise model and an ideal simulator to benchmark quantum computers. The benchmark metrics highlight the difference between the quantum computer evolution…

Analyzing the impact of noise is of fundamental importance to understand the advantages provided by quantum systems. While the classical simulability of noisy discrete-variable systems is increasingly well understood, noisy bosonic circuits…

Quantum systems are inherently open and susceptible to environmental noise, which can have both detrimental and beneficial effects on their dynamics. This phenomenon has been observed in bio-molecular systems, where noise enables novel…

In this chapter we explore the connection between mesoscopic physics and quantum computing. After giving a bibliography providing a general introduction to the subject of quantum information processing, we review the various approaches that…

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…

While most work on the quantum simulation of chemistry has focused on computing energy surfaces, a similarly important application requiring subtly different algorithms is the computation of energy derivatives. Almost all molecular…

Perturbation theory is an important technique for reducing computational cost and providing physical insights in simulating quantum systems with classical computers. Here, we provide a quantum algorithm to obtain perturbative energies on…

The speed of quantum computation is investigated through the time evolution of the speed of the orthogonality. The external field components for classical treatment beside the detuning and the coupling parameters for quantum treatment play…

How well can quantum computers simulate classical dynamical systems? There is increasing effort in developing quantum algorithms to efficiently simulate dynamics beyond Hamiltonian simulation, but so far exact resource estimates are not…

One of the most significant hurdles to be overcome on the path to practical quantum information processors is dealing with quantum errors. Dynamical decoupling is a particularly promising approach that complements conventional quantum error…

The resonant state of the open quantum system is studied from the viewpoint of the outgoing momentum flux. We show that the number of particles is conserved for a resonant state, if we use an expanding volume of integration in order to take…

Quantum machine learning algorithms based on parameterized quantum circuits are promising candidates for near-term quantum advantage. Although these algorithms are compatible with the current generation of quantum processors, device noise…

Algorithms are described for efficiently simulating quantum mechanical systems on quantum computers. A class of algorithms for simulating the Schrodinger equation for interacting many-body systems are presented in some detail. These…

Most quantum processors requires pulse sequences for controlling quantum states. Here, we present an alternative algorithm for computing an optimal pulse sequence in order to perform a specific task, being an implementation of a quantum…

We discuss quantum algorithms that calculate numerical integrals and descriptive statistics of stochastic processes. With either of two distinct approaches, one obtains an exponential speed increase in comparison to the fastest known…