6 papers
Quantum generalizations of Glauber and Metropolis dynamics
András Gilyén, Chi-Fang Chen, Joao F. Doriguello +1
Classical Markov Chain Monte Carlo methods have been essential for simulating statistical physical systems and have proven well applicable to other systems with many degrees of fre…
Methods for Reducing Ancilla-Overhead in Block Encodings
Francisca Vasconcelos, András Gilyén
Block encodings are a fundamental primitive in quantum algorithms, but can often have large ancilla overhead. In this work, we introduce novel techniques for reducing this overhead…
A little bit of self-correction
Michael J. Kastoryano, Lasse B. Kristensen, Chi-Fang Chen +1
We investigate the emergence of stable subspaces in the low-temperature quantum thermal dynamics of finite spin chains. Our analysis reveals the existence of effective decoherence-…
A distillation-teleportation protocol for fault-tolerant QRAM
Alexander M. Dalzell, András Gilyén, Connor T. Hann +5
We present a protocol for fault-tolerantly implementing the logical quantum random access memory (QRAM) operation, given access to a specialized, noisy QRAM device. For coherently…
Myths around quantum computation before full fault tolerance: What no-go theorems rule out and what they don't
Zoltán Zimborás, Bálint Koczor, Zoë Holmes +19
In this perspective article, we revisit and critically evaluate prevailing viewpoints on the capabilities and limitations of near-term quantum computing and its potential transitio…
A Quantum Speed-Up for Approximating the Top Eigenvectors of a Matrix
Yanlin Chen, András Gilyén, Ronald de Wolf
Finding a good approximation of the top eigenvector of a given matrix is a basic and important computational problem, with many applications. We give two different…