相关论文: Quantum computing Hamiltonian cycles
Quantum circuits generating probability distributions has applications in several areas. Areas like finance require quantum circuits that can generate distributions that mimic some given data pattern. Hamiltonian simulations require…
Numerical simulation of quantum systems is crucial to further our understanding of natural phenomena. Many systems of key interest and importance, in areas such as superconducting materials and quantum chemistry, are thought to be described…
In this paper, I will discuss the geometrical structures of multipartite quantum systems based on complex projective schemes. In particular, I will explicitly construct multi-qubit states in terms of these schemes and also discuss…
An adiabatic cyclic evolution of control parameters of a quantum system ends up with a holonomic operation on the system, determined entirely by the geometry in the parameter space. The operation is given either by a simple phase factor (a…
This paper explores several aspects of the adiabatic quantum computation model. We first show a way that directly maps any arbitrary circuit in the standard quantum computing model to an adiabatic algorithm of the same depth. Specifically,…
The agenda of quantum algorithmic information theory, ordered `top-down,' is the quantum halting amplitude, followed by the quantum algorithmic information content, which in turn requires the theory of quantum computation. The fundamental…
The cluster state model for quantum computation [Phys. Rev. Lett. 86, 5188] outlines a scheme that allows one to use measurement on a large set of entangled quantum systems in what is known as a cluster state to undertake quantum…
An open question in quantum optics is how to manipulate and control complex quantum states in an experimentally feasible way. Here we present concepts for transformations of high-dimensional multi-photonic quantum systems. The proposals…
Future quantum computers are anticipated to be able to perform simulations of quantum many-body systems and quantum field theories that lie beyond the capabilities of classical computation. This will lead to new insights and predictions for…
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…
Quantum Computing (QC) refers to an emerging paradigm that inherits and builds with the concepts and phenomena of Quantum Mechanic (QM) with the significant potential to unlock a remarkable opportunity to solve complex and computationally…
Quantum graphs are commonly used as models of complex quantum systems, for example molecules, networks of wires, and states of condensed matter. We consider quantum statistics for indistinguishable spinless particles on a graph,…
Quantum computing has been a fascinating research field in quantum physics. Recent progresses motivate us to study in depth the universal quantum computing models (UQCM), which lie at the foundation of quantum computing and have tight…
Hamiltonian simulation is a promising application for quantum computers to achieve a quantum advantage. We present classical algorithms based on tensor network methods to optimize quantum circuits for this task. We show that, compared to…
We first prove a one-to-one correspondence between finding Hamiltonian cycles in a cubic planar graphs and finding trees with specific properties in dual graphs. Using this information, we construct an exact algorithm for finding…
Algorithmic approach is based on the assumption that any quantum evolution of many particle system can be simulated on a classical computer with the polynomial time and memory cost. Algorithms play the central role here but not the…
It is proposed to map the quantum information qubit not to individual spin 1/2 states, but to the collective spin states being eigenfunctions of the Hamiltonian including spin-spin interactions, which may be not small. Such an approach…
The general problem of finding the ground state energy of lattice Hamiltonians is known to be very hard, even for a quantum computer. We show here that this is the case even for translationally invariant systems. We also show that a quantum…
Many promising ideas for quantum computing demand the experimental ability to directly switch 'on' and 'off' a physical coupling between the component qubits. This is typically the key difficulty in implementation, and precludes quantum…
The main features of quantum computing are described in the framework of spin resonance methods. Stress is put on the fact that quantum computing is in itself nothing but a re-interpretation (fruitful indeed) of well-known concepts. The…