no code implementations • 12 Oct 2022 • Andrew M. Childs, Tongyang Li, Jin-Peng Liu, Chunhao Wang, Ruizhe Zhang

We also prove a $1/\epsilon^{1-o(1)}$ quantum lower bound for estimating normalizing constants, implying near-optimality of our quantum algorithms in $\epsilon$.

1 code implementation • 14 Jul 2020 • Daochen Wang, Xuchen You, Tongyang Li, Andrew M. Childs

Identifying the best arm of a multi-armed bandit is a central problem in bandit optimization.

1 code implementation • 29 Nov 2017 • Andrew M. Childs, Dmitri Maslov, Yunseong Nam, Neil J. Ross, Yuan Su

With quantum computers of significant size now on the horizon, we should understand how to best exploit their initially limited abilities.

Quantum Physics

4 code implementations • 19 Oct 2017 • Yunseong Nam, Neil J. Ross, Yuan Su, Andrew M. Childs, Dmitri Maslov

We develop and implement automated methods for optimizing quantum circuits of the size and type expected in quantum computations that outperform classical computers.

Quantum Physics Emerging Technologies

no code implementations • 15 Dec 2014 • Dominic W. Berry, Andrew M. Childs, Richard Cleve, Robin Kothari, Rolando D. Somma

We describe a simple, efficient method for simulating Hamiltonian dynamics on a quantum computer by approximating the truncated Taylor series of the evolution operator.

Quantum Physics

no code implementations • 16 Apr 2013 • Andrew M. Childs, Robin Kothari, Maris Ozols, Martin Roetteler

We study the quantum query complexity of the Boolean hidden shift problem.

no code implementations • 16 May 2012 • Andrew M. Childs, David Gosset, Zak Webb

A quantum walk is a time-homogeneous quantum-mechanical process on a graph defined by analogy to classical random walk.

Quantum Physics

1 code implementation • 27 Feb 2012 • Andrew M. Childs, Nathan Wiebe

We present a new approach to simulating Hamiltonian dynamics based on implementing linear combinations of unitary operations rather than products of unitary operations.

Quantum Physics

no code implementations • 12 Jun 2008 • Andrew M. Childs

In some of the earliest work on quantum mechanical computers, Feynman showed how to implement universal quantum computation by the dynamics of a time-independent Hamiltonian.

Quantum Physics

no code implementations • 15 Aug 2000 • Dave Bacon, Andrew M. Childs, Isaac L. Chuang, Julia Kempe, Debbie W. Leung, Xinlan Zhou

Although the conditions for performing arbitrary unitary operations to simulate the dynamics of a closed quantum system are well understood, the same is not true of the more general class of quantum operations (also known as superoperators) corresponding to the dynamics of open quantum systems.

Quantum Physics

Cannot find the paper you are looking for? You can
Submit a new open access paper.

Contact us on:
hello@paperswithcode.com
.
Papers With Code is a free resource with all data licensed under CC-BY-SA.