Related papers: Quantum computing Hamiltonian cycles
Quantum computing is a promising new area of computing with quantum algorithms offering a potential speedup over classical algorithms if fault tolerant quantum computers can be built. One of the first applications of the classical computer…
A scheme of universal quantum computation on a chain of qubits is described that does not require local control. All the required operations, an Ising-type interaction and spatially uniform simultaneous one-qubit gates, are…
We describe a quantum computer based upon the coherent manipulation of two-level atoms between discrete one-dimensional momentum states. Combinations of short laser pulses with kinetic energy dependent free phase evolution can perform the…
Symmetries in a Hamiltonian play an important role in quantum physics because they correspond directly with conserved quantities of the related system. In this paper, we propose quantum algorithms capable of testing whether a Hamiltonian…
The model of open quantum systems is adopted to describe the non-local dynamical behaviour of qubits processed by entangling gates. The analysis gets to the conclusion that a distinction between evaluation steps and task-oriented computing…
Quantum computing promises the possibility of studying the real-time dynamics of nonperturbative quantum field theories while avoiding the sign problem that obstructs conventional lattice approaches. Current and near-future quantum devices…
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 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…
Quantum computing, leveraging the principles of quantum mechanics, has been found to significantly enhance computational capabilities in principle, in some cases beyond classical computing limits. This paper explores quantum computing's…
Quantum computers can solve specific complex tasks for which no reasonable-time classical algorithm is known. Quantum computers do however also offer inherent security of data, as measurements destroy quantum states. Using shared entangled…
In order to find Hamiltonian cycle, algorithm should find edges that creates a Hamiltonian cycle. Higher number of edges creates more possibilities to check to solve the problem. Algorithm rests on analysis of original graph and opposite…
We prove that computing a single pair of vertices that are mapped onto each other by an isomorphism $\phi$ between two isomorphic graphs is as hard as computing $\phi$ itself. This result optimally improves upon a result of G\'{a}l et al.…
Quantum algorithms are sequences of abstract operations, performed on non-existent computers. They are in obvious need of categorical semantics. We present some steps in this direction, following earlier contributions of Abramsky, Coecke…
Quantum computing opens up new possibilities for the simulation of many-body nuclear systems. As the number of particles in a many-body system increases, the size of the space if the associated Hamiltonian increases exponentially. This…
A universal quantum computing scheme, with a universal set of logical gates, is proposed based on networks of 1D quantum systems. The encoding of information is in terms of universal features of gapped phases, for which effective field…
In the past decade quantum algorithms have been found which outperform the best classical solutions known for certain classical problems as well as the best classical methods known for simulation of certain quantum systems. This suggests…
Quantum entanglement in multipartite systems cannot be shared freely. In order to illuminate basic rules of entanglement sharing between qubits we introduce a concept of an entangled structure (graph) such that each qubit of a multipartite…
Quantum networks are natural scenarios for the communication of information among distributed parties, and the arena of promising schemes for distributed quantum computation. Measurement-based quantum computing is a prominent example of how…
In quantum adiabatic evolution algorithms, the quantum computer follows the ground state of a slowly varying Hamiltonian. The ground state of the initial Hamiltonian is easy to construct; the ground state of the final Hamiltonian encodes…
The one-way quantum computer (QCc) is a universal scheme of quantum computation consisting only of one-qubit measurements on a particular entangled multi-qubit state, the cluster state. The computational model underlying the QCc is…