Related papers: Models of Quantum Turing machines
Geometry and dimensionality have played crucial roles in our understanding of the fundamental laws of nature, with examples ranging from curved space-time in general relativity to modern theories of quantum gravity. In quantum many-body…
We argue the feasibility to study the phase structure of a quantum physical system on quantum devices via adiabatic preparation of states. We introduce a novel method and successfully test it in application to the Schwinger model in the…
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.…
We develop the partitioning technique for quantum discrete systems. The graph consists of several subgraphs: a central graph and several branch graphs, with each branch graph being rooted by an individual node on the central one. We show…
Quantum computing employs controllable interactions to perform sequences of logical gates and entire algorithms on quantum registers. This paradigm has been widely explored, e.g., for simulating dynamics of manybody systems by decomposing…
We analyze a continuous-time quantum walk on a chimera graph, which is a graph of choice for designing quantum annealers, and we discover beautiful quantum-walk features such as localization that starkly distinguishes classical from quantum…
The existence of universal quantum computers has been theoretically well established. However, building up a real quantum computer system not only relies on the theory of universality, but also needs methods to satisfy requirements on other…
Quantum computation can be achieved by preparing an appropriate initial product state of qudits and then letting it evolve under a fixed Hamiltonian. The readout is made by measurement on individual qudits at some later time. This approach…
The capacity to custom tailor the properties of quantum matter and materials is a central requirement for enlarging their range of possible functionalities. A particularly promising route is the use of driving protocols to engineer specific…
We present an original model of paraconsistent Turing machines (PTMs), a generalization of the classical Turing machines model of computation using a paraconsistent logic. Next, we briefl y describe the standard models of quantum…
Simulating the time evolution of a physical system at quantum mechanical levels of detail -- known as Hamiltonian Simulation (HS) -- is an important and interesting problem across physics and chemistry. For this task, algorithms that run on…
A phenomenological Hamiltonian of a closed (i.e., unitary) quantum system is assumed to have an $N$ by $N$ real-matrix form composed of a unperturbed diagonal-matrix part $H^{(N)}_0$ and of a tridiagonal-matrix perturbation…
Quantum tomography is an important tool for the characterisation of quantum operations. In this paper, we present a framework of quantum tomography in fermionic systems. Compared with qubit systems, fermions obey the superselection rule,…
Yao (1993) proved that quantum Turing machines and uniformly generated quantum circuits are polynomially equivalent computational models: $t \geq n$ steps of a quantum Turing machine running on an input of length $n$ can be simulated by a…
In this dissertation we demonstrate that the continuous-time quantum walk models remain powerful for nontrivial graph structures. We consider two aspects of this problem. First, it is known that the standard Continuous-Time Quantum Walk…
The precise description of quantum nuclear fluctuations in atomistic modelling is possible by employing path integral techniques, which involve a considerable computational overhead due to the need of simulating multiple replicas of the…
We propose path integral description for quantum mechanical systems on compact graphs consisting of N segments of the same length. Provided the bulk Hamiltonian is segment-independent, scale-invariant boundary conditions given by…
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…
In this work, we present a theory for topological phases for quantum systems on tree graphs. Conventionally, topological phases of matter have been studied in regular lattices, but also in quasicrystals and amorphous settings. We consider…
Topology played an important role in physics research during the last few decades. In particular, the quantum geometric tensor that provides local information about topological properties has attracted much attention. It will reveal…