Efficient Algorithms for Universal Quantum Simulation

From MaRDI portal
Publication:2868433

DOI10.1007/978-3-642-38986-3_1zbMATH Open1406.68033arXiv1307.1498OpenAlexW3101733808WikidataQ59440995 ScholiaQ59440995MaRDI QIDQ2868433FDOQ2868433


Authors: Barry C. Sanders Edit this on Wikidata


Publication date: 17 December 2013

Published in: Reversible Computation (Search for Journal in Brave)

Abstract: A universal quantum simulator would enable efficient simulation of quantum dynamics by implementing quantum-simulation algorithms on a quantum computer. Specifically the quantum simulator would efficiently generate qubit-string states that closely approximate physical states obtained from a broad class of dynamical evolutions. I provide an overview of theoretical research into universal quantum simulators and the strategies for minimizing computational space and time costs. Applications to simulating many-body quantum simulation and solving linear equations are discussed.


Full work available at URL: https://arxiv.org/abs/1307.1498




Recommendations





Cited In (14)





This page was built for publication: Efficient Algorithms for Universal Quantum Simulation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2868433)