A computer is generally considered to be a universal computational\ndevice; i.e., it is believed able to simulate any physical computational\ndevice with a cost in computation time of at most a polynomial factor:\nIt is not clear whether this is still true when quantum mechanics is\ntaken ...
Algorithms for quantum computation: discrete logarithms and factoring. In Proc. 35th Annual Symposium on Foundations of Computer Science 124–134 (IEEE, 1994). Harrow, A. W., Hassidim,, A. & Lloyd, S. Quantum algorithm for linear systems of equations. Phys. Rev. Lett. 103, 150502 (2009)...
We present simple mappings between classical lattice models and quantum circuits, which provide a systematic formalism to obtain quantum algorithms to approximate partition functions of lattice models in certain complex-parameter regimes. We, e.g., present an efficient quantum algorithm for the six-vert...
Phase estimation algorithms are key protocols in quantum information processing. Besides applications in quantum computing, they can also be employed in metrology as they allow for fast extraction of information stored in the quantum state of a system. H
Achieve meaningful results from quantum computers through fully automated error suppression — no hardware expertise required.
We discuss the progress (or lack of it) that has been made in discovering algorithms for computation on a quantum computer. Some possible reasons are given for the paucity of quantum algorithms so far discovered, and a short survey is given of the state of the field. PACS: 03.67.Lx This...
By the end of this book, quantum algorithms will cease to be mystifying as you make this knowledge your asset and enter a new era of computation, where you have the power to shape the code of reality. Who is this book for? This book is for individuals familiar with algebra and ...
quantum computers have qubits with very low coherence times. Thus, quantum computation must finish before the computation collapses. In pursuit of having better results on near term noisy quantum computers, shorter depth circuits are desired. In one specific example, we optimised the quantum support ...
First we briefly introduce the notions of quantum computation (we refer for instance to Refs. [13], [14], [21] for more detailed introductions). A quantum state is a unit-norm vector in a Hilbert space, i.e., a complex inner-product space with completeness. In this paper, we consider...
OptimizationResultA base class for optimization results. ADMMOptimizationResultADMMOptimization Result. ADMMOptimizerAn implementation of the ADMM-based heuristic. ADMMParametersDefines a set of parameters for ADMM optimizer. ADMMStateInternal computation state of the ADMM implementation. ...