



@article {3490,
	title = {Efficiently verifiable quantum advantage on near-term analog quantum simulators},
	year = {2024},
	month = {3/13/2024},
	abstract = {<p>Existing schemes for demonstrating quantum computational advantage are subject to various practical restrictions, including the hardness of verification and challenges in experimental implementation. Meanwhile, analog quantum simulators have been realized in many experiments to study novel physics. In this work, we propose a quantum advantage protocol based on single-step Feynman-Kitaev verification of an analog quantum simulation, in which the verifier need only run an O(λ2)-time classical computation, and the prover need only prepare O(1) samples of a history state and perform O(λ2) single-qubit measurements, for a security parameter λ. We also propose a near-term feasible strategy for honest provers and discuss potential experimental realizations.</p>},
	url = {https://arxiv.org/abs/2403.08195},
	author = {Zhenning Liu and Dhruv Devulapalli and Dominik Hangleiter and Yi-Kai Liu and Alicia J. Koll{\'a}r and Alexey V. Gorshkov and Andrew M. Childs}
}
@article {2607,
	title = {Implementing a Fast Unbounded Quantum Fanout Gate Using Power-Law Interactions},
	journal = {Phys. Rev. Research},
	volume = {4},
	year = {2022},
	month = {10/27/2022},
	abstract = {<p>The standard circuit model for quantum computation presumes the ability to directly perform gates between arbitrary pairs of qubits, which is unlikely to be practical for large-scale experiments. Power-law interactions with strength decaying as 1/rα in the distance r provide an experimentally realizable resource for information processing, whilst still retaining long-range connectivity. We leverage the power of these interactions to implement a fast quantum fanout gate with an arbitrary number of targets. Our implementation allows the quantum Fourier transform (QFT) and Shor\&$\#$39;s algorithm to be performed on a D-dimensional lattice in time logarithmic in the number of qubits for interactions with α\&le;D. As a corollary, we show that power-law systems with α\&le;D are difficult to simulate classically even for short times, under a standard assumption that factoring is classically intractable. Complementarily, we develop a new technique to give a general lower bound, linear in the size of the system, on the time required to implement the QFT and the fanout gate in systems that are constrained by a linear light cone. This allows us to prove an asymptotically tighter lower bound for long-range systems than is possible with previously available techniques.\&nbsp;</p>},
	doi = {https://doi.org/10.1103/PhysRevResearch.4.L042016},
	url = {https://arxiv.org/abs/2007.00662},
	author = {Andrew Y. Guo and Abhinav Deshpande and Su-Kuan Chu and Zachary Eldredge and Przemyslaw Bienias and Dhruv Devulapalli and Yuan Su and Andrew M. Childs and Alexey V. Gorshkov}
}
