2007/10/31 by Dominik Janzing, Paweł Wocjan, Pawel Wocjan +1
Computer Science · Physics and Astronomy · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum and electron transport phenomena #quant-ph
paper · pdf · doi:10.1088/1367-2630/10/9/093004
19 pages, transition rules for the CA corrected
arxiv created 2007/12/14 · openalex publication_date 2008/09/01 · arxiv updated 2009/12/01 · openalex created_date 2020/11/23 · openalex updated_date 2026/07/30
In measurement-based quantum computation, quantum algorithms are implemented via sequences of measurements. We describe a translationally invariant finite-range interaction on a one-dimensional qudit chain and prove that a single-shot measurement of the energy of an appropriate computational basis state with respect to this Hamiltonian provides the output of any quantum circuit. The required measurement accuracy scales inverse polynomially with the size of the simulated quantum circuit. This shows that the implementation of energy measurements on generic qudit chains is as hard as the realization of quantum computation. Here, a ‘measurement’ is any procedure that samples from the spectral measurement induced by the observable and the state under consideration. As opposed to measurement-based quantum computation, the post-measurement state is irrelevant.