9 papers
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…
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…
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}\…
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…