Related papers: Open Quantum Systems and Quantum Algorithms
A large-scalable quantum computer model, whose qubits are represented by the subspace subtended by the ground state and the single exciton state on semiconductor quantum dots, is proposed. A universal set of quantum gates in this system may…
Typical quantum computing schemes require transformations (gates) to be targeted at specific elements (qubits). In many physical systems, direct targeting is difficult to achieve; an alternative is to encode local gates into globally…
We present a quantum averaging theory (QAT) for analytically modeling unitary gate dynamics in driven quantum systems beyond the rotating-wave approximation. QAT addresses the simultaneous presence of distinct timescales by generating a…
With the rapid progress in quantum hardware, there has been an increased interest in new quantum algorithms to describe complex many-body systems searching for the still-elusive goal of 'useful quantum advantage'. Surprisingly, quantum…
The simulation of large-scale classical systems in exponentially small space on quantum computers has gained attention. The prior work demonstrated that a quantum algorithm offers an exponential speedup over any classical algorithm in…
It is a fundamental, but still elusive question whether the schemes based on quantum mechanics, in particular on quantum entanglement, can be used for classical information processing and machine learning. Even partial answer to this…
In one-way quantum computation (1WQC) model, universal quantum computations are performed using measurements to designated qubits in a highly entangled state. The choices of bases for these measurements as well as the structure of the…
Open quantum systems have become an active area of research, owing to its potential applications in many different fields ranging from computation to biology. Here, we review the formalism of dynamical maps used to represent the time…
The gate version of quantum computation exploits several quantum key resources as superposition and entanglement to reach an outstanding performance. In the way, this theory was constructed adopting certain supposed processes imitating…
The stabilizing properties of one-error correcting jump codes are explored under realistic non-ideal conditions. For this purpose the quantum algorithm of the tent-map is decomposed into a universal set of Hamiltonian quantum gates which…
Universal set of quantum gates are realized from the conduction-band electron spin qubits of quantum dots embedded in a microcavity via two-channel Raman interaction. All of the gate operations are independent of the cavity mode states,…
We study the dynamics of quantum systems interacting with a stream of entangled qubits. Under fairly general conditions, we present a detailed framework describing the conditional dynamical maps for the system, called quantum trajectories,…
Quantum annealing processors typically control qubits in unison, attenuating quantum fluctuations uniformly until the applied system Hamiltonian is diagonal in the computational basis. This simplifies control requirements, allowing…
Near-term quantum computers are primarily limited by errors in quantum operations (or gates) between two quantum bits (or qubits). A physical machine typically provides a set of basis gates that include primitive 2-qubit (2Q) and 1-qubit…
We propose a modular quantum computation architecture based on utilizing multipartite entanglement. Each module consists of a small-scale quantum computer comprising data, memory and entangling qubits. Entangling qubits are used to…
Quantum computing can provide speedups in solving many problems as the evolution of a quantum system is described by a unitary operator in an exponentially large Hilbert space. Such unitary operators change the phase of their eigenstates…
Simulating open quantum systems on quantum computers presents a fundamental challenge: open quantum dynamics are intrinsically nonunitary, whereas quantum computers operate through unitary evolution. Conventional approaches overcome this…
Quantum algorithms could efficiently solve certain classically intractable problems by exploiting quantum parallelism. To date, whether the quantum entanglement is useful or not for quantum computing is still a question of debate. Here, we…
Scalable quantum computation in realistic devices requires that precise control can be implemented efficiently in the presence of decoherence and operational errors. We propose a general constructive procedure for designing robust unitary…
A bit-quantum map relates probabilistic information for Ising spins or classical bits to quantum spins or qubits. Quantum systems are subsystems of classical statistical systems. The Ising spins can represent macroscopic two-level…