TY - JOUR T1 - Implementing a Fast Unbounded Quantum Fanout Gate Using Power-Law Interactions JF - Phys. Rev. Research Y1 - 2022 A1 - Andrew Y. Guo A1 - Abhinav Deshpande A1 - Su-Kuan Chu A1 - Zachary Eldredge A1 - Przemyslaw Bienias A1 - Dhruv Devulapalli A1 - Yuan Su A1 - Andrew M. Childs A1 - Alexey V. Gorshkov AB -
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's algorithm to be performed on a D-dimensional lattice in time logarithmic in the number of qubits for interactions with α≤D. As a corollary, we show that power-law systems with α≤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.
VL - 4 UR - https://arxiv.org/abs/2007.00662 CP - L042016 U5 - https://doi.org/10.1103/PhysRevResearch.4.L042016 ER - TY - JOUR T1 - Destructive Error Interference in Product-Formula Lattice Simulation JF - Phys. Rev. Lett. Y1 - 2020 A1 - Minh C. Tran A1 - Su-Kuan Chu A1 - Yuan Su A1 - Andrew M. Childs A1 - Alexey V. Gorshkov AB -Quantum computers can efficiently simulate the dynamics of quantum systems. In this paper, we study the cost of digitally simulating the dynamics of several physically relevant systems using the first-order product formula algorithm. We show that the errors from different Trotterization steps in the algorithm can interfere destructively, yielding a much smaller error than previously estimated. In particular, we prove that the total error in simulating a nearest-neighbor interacting system of n sites for time t using the first-order product formula with r time slices is O(nt/r+nt3/r2) when nt2/r is less than a small constant. Given an error tolerance ε, the error bound yields an estimate of max{O(n2t/ε),O(n2t3/2/ε1/2)} for the total gate count of the simulation. The estimate is tighter than previous bounds and matches the empirical performance observed in Childs et al. [PNAS 115, 9456-9461 (2018)]. We also provide numerical evidence for potential improvements and conjecture an even tighter estimate for the gate count.
VL - 124 UR - https://arxiv.org/abs/1912.11047 CP - 220502 U5 - https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.124.220502 ER - TY - JOUR T1 - Photon pair condensation by engineered dissipation JF - Phys. Rev. Lett. Y1 - 2019 A1 - Ze-Pei Cian A1 - Guanyu Zhu A1 - Su-Kuan Chu A1 - Alireza Seif A1 - Wade DeGottardi A1 - Liang Jiang A1 - Mohammad Hafezi AB -Dissipation can usually induce detrimental decoherence in a quantum system. However, engineered dissipation can be used to prepare and stabilize coherent quantum many-body states. Here, we show that by engineering dissipators containing photon pair operators, one can stabilize an exotic dark state, which is a condensate of photon pairs with a phase-nematic order. In this system, the usual superfluid order parameter, i.e. single-photon correlation, is absent, while the photon pair correlation exhibits long-range order. Although the dark state is not unique due to multiple parity sectors, we devise an additional type of dissipators to stabilize the dark state in a particular parity sector via a diffusive annihilation process which obeys Glauber dynamics in an Ising model. Furthermore, we propose an implementation of these photon-pair dissipators in circuit-QED architecture.
VL - 123 UR - https://arxiv.org/abs/1904.00016 CP - 063602 U5 - 10.1103/PhysRevLett.123.063602 ER - TY - JOUR T1 - Scale-Invariant Continuous Entanglement Renormalization of a Chern Insulator JF - Phys. Rev. Lett Y1 - 2019 A1 - Su-Kuan Chu A1 - Guanyu Zhu A1 - James R. Garrison A1 - Zachary Eldredge A1 - Ana Valdés Curiel A1 - Przemyslaw Bienias A1 - I. B. Spielman A1 - Alexey V. Gorshkov AB -The multi-scale entanglement renormalization ansatz (MERA) postulates the existence of quantum circuits that renormalize entanglement in real space at different length scales. Chern insulators, however, cannot have scale-invariant discrete MERA circuits with finite bond dimension. In this Letter, we show that the continuous MERA (cMERA), a modified version of MERA adapted for field theories, possesses a fixed point wavefunction with nonzero Chern number. Additionally, it is well known that reversed MERA circuits can be used to prepare quantum states efficiently in time that scales logarithmically with the size of the system. However, state preparation via MERA typically requires the advent of a full-fledged universal quantum computer. In this Letter, we demonstrate that our cMERA circuit can potentially be realized in existing analog quantum computers, i.e., an ultracold atomic Fermi gas in an optical lattice with light-induced spin-orbit coupling.
VL - 122 UR - https://arxiv.org/abs/1807.11486 CP - 120502 U5 - https://doi.org/10.1103/PhysRevLett.122.120502 ER - TY - JOUR T1 - Two-Dimensional Dilaton Gravity Theory and Lattice Schwarzian Theory Y1 - 2018 A1 - Su-Kuan Chu A1 - Chen-Te Ma A1 - Chih-Hung Wu AB -