Related papers: One-way Quantum Computation - a tutorial introduct…
By encoding a qudit in a harmonic oscillator and investigating the infinite limit, we give an entirely new realization of continuous-variable quantum computation. The generalized Pauli group is generated by number and phase operators for…
Classical mechanics is presented here in a unary operator form, constructed using the binary multiplication and Poisson bracket operations that are given in a phase space formalism, then a Gibbs equilibrium state over this unary operator…
We briefly review various computational methods for the solution of optimization problems. First, several classical methods such as Metropolis algorithm and simulated annealing are discussed. We continue with a description of quantum…
This paper is a gentle but rigorous introduction to quantum computing intended for discrete mathematicians. Starting from a small set of assumptions on the behavior of quantum computing devices, we analyze their main characteristics,…
We propose a systematic scheme for the construction of graphs associated with binary stabilizer codes. The scheme is characterized by three main steps: first, the stabilizer code is realized as a codeword-stabilized (CWS) quantum code;…
Reducing the complexity of quantum algorithms to treat quantum chemistry problems is essential to demonstrate an eventual quantum advantage of Noisy-Intermediate Scale Quantum (NISQ) devices over their classical counterpart. Significant…
Some difficulties, both numerical and conceptual, of the method to compute one dimensional wave functions by numerically integrating the quantum Hamilton-Jacobi equation, presented in the paper mentioned in the title, are analyzed. The…
Experimental implementations of quantum computer architectures are now being investigated in many different physical settings. The full set of requirements that must be met to make quantum computing a reality in the laboratory [1] is…
Convenient and simple numerical techniques for performing quantum computations based on matrix representations of Hilbert space operators are presented and illustrated by various examples. The applications include the calculations of…
In former work, quantum computation has been shown to be a problem solving process essentially affected by both the reversible dynamics leading to the state before measurement, and the logical-mathematical constraints introduced by quantum…
The implementation and practicality of quantum algorithms highly hinge on the quality of operations within a quantum processor. Therefore, including realistic error models in quantum computing simulation platforms is crucial for testing…
The study of quantum walks has been shown to have a wide range of applications in areas such as artificial intelligence, the study of biological processes, and quantum transport. The quantum stochastic walk, which allows for incoherent…
There are many falsely intuitive introductions to quantum theory and quantum computation in a handwave. There are also numerous documents which teach those subjects in a mathematically sound manner. To my knowledge this paper is the…
Various algorithms have been developed to simulate quantum circuits on classical hardware. Among the most prominent are approaches based on \emph{stabilizer decompositions} and \emph{tensor network contraction}. In this work, we present a…
We present a pedagogical treatment of the formalism of continuous quantum measurement. Our aim is to show the reader how the equations describing such measurements are derived and manipulated in a direct manner. We also give elementary…
Quantum state estimation for continuously monitored dynamical systems involves assigning a quantum state to an individual system at some time, conditioned on the results of continuous observations. The quality of the estimation depends on…
We show that the various intermediate states appearing in the process of one-way computation at a given step of measurement are all equivalent modulo local unitary transformations. This implies, in particular, that all those intermediate…
An algorithm for quantum computing Hamiltonian cycles of simple, cubic, bipartite graphs is discussed. It is shown that it is possible to evolve a quantum computer into an entanglement of states which map onto the set of all possible paths…
We employ quantum circuit learning to simulate quantum field theories (QFTs). Typically, when simulating QFTs with quantum computers, we encounter significant challenges due to the technical limitations of quantum devices when implementing…
Any particular classical system and its quantum version are normally viewed as separate formulations that are strictly distinct. Our goal is to overcome the two separate languages and create a smooth and common procedure that provides a…