Related papers: Quantum Circuit for Calculating Symmetrized Functi…
Quantum Boltzmann machine extends the classical Boltzmann machine learning to the quantum regime, which makes its power to simulate the quantum states beyond the classical probability distributions. We develop the BFGS algorithm to study…
Many quantum algorithms make use of oracles which evaluate classical functions on a superposition of inputs. In order to facilitate implementation, testing, and resource estimation of such algorithms, we present quantum circuits for…
We describe in detail a general strategy for implementing a conditional geometric phase between two spins. Combined with single-spin operations, this simple operation is a universal gate for quantum computation, in that any unitary…
The algebraic approach to quantum physics emphasizes the role played by the structure of the algebra of observables and its relation to the space of states. An important feature of this point of view is that subsystems can be described by…
This paper presents a connection between the quantum walk and the absolute mathematics. The quantum walk is a quantum counterpart of the classical random walk. We especially deal with the Grover walk on a graph. The Grover walk is a typical…
The search problem is to find a state satisfying certain properties out of a given set. Grover's algorithm drives a quantum computer from a prepared initial state to the target state and solves the problem quadratically faster than a…
This paper introduces a symbolic calculus to evaluate the output signals at the target line(s) of quantum computing subcircuits using controlled negations and controlled-Q gates, where Q represents the k-th root of [0 1; 1 0], the unitary…
We study ring of functions on the (classical and quantized) phase space of 2-dimensional BF theory with the gauge group $\mathrm{GL}_N$ coupled to a 1-dimensional quantum mechanics with global symmetry $\mathrm{GL}_K$. These functions are…
We review Grover's algorithm by means of a detailed geometrical interpretation and a worked out example. Some basic concepts of Quantum Mechanics and quantum circuits are also reviewed. This work is intended for non-specialists which have…
Grover's quantum algorithm for an unstructured search problem and the Count algorithm by Brassard et al. are generalized to the case when the initial state is arbitrarily and maximally entangled. This ansatz might be relevant with quantum…
We present a method that outputs a sequence of simple unitary operations to prepare a given quantum state that is a generalized coherent state. Our method takes as inputs the expectation values of some relevant observables on the state to…
We propose a method for quantum computation which uses control of spin-orbit coupling in a linear array of single electron quantum dots. Quantum gates are carried out by pulsing the exchange interaction between neighboring electron spins,…
The relation between Loop Quantum Gravity and Regge calculus has been pointed out many times in the literature. In particular the large spin asymptotics of the Barrett-Crane vertex amplitude is known to be related to the Regge action. In…
The steadily growing research interest in quantum computing - together with the accompanying technological advances in the realization of quantum hardware - fuels the development of meaningful real-world applications, as well as…
The soft breaking of gauge or other symmetries is the typical Quantum Field Theory phenomenon. In many cases one can apply the Stuckelberg procedure, which means introducing some additional field (or fields) and restore the gauge symmetry.…
Quantum algorithms to solve practical problems in quantum chemistry, materials science, and matrix inversion often involve a significant amount of arithmetic operations which act on a superposition of inputs. These have to be compiled to a…
The superpositional wave function oscillations for finite-time implementation of quantum algorithms modifies the desired interference required for quantum computing. We propose a scheme with trapped ultracold ion-pairs being qubits to…
Given a quantum algorithm, it is highly nontrivial to devise an efficient sequence of physical gates implementing the algorithm on real hardware and incorporating topological quantum error correction. In this paper, we present a first step…
We explore the relationship between renormalization group (RG) flow and error correction by constructing quantum algorithms that exactly recognize 1D symmetry-protected topological (SPT) phases protected by finite internal Abelian…
We build a quantum algorithm which uses the Grover quantum search procedure in order to sample the exact equilibrium distribution of a wide range of classical statistical mechanics systems. The algorithm is based on recently developed exact…