相关论文: Quantum Ballistic Evolution in Quantum Mechanics: …

The rapid development of reliable Quantum Processing Units (QPU) opens up novel computational opportunities for machine learning. Here, we introduce a procedure for measuring the similarity between graph-structured data, based on the…

The quantum computer is supposed to process information by applying unitary transformations to the complex amplitudes defining the state of N qubits. A useful machine needing N=1000 or more, the number of continuous parameters describing…

Geometric quantum computation is the idea that geometric phases can be used to implement quantum gates, i.e., the basic elements of the Boolean network that forms a quantum computer. Although originally thought to be limited to adiabatic…

We consider quantum formalism limited by the classical simulating computer with the fixed memory. The memory is redistributed in the course of modeling by the variation of the set of classical states and the accuracy of the representation…

This is a review paper concerned with the global consistency of the quantum dynamics of non-commutative systems. Our point of departure is the theory of constrained systems, since it provides a unified description of the classical and…

Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware. Synthesizing the corresponding quantum circuit is typically done by breaking the evolution into small time steps, also known as…

Geometric phases, arising from cyclic evolutions in a curved parameter space, appear in a wealth of physical settings. Recently, and largely motivated by the need of an experimentally realistic definition for quantum computing applications,…

Quantum coherence, rooted in the superposition principle of quantum mechanics, is a crucial quantum resource. Various measures, operational interpretations, and generalizations of quantum coherence have been proposed. In recent years, its…

We construct a simple translationally invariant, nearest-neighbor Hamiltonian on a chain of 10-dimensional qudits that makes it possible to realize universal quantum computing without any external control during the computational process.…

The adiabatic quantum algorithm has drawn intense interest as a potential approach to accelerating optimization tasks using quantum computation. The algorithm is most naturally realised in systems which support Hamiltonian evolution, rather…

Quantum measurement is universal for quantum computation. This universality allows alternative schemes to the traditional three-step organisation of quantum computation: initial state preparation, unitary transformation, measurement. In…

Modeling non-Hermitian Hamiltonians is increasingly important in classical and quantum domains, especially when studying open systems, $PT$ symmetry, and resonances. However, the quantum simulation of these models has been limited by the…

Quantum computing promises to exploit the laws of quantum mechanics for processing information in ways fundamentally different from today's classical computers, leading to unprecedented efficiency. One-way quantum computation, sometimes…

Recently 't Hooft demonstrated that ``For any quantum system there exists at least one deterministic model that reproduces all its dynamics after prequantization''. An extension is presented here which covers quantum systems that are…

We present a quantum algorithm to estimate parameters at the quantum metrology limit using deterministic quantum computation with one bit. When the interactions occurring in a quantum system are described by a Hamiltonian $H= \theta H_0$,…

We consider a quantum particle, moving on a lattice with a tight-binding Hamiltonian, which is subjected to measurements to detect it's arrival at a particular chosen set of sites. The projective measurements are made at regular time…

The adiabatic theorem in quantum mechanics implies that if a system is in a discrete eigenstate of a Hamiltonian and the Hamiltonian evolves in time arbitrarily slowly, the system will remain in the corresponding eigenstate of the evolved…

To gain deeper insight into the dynamics of complex quantum systems we need a quantum leap in computer simulations. We can not translate quantum behaviour arising with superposition states or entanglement efficiently into the classical…

We describe a solid state implementation of a quantum computer using ballistic single electrons as flying qubits in 1D nanowires. We show how to implement all the steps required for universal quantum computation: preparation of the initial…

Quantum computation with quantum data that can traverse closed timelike curves represents a new physical model of computation. We argue that a model of quantum computation in the presence of closed timelike curves can be formulated which…