33 citations · 44 across the 10 of their papers we have counts for
13 papers
Moving quantum sensors
Evan Zhang, Erfan Abbasgholinejad, Yu-Xin Wang +6
We investigate whether controlled motion of a quantum sensor offers a metrological advantage in a field-detection task. We consider a localized field of known strength occupyin…
Bosonic unstructured search: quantum enhancement without entanglement
Yu-Xin Wang, Erfan Abbasgholinejad, Supratik Sarkar +4
We consider unstructured search using multimode bosonic quantum systems under energy constraints. The task is to locate an unknown marked mode among possibilities using arbitra…
Ordering-Aware Theory of Trotter Error
Zhenning Liu, Zhi-Yuan Wei, Michael Foss-Feig +2
Product formulas are a basic tool for simulating quantum many-body dynamics, but a fundamental degree of freedom in their application---the ordering of Hamiltonian terms---has rema…
Low-depth fermion routing without ancillas
Nathan Constantinides, Jeffery Yu, Dhruv Devulapalli +6
Routing is the task of permuting qubits in such a way that quantum operations can be parallelized maximally, given constraints on the hardware geometry. When simulating fermions in…
Measuring gravitational lensing time delays with quantum information processing
Zhenning Liu, William DeRocco, Shiming Gu +6
The gravitational fields of astrophysical bodies bend the light around them, creating multiple paths along which light from a distant source can arrive at Earth. Measuring the diff…
Time Independence Does Not Limit Information Flow. I. The Free-Particle Case
Dong Yuan, Chao Yin, T. C. Mooney +3
The speed of information propagation in long-range interacting quantum systems is limited by Lieb-Robinson-type bounds, whose tightness can be established by finding specific quant…
Quantum Routing and Entanglement Dynamics Through Bottlenecks
Dhruv Devulapalli, Chao Yin, Andrew Y. Guo +4
To implement arbitrary quantum circuits in architectures with restricted interactions, one may effectively simulate all-to-all connectivity by routing quantum information. We consi…
Time Independence Does Not Limit Information Flow. II. The Case with Ancillas
T. C. Mooney, Dong Yuan, Adam Ehrenberg +3
While the impact of locality restrictions on quantum dynamics and algorithmic complexity has been well studied in the general case of time-dependent Hamiltonians, the capabilities…
Translation-Invariant Quantum Algorithms for Ordered Search are Optimal
Joseph Carolan, Andrew M. Childs, Matt Kovacs-Deak +1
Ordered search is the task of finding an item in an ordered list using comparison queries. The best exact classical algorithm for this fundamental problem uses $\lceil \log_{2}{n}\…
Optimal Routing Protocols for Reconfigurable Atom Arrays
Nathan Constantinides, Ali Fahimniya, Dhruv Devulapalli +5
Neutral atom arrays have emerged as a promising platform for both analog and digital quantum processing. Recently, devices capable of reconfiguring arrays during quantum processes…
Efficient preparation of Dicke states
Jeffery Yu, Sean R. Muleady, Yu-Xin Wang +3
We present an algorithm utilizing mid-circuit measurement and feedback that prepares Dicke states with polylogarithmically many ancillas and polylogarithmic depth. Our algorithm us…
Low-depth quantum symmetrization
Zhenning Liu, Andrew M. Childs, Daniel Gottesman
Quantum symmetrization is the task of transforming a non-strictly increasing list of integers into an equal superposition of all permutations of the list (or more generally, pe…
Discrete-query quantum algorithm for NAND trees
Andrew M. Childs, Richard Cleve, Stephen P. Jordan +1
Recently, Farhi, Goldstone, and Gutmann gave a quantum algorithm for evaluating NAND trees that runs in time O(sqrt(N log N)) in the Hamiltonian query model. In this note, we point…