01769nas a2200217 4500008004100000024003400041245005000075210005000125260001300175490000600188520108800194653004301282653004301325653002701368653003101395100002101426700002301447700002501470700001901495856003701514 2023 eng d aReport number: LA-UR-22-2023700aAdvantages and limitations of quantum routing0 aAdvantages and limitations of quantum routing c2/1/20230 v43 a

The Swap gate is a ubiquitous tool for moving information on quantum hardware, yet it can be considered a classical operation because it does not entangle product states. Genuinely quantum operations could outperform Swap for the task of permuting qubits within an architecture, which we call routing. We consider quantum routing in two models: (1) allowing arbitrary two-qubit unitaries, or (2) allowing Hamiltonians with norm-bounded interactions. We lower bound the circuit depth or time of quantum routing in terms of spectral properties of graphs representing the architecture interaction constraints, and give a generalized upper bound for all simple connected n-vertex graphs. In particular, we give conditions for a superpolynomial classical-quantum routing separation, which exclude graphs with a small spectral gap and graphs of bounded degree. Finally, we provide examples of a quadratic separation between gate-based and Hamiltonian routing models with a constant number of local ancillas per qubit and of an Ω(n) speedup if we also allow fast local interactions.

10aData Structures and Algorithms (cs.DS)10aFOS: Computer and information sciences10aFOS: Physical sciences10aQuantum Physics (quant-ph)1 aBapat, Aniruddha1 aChilds, Andrew, M.1 aGorshkov, Alexey, V.1 aSchoute, Eddie uhttps://arxiv.org/abs/2206.0176601350nas a2200181 4500008004100000245004400041210004400085260001300129490000800142520083200150653002700982653003101009100003201040700002101072700002201093700001601115856003701131 2023 eng d00aLower Bounds on Quantum Annealing Times0 aLower Bounds on Quantum Annealing Times c4/5/20230 v1303 a

The adiabatic theorem provides sufficient conditions for the time needed to prepare a target ground state. While it is possible to prepare a target state much faster with more general quantum annealing protocols, rigorous results beyond the adiabatic regime are rare. Here, we provide such a result, deriving lower bounds on the time needed to successfully perform quantum annealing. The bounds are asymptotically saturated by three toy models where fast annealing schedules are known: the Roland and Cerf unstructured search model, the Hamming spike problem, and the ferromagnetic p-spin model. Our bounds demonstrate that these schedules have optimal scaling. Our results also show that rapid annealing requires coherent superpositions of energy eigenstates, singling out quantum coherence as a computational resource.

10aFOS: Physical sciences10aQuantum Physics (quant-ph)1 aGarcía-Pintos, Luis, Pedro1 aBrady, Lucas, T.1 aBringewatt, Jacob1 aLiu, Yi-Kai uhttps://arxiv.org/abs/2210.1568702055nas a2200241 4500008004100000245005300041210005200094260001300146490000800159520125800167653002701425653004201452653003901494653003101533653004701564653005201611100002201663700002101685700002201706700002001728700002801748856003701776 2023 eng d00aNon-Abelian eigenstate thermalization hypothesis0 aNonAbelian eigenstate thermalization hypothesis c4/6/20230 v1303 a

The eigenstate thermalization hypothesis (ETH) explains why chaotic quantum many-body systems thermalize internally if the Hamiltonian lacks symmetries. If the Hamiltonian conserves one quantity ("charge"), the ETH implies thermalization within a charge sector -- in a microcanonical subspace. But quantum systems can have charges that fail to commute with each other and so share no eigenbasis; microcanonical subspaces may not exist. Furthermore, the Hamiltonian will have degeneracies, so the ETH need not imply thermalization. We adapt the ETH to noncommuting charges by positing a non-Abelian ETH and invoking the approximate microcanonical subspace introduced in quantum thermodynamics. Illustrating with SU(2) symmetry, we apply the non-Abelian ETH in calculating local observables' time-averaged and thermal expectation values. In many cases, we prove, the time average thermalizes. However, we also find cases in which, under a physically reasonable assumption, the time average converges to the thermal average unusually slowly as a function of the global-system size. This work extends the ETH, a cornerstone of many-body physics, to noncommuting charges, recently a subject of intense activity in quantum thermodynamics.

10aFOS: Physical sciences10aHigh Energy Physics - Theory (hep-th)10aQuantum Gases (cond-mat.quant-gas)10aQuantum Physics (quant-ph)10aStatistical Mechanics (cond-mat.stat-mech)10aStrongly Correlated Electrons (cond-mat.str-el)1 aMurthy, Chaitanya1 aBabakhani, Arman1 aIniguez, Fernando1 aSrednicki, Mark1 aHalpern, Nicole, Yunger uhttps://arxiv.org/abs/2206.0531002547nas a2200205 4500008004100000245006500041210006400106260001400170490000900184520193000193653002702123653003102150100002002181700002202201700002302223700002202246700001702268700001902285856003702304 2023 eng d00aTime-energy uncertainty relation for noisy quantum metrology0 aTimeenergy uncertainty relation for noisy quantum metrology c12/5/20230 v4(4)3 a

Detection of weak forces and precise measurement of time are two of the many applications of quantum metrology to science and technology. We consider a quantum system initialized in a pure state and whose evolution is goverened by a Hamiltonian H; a measurement can later estimate the time t for which the system has evolved. In this work, we introduce and study a fundamental trade-off which relates the amount by which noise reduces the accuracy of a quantum clock to the amount of information about the energy of the clock that leaks to the environment. Specifically, we consider an idealized scenario in which Alice prepares an initial pure state of the clock, allows the clock to evolve for a time t that is not precisely known, and then transmits the clock through a noisy channel to Bob. The environment (Eve) receives any information that is lost. We prove that Bob's loss of quantum Fisher information (QFI) about t is equal to Eve's gain of QFI about a complementary energy parameter. We also prove a more general trade-off that applies when Bob and Eve wish to estimate the values of parameters associated with two non-commuting observables. We derive the necessary and sufficient conditions for the accuracy of the clock to be unaffected by the noise. These are a subset of the Knill-Laflamme error-correction conditions; states satisfying these conditions are said to form a metrological code. We provide a scheme to construct metrological codes in the stabilizer formalism. We show that there are metrological codes that cannot be written as a quantum error-correcting code with similar distance in which the Hamiltonian acts as a logical operator, potentially offering new schemes for constructing states that do not lose any sensitivity upon application of a noisy channel. We discuss applications of our results to sensing using a many-body state subject to erasure or amplitude-damping noise.

10aFOS: Physical sciences10aQuantum Physics (quant-ph)1 aFaist, Philippe1 aWoods, Mischa, P.1 aAlbert, Victor, V.1 aRenes, Joseph, M.1 aEisert, Jens1 aPreskill, John uhttps://arxiv.org/abs/2207.1370702622nas a2200253 4500008004100000020002200041022001400063245012000077210006900197260001300266300001400279490000800293520178700301653003702088653004302125653002702168653003102195100002102226700002502247700001902272700001902291700002102310856003702331 2022 eng d a978-3-95977-237-2 a1868-896900aApproximating Output Probabilities of Shallow Quantum Circuits which are Geometrically-local in any Fixed Dimension0 aApproximating Output Probabilities of Shallow Quantum Circuits w c4/7/2022 a9:1--9:170 v2323 a

We present a classical algorithm that, for any D-dimensional geometrically-local, quantum circuit C of polylogarithmic-depth, and any bit string x∈0,1n, can compute the quantity |<x|C|0⊗n>|2 to within any inverse-polynomial additive error in quasi-polynomial time, for any fixed dimension D. This is an extension of the result [CC21], which originally proved this result for D=3. To see why this is interesting, note that, while the D=1 case of this result follows from standard use of Matrix Product States, known for decades, the D=2 case required novel and interesting techniques introduced in [BGM19]. Extending to the case D=3 was even more laborious and required further new techniques introduced in [CC21]. Our work here shows that, while handling each new dimension has historically required a new insight, and fixed algorithmic primitive, based on known techniques for D≤3, we can now handle any fixed dimension D>3.
Our algorithm uses the Divide-and-Conquer framework of [CC21] to approximate the desired quantity via several instantiations of the same problem type, each involving D-dimensional circuits on about half the number of qubits as the original. This division step is then applied recursively, until the width of the recursively decomposed circuits in the Dth dimension is so small that they can effectively be regarded as (D−1)-dimensional problems by absorbing the small width in the Dth dimension into the qudit structure at the cost of a moderate increase in runtime. The main technical challenge lies in ensuring that the more involved portions of the recursive circuit decomposition and error analysis from [CC21] still hold in higher dimensions, which requires small modifications to the analysis in some places.

10aComputational Complexity (cs.CC)10aFOS: Computer and information sciences10aFOS: Physical sciences10aQuantum Physics (quant-ph)1 aDontha, Suchetan1 aTan, Shi, Jie Samuel1 aSmith, Stephen1 aChoi, Sangheon1 aCoudron, Matthew uhttps://arxiv.org/abs/2202.0834902524nas a2200193 4500008004100000245007700041210006900118260001400187520188800201653004302089653002702132653003102159653003302190100001602223700001602239700001902255700001902274856003702293 2022 eng d00aArline Benchmarks: Automated Benchmarking Platform for Quantum Compilers0 aArline Benchmarks Automated Benchmarking Platform for Quantum Co c3/28/20223 a

Efficient compilation of quantum algorithms is vital in the era of Noisy Intermediate-Scale Quantum (NISQ) devices. While multiple open-source quantum compilation and circuit optimization frameworks are available, e.g. IBM Qiskit, CQC Tket, Google Cirq, Rigetti Quilc, PyZX, their relative performance is not always clear to a quantum programmer. The growth of complexity and diversity of quantum circuit compilation algorithms creates a demand for a dedicated tool for cross-benchmarking and profiling of inner workflow of the quantum compilation stack. We present an open-source software package, Arline Benchmarks, that is designed to perform automated benchmarking of quantum compilers with the focus on NISQ applications. The name "Arline" was given in honour of Arline Greenbaum Feynman, the first wife of Richard Feynman, the pioneer of quantum computing. We compared several quantum compilation frameworks based on a set of important metrics such as post-optimization gate counts, circuit depth, hardware-dependent circuit cost function, compiler run time etc. with a detailed analysis of metrics for each compilation stage. We performed a variety of compiler tests for random circuits and structured quantum algorithms (VQE, Trotter decomposition, Grover search, Option Pricing via Amplitude Estimation) for several popular quantum hardware architectures. Leveraging cross-platform functionality of Arline, we propose a concept of composite compilation pipeline that combines compiler-specific circuit optimization subroutines in a single compilation stack and finds an optimized sequence of compilation passes. By providing detailed insights into the compilation flow of quantum compilers, Arline Benchmarks offers a valuable toolkit for quantum computing researchers and software developers to gain additional insights into compilers' characteristics.

10aFOS: Computer and information sciences10aFOS: Physical sciences10aQuantum Physics (quant-ph)10aSoftware Engineering (cs.SE)1 aKharkov, Y.1 aIvanova, A.1 aMikhantiev, E.1 aKotelnikov, A. uhttps://arxiv.org/abs/2202.1402500958nas a2200157 4500008004100000245004700041210004600088260001500134520045900149653004300608653002700651653003100678653003100709100002300740856003700763 2022 eng d00aBosonic coding: introduction and use cases0 aBosonic coding introduction and use cases c11/10/20223 a

Bosonic or continuous-variable coding is a field concerned with robust quantum information processing and communication with electromagnetic signals or mechanical modes. I review bosonic quantum memories, characterizing them as either bosonic stabilizer or bosonic Fock-state codes. I then enumerate various applications of bosonic encodings, four of which circumvent no-go theorems due to the intrinsic infinite-dimensionality of bosonic systems.

10aFOS: Computer and information sciences10aFOS: Physical sciences10aInformation Theory (cs.IT)10aQuantum Physics (quant-ph)1 aAlbert, Victor, V. uhttps://arxiv.org/abs/2211.0571402469nas a2200217 4500008004100000245001900041210001900060260001400079520185900093653003401952653004301986653002702029653003102056100002602087700001902113700001702132700002502149700002202174700001802196856003702214 2022 eng d00aBosonic Qiskit0 aBosonic Qiskit c9/22/20223 a

The practical benefits of hybrid quantum information processing hardware that contains continuous-variable objects (bosonic modes such as mechanical or electromagnetic oscillators) in addition to traditional (discrete-variable) qubits have recently been demonstrated by experiments with bosonic codes that reach the break-even point for quantum error correction and by efficient Gaussian boson sampling simulation of the Franck-Condon spectra of triatomic molecules that is well beyond the capabilities of current qubit-only hardware. The goal of this Co-design Center for Quantum Advantage (C2QA) project is to develop an instruction set architecture (ISA) for hybrid qubit/bosonic mode systems that contains an inventory of the fundamental operations and measurements that are possible in such hardware. The corresponding abstract machine model (AMM) would also contain a description of the appropriate error models associated with the gates, measurements and time evolution of the hardware. This information has been implemented as an extension of Qiskit. Qiskit is an opensource software development toolkit (SDK) for simulating the quantum state of a quantum circuit on a system with Python 3.7+ and for running the same circuits on prototype hardware within the IBM Quantum Lab. We introduce the Bosonic Qiskit software to enable the simulation of hybrid qubit/bosonic systems using the existing Qiskit software development kit. This implementation can be used for simulating new hybrid systems, verifying proposed physical systems, and modeling systems larger than can currently be constructed. We also cover tutorials and example use cases included within the software to study Jaynes- Cummings models, bosonic Hubbard models, plotting Wigner functions and animations, and calculating maximum likelihood estimations using Wigner functions.

10aEmerging Technologies (cs.ET)10aFOS: Computer and information sciences10aFOS: Physical sciences10aQuantum Physics (quant-ph)1 aStavenger, Timothy, J1 aCrane, Eleanor1 aSmith, Kevin1 aKang, Christopher, T1 aGirvin, Steven, M1 aWiebe, Nathan uhttps://arxiv.org/abs/2209.1115301277nas a2200157 4500008004100000245005500041210005500096260001400151520078300165653002700948653003100975100002101006700002301027700003201050856003701082 2022 eng d00aBounding the Minimum Time of a Quantum Measurement0 aBounding the Minimum Time of a Quantum Measurement c9/13/20223 a

Measurements take a singular role in quantum theory. While they are often idealized as an instantaneous process, this is in conflict with all other physical processes in nature. In this Letter, we adopt a standpoint where the interaction with an environment is a crucial ingredient for the occurrence of a measurement. Within this framework, we derive lower bounds on the time needed for a measurement to occur. Our bound scales proportionally to the change in entropy of the measured system, and inversely proportional to the number of possible measurement outcomes and the interaction strength driving the measurement. We evaluate our bound in two examples where the environment is modelled by bosonic modes and the measurement apparatus is modelled by spins or bosons.

10aFOS: Physical sciences10aQuantum Physics (quant-ph)1 aShettell, Nathan1 aCentrone, Federico1 aGarcía-Pintos, Luis, Pedro uhttps://arxiv.org/abs/2209.0624802685nas a2200253 4500008004100000245007700041210006900118260001400187520182700201653002102028653002702049653004202076653003502118653003002153653003102183653005202214100002302266700001602289700002102305700002202326700003002348700001602378856003702394 2022 eng d00aCodimension-2 defects and higher symmetries in (3+1)D topological phases0 aCodimension2 defects and higher symmetries in 31D topological ph c8/15/20223 a

(3+1)D topological phases of matter can host a broad class of non-trivial topological defects of codimension-1, 2, and 3, of which the well-known point charges and flux loops are special cases. The complete algebraic structure of these defects defines a higher category, and can be viewed as an emergent higher symmetry. This plays a crucial role both in the classification of phases of matter and the possible fault-tolerant logical operations in topological quantum error correcting codes. In this paper, we study several examples of such higher codimension defects from distinct perspectives. We mainly study a class of invertible codimension-2 topological defects, which we refer to as twist strings. We provide a number of general constructions for twist strings, in terms of gauging lower dimensional invertible phases, layer constructions, and condensation defects. We study some special examples in the context of Z2 gauge theory with fermionic charges, in Z2×Z2 gauge theory with bosonic charges, and also in non-Abelian discrete gauge theories based on dihedral (Dn) and alternating (A6) groups. The intersection between twist strings and Abelian flux loops sources Abelian point charges, which defines an H4 cohomology class that characterizes part of an underlying 3-group symmetry of the topological order. The equations involving background gauge fields for the 3-group symmetry have been explicitly written down for various cases. We also study examples of twist strings interacting with non-Abelian flux loops (defining part of a non-invertible higher symmetry), examples of non-invertible codimension-2 defects, and examples of interplay of codimension-2 defects with codimension-1 defects. We also find an example of geometric, not fully topological, twist strings in (3+1)D A6 gauge theory.

10aFOS: Mathematics10aFOS: Physical sciences10aHigh Energy Physics - Theory (hep-th)10aMathematical Physics (math-ph)10aQuantum Algebra (math.QA)10aQuantum Physics (quant-ph)10aStrongly Correlated Electrons (cond-mat.str-el)1 aBarkeshli, Maissam1 aChen, Yu-An1 aHuang, Sheng-Jie1 aKobayashi, Ryohei1 aTantivasadakarn, Nathanan1 aZhu, Guanyu uhttps://arxiv.org/abs/2208.0736701667nas a2200157 4500008004100000245007000041210006800111260001400179520117400193653002701367653003101394100001601425700001801441700001301459856003701472 2022 eng d00aComputational self-testing of multi-qubit states and measurements0 aComputational selftesting of multiqubit states and measurements c1/31/20223 a

Self-testing is a fundamental technique within quantum information theory that allows a classical verifier to force (untrusted) quantum devices to prepare certain states and perform certain measurements on them. The standard approach assumes at least two spatially separated devices. Recently, Metger and Vidick [Quantum, 2021] showed that a single EPR pair of a single quantum device can be self-tested under standard computational assumptions. In this work, we generalize their techniques to give the first protocol that self-tests N EPR pairs and measurements in the single-device setting under the same computational assumptions. We show that our protocol can be passed with probability negligibly close to 1 by an honest quantum device using poly(N) resources. Moreover, we show that any quantum device that fails our protocol with probability at most ϵ must be poly(N,ϵ)-close to being honest in the appropriate sense. In particular, a simplified version of our protocol is the first that can efficiently certify an arbitrary number of qubits of a cloud quantum computer, on which we cannot enforce spatial separation, using only classical communication.

10aFOS: Physical sciences10aQuantum Physics (quant-ph)1 aFu, Honghao1 aWang, Daochen1 aZhao, Qi uhttps://arxiv.org/abs/2201.1343001840nas a2200253 4500008004100000245006100041210006000102260001400162520102500176653002701201653003901228653003101267653004701298653005201345100001401397700001301411700001701424700002301441700002501464700001801489700001801507700002401525856003701549 2022 eng d00aContinuous Symmetry Breaking in a Trapped-Ion Spin Chain0 aContinuous Symmetry Breaking in a TrappedIon Spin Chain c11/2/20223 a

One-dimensional systems exhibiting a continuous symmetry can host quantum phases of matter with true long-range order only in the presence of sufficiently long-range interactions. In most physical systems, however, the interactions are short-ranged, hindering the emergence of such phases in one dimension. Here we use a one-dimensional trapped-ion quantum simulator to prepare states with long-range spin order that extends over the system size of up to 23 spins and is characteristic of the continuous symmetry-breaking phase of matter. Our preparation relies on simultaneous control over an array of tightly focused individual-addressing laser beams, generating long-range spin-spin interactions. We also observe a disordered phase with frustrated correlations. We further study the phases at different ranges of interaction and the out-of-equilibrium response to symmetry-breaking perturbations. This work opens an avenue to study new quantum phases and out-of-equilibrium dynamics in low-dimensional systems.

10aFOS: Physical sciences10aQuantum Gases (cond-mat.quant-gas)10aQuantum Physics (quant-ph)10aStatistical Mechanics (cond-mat.stat-mech)10aStrongly Correlated Electrons (cond-mat.str-el)1 aFeng, Lei1 aKatz, Or1 aHaack, Casey1 aMaghrebi, Mohammad1 aGorshkov, Alexey, V.1 aGong, Zhexuan1 aCetina, Marko1 aMonroe, Christopher uhttps://arxiv.org/abs/2211.0127501776nas a2200181 4500008004100000245004200041210004100083260001400124520125200138653002701390653003101417100002301448700002301471700002001494700002201514700002101536856003701557 2022 eng d00aContinuous-Variable Shadow Tomography0 aContinuousVariable Shadow Tomography c11/9/20223 a

Shadow tomography is a framework for constructing succinct descriptions of quantum states, called classical shadows, with powerful methods to bound the estimators used. We recast existing experimental protocols for continuous-variable tomography in the classical-shadow framework, obtaining rigorous bounds on the sample complexity for estimating density matrices from these protocols. We analyze the efficiency of homodyne, heterodyne, photon number resolving (PNR), and photon-parity protocols. To reach a desired precision on the classical shadow of an N-photon density matrix with a high probability, we show that homodyne detection requires an order O(N5) measurements in the worst case, whereas PNR and photon-parity detection require O(N4) measurements in the worst case (both up to logarithmic corrections). We benchmark these results against numerical simulation as well as experimental data from optical homodyne experiments. We find that numerical and experimental homodyne tomography significantly outperforms our bounds, exhibiting a more typical scaling of the number of measurements that is close to linear in N. We extend our single-mode results to an efficient construction of multimode shadows based on local measurements.

10aFOS: Physical sciences10aQuantum Physics (quant-ph)1 aGandhari, Srilekha1 aAlbert, Victor, V.1 aGerrits, Thomas1 aTaylor, Jacob, M.1 aGullans, Michael uhttps://arxiv.org/abs/2211.0514901282nas a2200181 4500008004100000245008800041210006900129260001300198520068100211653002700892653003100919100002900950700002000979700001900999700002201018700002301040856003701063 2022 eng d00aConvex optimization for non-equilibrium steady states on a hybrid quantum processor0 aConvex optimization for nonequilibrium steady states on a hybrid c4/7/20223 a

Finding the transient and steady state properties of open quantum systems is a central problem in various fields of quantum technologies. Here, we present a quantum-assisted algorithm to determine the steady states of open system dynamics. By reformulating the problem of finding the fixed point of Lindblad dynamics as a feasibility semi-definite program, we bypass several well known issues with variational quantum approaches to solving for steady states. We demonstrate that our hybrid approach allows us to estimate the steady states of higher dimensional open quantum systems and discuss how our method can find multiple steady states for systems with symmetries.

10aFOS: Physical sciences10aQuantum Physics (quant-ph)1 aLau, Jonathan, Wei Zhong1 aLim, Kian, Hwee1 aBharti, Kishor1 aKwek, Leong-Chuan1 aVinjanampathy, Sai uhttps://arxiv.org/abs/2204.0320301033nas a2200193 4500008004100000245005300041210005300094260001300147520041400160653002700574653004200601653002900643653003100672653005200703100001400755700001700769700001600786856003700802 2022 eng d00aDeconfinement and Error Thresholds in Holography0 aDeconfinement and Error Thresholds in Holography c2/9/20223 a

We study the error threshold properties of holographic quantum error-correcting codes. We demonstrate that holographic CFTs admit an algebraic threshold, which is related to the confinement-deconfinement phase transition. We then apply geometric intuition from holography and the Hawking-Page phase transition to motivate the CFT result, and comment on potential extensions to other confining theories.

10aFOS: Physical sciences10aHigh Energy Physics - Theory (hep-th)10aNuclear Theory (nucl-th)10aQuantum Physics (quant-ph)10aStrongly Correlated Electrons (cond-mat.str-el)1 aBao, Ning1 aCao, Charles1 aZhu, Guanyu uhttps://arxiv.org/abs/2202.0471001214nas a2200193 4500008004100000245008100041210006900122260001400191520059300205653003700798653002700835653003100862100001300893700001400906700002100920700002400941700001800965856003700983 2022 eng d00aDemonstration of three- and four-body interactions between trapped-ion spins0 aDemonstration of three and fourbody interactions between trapped c9/12/20223 a

Quantum processors use the native interactions between effective spins to simulate Hamiltonians or execute quantum gates. In most processors, the native interactions are pairwise, limiting the efficiency of controlling entanglement between many qubits. Here we experimentally demonstrate a new class of native interactions between trapped-ion qubits, extending conventional pairwise interactions to higher order. We realize three- and four-body spin interactions as examples, showing that high-order spin polynomials may serve as a new toolbox for quantum information applications.

10aAtomic Physics (physics.atom-ph)10aFOS: Physical sciences10aQuantum Physics (quant-ph)1 aKatz, Or1 aFeng, Lei1 aRisinger, Andrew1 aMonroe, Christopher1 aCetina, Marko uhttps://arxiv.org/abs/2209.0569101903nas a2200193 4500008004100000245006000041210006000101260001400161520128300175653004301458653002701501653002901528653003401557653003101591100001501622700002001637700001501657856003701672 2022 eng d00aDifferentiable Quantum Programming with Unbounded Loops0 aDifferentiable Quantum Programming with Unbounded Loops c11/8/20223 a

The emergence of variational quantum applications has led to the development of automatic differentiation techniques in quantum computing. Recently, Zhu et al. (PLDI 2020) have formulated differentiable quantum programming with bounded loops, providing a framework for scalable gradient calculation by quantum means for training quantum variational applications. However, promising parameterized quantum applications, e.g., quantum walk and unitary implementation, cannot be trained in the existing framework due to the natural involvement of unbounded loops. To fill in the gap, we provide the first differentiable quantum programming framework with unbounded loops, including a newly designed differentiation rule, code transformation, and their correctness proof. Technically, we introduce a randomized estimator for derivatives to deal with the infinite sum in the differentiation of unbounded loops, whose applicability in classical and probabilistic programming is also discussed. We implement our framework with Python and Q#, and demonstrate a reasonable sample efficiency. Through extensive case studies, we showcase an exciting application of our framework in automatically identifying close-to-optimal parameters for several parameterized quantum applications.

10aFOS: Computer and information sciences10aFOS: Physical sciences10aMachine Learning (cs.LG)10aProgramming Languages (cs.PL)10aQuantum Physics (quant-ph)1 aFang, Wang1 aYing, Mingsheng1 aWu, Xiaodi uhttps://arxiv.org/abs/2211.0450701894nas a2200193 4500008004100000245005300041210005200094260001400146520125500160653006101415653002701476653003501503653003101538100002901569700002001598700002001618700002501638856003701663 2022 eng d00aDisordered Lieb-Robinson bounds in one dimension0 aDisordered LiebRobinson bounds in one dimension c8/10/20223 a

By tightening the conventional Lieb-Robinson bounds to better handle systems which lack translation invariance, we determine the extent to which "weak links" suppress operator growth in disordered one-dimensional spin chains. In particular, we prove that ballistic growth is impossible when the distribution of coupling strengths μ(J) has a sufficiently heavy tail at small J, and identify the correct dynamical exponent to use instead. Furthermore, through a detailed analysis of the special case in which the couplings are genuinely random and independent, we find that the standard formulation of Lieb-Robinson bounds is insufficient to capture the complexity of the dynamics -- we must distinguish between bounds which hold for all sites of the chain and bounds which hold for a subsequence of sites, and we show by explicit example that these two can have dramatically different behaviors. All the same, our result for the dynamical exponent is tight, in that we prove by counterexample that there cannot exist any Lieb-Robinson bound with a smaller exponent. We close by discussing the implications of our results, both major and minor, for numerous applications ranging from quench dynamics to the structure of ground states.

10aDisordered Systems and Neural Networks (cond-mat.dis-nn)10aFOS: Physical sciences10aMathematical Physics (math-ph)10aQuantum Physics (quant-ph)1 aBaldwin, Christopher, L.1 aEhrenberg, Adam1 aGuo, Andrew, Y.1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/2208.0550902428nas a2200217 4500008004100000245010600041210006900147260001400216520171900230653004301949653002701992653002902019653003102048100001702079700001502096700001302111700001702124700001602141700001602157856003702173 2022 eng d00aEfficient and practical quantum compiler towards multi-qubit systems with deep reinforcement learning0 aEfficient and practical quantum compiler towards multiqubit syst c4/14/20223 a

Efficient quantum compiling tactics greatly enhance the capability of quantum computers to execute complicated quantum algorithms. Due to its fundamental importance, a plethora of quantum compilers has been designed in past years. However, there are several caveats to current protocols, which are low optimality, high inference time, limited scalability, and lack of universality. To compensate for these defects, here we devise an efficient and practical quantum compiler assisted by advanced deep reinforcement learning (RL) techniques, i.e., data generation, deep Q-learning, and AQ* search. In this way, our protocol is compatible with various quantum machines and can be used to compile multi-qubit operators. We systematically evaluate the performance of our proposal in compiling quantum operators with both inverse-closed and inverse-free universal basis sets. In the task of single-qubit operator compiling, our proposal outperforms other RL-based quantum compilers in the measure of compiling sequence length and inference time. Meanwhile, the output solution is near-optimal, guaranteed by the Solovay-Kitaev theorem. Notably, for the inverse-free universal basis set, the achieved sequence length complexity is comparable with the inverse-based setting and dramatically advances previous methods. These empirical results contribute to improving the inverse-free Solovay-Kitaev theorem. In addition, for the first time, we demonstrate how to leverage RL-based quantum compilers to accomplish two-qubit operator compiling. The achieved results open an avenue for integrating RL with quantum compiling to unify efficiency and practicality and thus facilitate the exploration of quantum advantages.

10aFOS: Computer and information sciences10aFOS: Physical sciences10aMachine Learning (cs.LG)10aQuantum Physics (quant-ph)1 aChen, Qiuhao1 aDu, Yuxuan1 aZhao, Qi1 aJiao, Yuling1 aLu, Xiliang1 aWu, Xingyao uhttps://arxiv.org/abs/2204.0690401455nas a2200205 4500008004100000245006000041210005900101260001500160520078600175653002100961653002700982653003501009653003001044653003101074653005201105100001601157700002501173700001401198856003701212 2022 eng d00aError-correcting codes for fermionic quantum simulation0 aErrorcorrecting codes for fermionic quantum simulation c10/16/20223 a

We provide ways to simulate fermions by qubits on 2d lattices using Z2 gauge theories (stabilizer codes). By studying the symplectic automorphisms of the Pauli module over the Laurent polynomial ring, we develop a systematic way to increase the code distances of stabilizer codes. We identify a family of stabilizer codes that can be used to simulate fermions with code distances of d=2,3,4,5,6,7 such that any ⌊d−12⌋-qubit error can be corrected. In particular, we demonstrate three stabilizer codes with code distances of d=3, d=4, and d=5, respectively, with all stabilizers and logical operators shown explicitly. The syndromes for all Pauli errors are provided. Finally, we introduce a syndrome-matching method to compute code distances numerically.

10aFOS: Mathematics10aFOS: Physical sciences10aMathematical Physics (math-ph)10aQuantum Algebra (math.QA)10aQuantum Physics (quant-ph)10aStrongly Correlated Electrons (cond-mat.str-el)1 aChen, Yu-An1 aGorshkov, Alexey, V.1 aXu, Yijia uhttps://arxiv.org/abs/2210.0841101498nas a2200301 4500008004100000245006800041210006800109260001400177520060600191653002700797653004400824653003100868100001700899700001600916700002500932700001800957700001300975700001800988700001901006700002101025700001401046700002201060700001601082700001901098700001801117700002401135856003701159 2022 eng d00aExperimental Implementation of an Efficient Test of Quantumness0 aExperimental Implementation of an Efficient Test of Quantumness c9/28/20223 a

A test of quantumness is a protocol where a classical user issues challenges to a quantum device to determine if it exhibits non-classical behavior, under certain cryptographic assumptions. Recent attempts to implement such tests on current quantum computers rely on either interactive challenges with efficient verification, or non-interactive challenges with inefficient (exponential time) verification. In this paper, we execute an efficient non-interactive test of quantumness on an ion-trap quantum computer. Our results significantly exceed the bound for a classical device's success.

10aFOS: Physical sciences10aOther Condensed Matter (cond-mat.other)10aQuantum Physics (quant-ph)1 aLewis, Laura1 aZhu, Daiwei1 aGheorghiu, Alexandru1 aNoel, Crystal1 aKatz, Or1 aHarraz, Bahaa1 aWang, Qingfeng1 aRisinger, Andrew1 aFeng, Lei1 aBiswas, Debopriyo1 aEgan, Laird1 aVidick, Thomas1 aCetina, Marko1 aMonroe, Christopher uhttps://arxiv.org/abs/2209.1431602003nas a2200217 4500008004100000245007300041210006900114260001300183520129800196653002701494653003101521653004701552100002001599700002201619700002101641700001601662700001801678700002401696700002801720856003701748 2022 eng d00aExperimental observation of thermalisation with noncommuting charges0 aExperimental observation of thermalisation with noncommuting cha c2/9/20223 a

Quantum simulators have recently enabled experimental observations of quantum many-body systems' internal thermalisation. Often, the global energy and particle number are conserved, and the system is prepared with a well-defined particle number - in a microcanonical subspace. However, quantum evolution can also conserve quantities, or charges, that fail to commute with each other. Noncommuting charges have recently emerged as a subfield at the intersection of quantum thermodynamics and quantum information. Until now, this subfield has remained theoretical. We initiate the experimental testing of its predictions, with a trapped-ion simulator. We prepare 6-15 spins in an approximate microcanonical subspace, a generalisation of the microcanonical subspace for accommodating noncommuting charges, which cannot necessarily have well-defined nontrivial values simultaneously. We simulate a Heisenberg evolution using laser-induced entangling interactions and collective spin rotations. The noncommuting charges are the three spin components. We find that small subsystems equilibrate to near a recently predicted non-Abelian thermal state. This work bridges quantum many-body simulators to the quantum thermodynamics of noncommuting charges, whose predictions can now be tested.

10aFOS: Physical sciences10aQuantum Physics (quant-ph)10aStatistical Mechanics (cond-mat.stat-mech)1 aKranzl, Florian1 aLasek, Aleksander1 aJoshi, Manoj, K.1 aKalev, Amir1 aBlatt, Rainer1 aRoos, Christian, F.1 aHalpern, Nicole, Yunger uhttps://arxiv.org/abs/2202.0465201749nas a2200169 4500008004100000245009500041210006900136260001400205520115200219653002701371653003101398653005201429100001701481700002101498700002301519856003701542 2022 eng d00aExtracting Wilson loop operators and fractional statistics from a single bulk ground state0 aExtracting Wilson loop operators and fractional statistics from  c9/28/20223 a

An essential aspect of topological phases of matter is the existence of Wilson loop operators that keep the ground state subspace invariant. Here we present and implement an unbiased numerical optimization scheme to systematically find the Wilson loop operators given a single ground state wave function of a gapped Hamiltonian on a disk. We then show how these Wilson loop operators can be cut and glued through further optimization to give operators that can create, move, and annihilate anyon excitations. We subsequently use these operators to determine the braiding statistics and topological twists of the anyons, yielding a way to fully extract topological order from a single wave function. We apply our method to the ground state of the perturbed toric code and doubled semion models with a magnetic field that is up to a half of the critical value. From a contemporary perspective, this can be thought of as a machine learning approach to discover emergent 1-form symmetries of a ground state wave function. From an application perspective, our approach can be relevant to find Wilson loop operators in current quantum simulators.

10aFOS: Physical sciences10aQuantum Physics (quant-ph)10aStrongly Correlated Electrons (cond-mat.str-el)1 aCian, Ze-Pei1 aHafezi, Mohammad1 aBarkeshli, Maissam uhttps://arxiv.org/abs/2209.1430202469nas a2200241 4500008004100000245007800041210006900119260001500188520171200203653003801915653004301953653002701996653003102023100001302054700001402067700001402081700001802095700002002113700001602133700002502149700001602174856003702190 2022 eng d00aFIPS Compliant Quantum Secure Communication using Quantum Permutation Pad0 aFIPS Compliant Quantum Secure Communication using Quantum Permut c12/30/20223 a

Quantum computing has entered fast development track since Shor's algorithm was proposed in 1994. Multi-cloud services of quantum computing farms are currently available. One of which, IBM quantum computing, presented a road map showing their Kookaburra system with over 4158 qubits will be available in 2025. For the standardization of Post-Quantum Cryptography or PQC, the National Institute of Standards and Technology or NIST recently announced the first candidates for standardization with one algorithm for key encapsulation mechanism (KEM), Kyber, and three algorithms for digital signatures. NIST has also issued a new call for quantum-safe digital signature algorithms due June 1, 2023. This timeline shows that FIPS-certified quantum-safe TLS protocol would take a predictably long time. However, "steal now, crack later" tactic requires protecting data against future quantum threat actors today. NIST recommended the use of a hybrid mode of TLS 1.3 with its extensions to support PQC. The hybrid mode works for certain cases but FIPS certification for the hybridized cryptomodule might still be required. This paper proposes to take a nested mode to enable TLS 1.3 protocol with quantum-safe data, which can be made available today and is FIPS compliant. We discussed the performance impacts of the handshaking phase of the nested TLS 1.3 with PQC and the symmetric encryption phase. The major impact on performance using the nested mode is in the data symmetric encryption with AES. To overcome this performance reduction, we suggest using quantum encryption with a quantum permutation pad for the data encryption with a minor performance reduction of less than 10 percent.

10aCryptography and Security (cs.CR)10aFOS: Computer and information sciences10aFOS: Physical sciences10aQuantum Physics (quant-ph)1 aHe, Alex1 aLou, Dafu1 aShe, Eric1 aGuo, Shangjie1 aWatson, Hareesh1 aWeng, Sibyl1 aPerepechaenko, Maria1 aKuang, Rand uhttps://arxiv.org/abs/2301.0006201846nas a2200181 4500008004100000245009600041210006900137260001400206520121100220653003801431653004301469653002701512653003101539100001501570700001901585700002301604856003701627 2022 eng d00aGroup coset monogamy games and an application to device-independent continuous-variable QKD0 aGroup coset monogamy games and an application to deviceindepende c12/7/20223 a

We develop an extension of a recently introduced subspace coset state monogamy-of-entanglement game [Coladangelo, Liu, Liu, and Zhandry; Crypto'21] to general group coset states, which are uniform superpositions over elements of a subgroup to which has been applied a group-theoretic generalization of the quantum one-time pad. We give a general bound on the winning probability of a monogamy game constructed from subgroup coset states that applies to a wide range of finite and infinite groups. To study the infinite-group case, we use and further develop a measure-theoretic formalism that allows us to express continuous-variable measurements as operator-valued generalizations of probability measures.
We apply the monogamy game bound to various physically relevant groups, yielding realizations of the game in continuous-variable modes as well as in rotational states of a polyatomic molecule. We obtain explicit strong bounds in the case of specific group-space and subgroup combinations. As an application, we provide the first proof of one sided-device independent security of a squeezed-state continuous-variable quantum key distribution protocol against general coherent attacks.

10aCryptography and Security (cs.CR)10aFOS: Computer and information sciences10aFOS: Physical sciences10aQuantum Physics (quant-ph)1 aCulf, Eric1 aVidick, Thomas1 aAlbert, Victor, V. uhttps://arxiv.org/abs/2212.0393502101nas a2200217 4500008004100000245007000041210006900111260001500180520136900195653002101564653002701585653004201612653003001654653003101684653005201715100002301767700001601790700001801806700002201824856003701846 2022 eng d00aHigher-group symmetry in finite gauge theory and stabilizer codes0 aHighergroup symmetry in finite gauge theory and stabilizer codes c11/21/20223 a

A large class of gapped phases of matter can be described by topological finite group gauge theories. In this paper, we derive the d-group global symmetry and its 't Hooft anomaly for topological finite group gauge theories in (d+1) space-time dimensions, including non-Abelian gauge groups and Dijkgraaf-Witten twists. We focus on the 1-form symmetry generated by invertible (Abelian) magnetic defects and the higher-form symmetries generated by invertible topological defects decorated with lower dimensional gauged symmetry-protected topological (SPT) phases. We show that due to a generalization of the Witten effect and charge-flux attachment, the 1-form symmetry generated by the magnetic defects mixes with other symmetries into a higher group. We describe such higher-group symmetry in various lattice model examples. We discuss several applications, including the classification of fermionic SPT phases in (3+1)D for general fermionic symmetry groups, where we also derive a simpler formula for the [O5]∈H5(BG,U(1)) obstruction than has appeared in previous work. We also show how the d-group symmetry is related to fault-tolerant non-Pauli logical gates and a refined Clifford hierarchy in stabilizer codes. We construct new logical gates in stabilizer codes using the d-group symmetry, such as the control-Z gate in (3+1)D Z2 toric code.

10aFOS: Mathematics10aFOS: Physical sciences10aHigh Energy Physics - Theory (hep-th)10aQuantum Algebra (math.QA)10aQuantum Physics (quant-ph)10aStrongly Correlated Electrons (cond-mat.str-el)1 aBarkeshli, Maissam1 aChen, Yu-An1 aHsin, Po-Shen1 aKobayashi, Ryohei uhttps://arxiv.org/abs/2211.1176401505nas a2200205 4500008004100000245006200041210006100103260001500164520083500179653003801014653003401052653004301086653002701129653003101156100002301187700001701210700001701227700001801244856003701262 2022 eng d00aLattice-Based Quantum Advantage from Rotated Measurements0 aLatticeBased Quantum Advantage from Rotated Measurements c10/18/20223 a

Trapdoor claw-free functions (TCFs) are immensely valuable in cryptographic interactions between a classical client and a quantum server. Typically, a protocol has the quantum server prepare a superposition of two-bit strings of a claw and then measure it using Pauli-X or Z measurements. In this paper, we demonstrate a new technique that uses the entire range of qubit measurements from the XY-plane. We show the advantage of this approach in two applications. First, building on (Brakerski et al. 2018, Kalai et al. 2022), we show an optimized two-round proof of quantumness whose security can be expressed directly in terms of the hardness of the LWE (learning with errors) problem. Second, we construct a one-round protocol for blind remote preparation of an arbitrary state on the XY-plane up to a Pauli-Z correction.

10aCryptography and Security (cs.CR)10aEmerging Technologies (cs.ET)10aFOS: Computer and information sciences10aFOS: Physical sciences10aQuantum Physics (quant-ph)1 aAlnawakhtha, Yusuf1 aMantri, Atul1 aMiller, Carl1 aWang, Daochen uhttps://arxiv.org/abs/2210.1014301849nas a2200181 4500008004100000245006500041210006400106260001400170520120700184653004101391653005301432653005401485653002701539100002001566700002201586700002201608856003701630 2022 eng d00aMachine-assisted discovery of integrable symplectic mappings0 aMachineassisted discovery of integrable symplectic mappings c3/22/20223 a

We present a new automated method for finding integrable symplectic maps of the plane. These dynamical systems possess a hidden symmetry associated with an existence of conserved quantities, i.e. integrals of motion. The core idea of the algorithm is based on the knowledge that the evolution of an integrable system in the phase space is restricted to a lower-dimensional submanifold. Limiting ourselves to polygon invariants of motion, we analyze the shape of individual trajectories thus successfully distinguishing integrable motion from chaotic cases. For example, our method rediscovers some of the famous McMillan-Suris integrable mappings and discrete Painlevé equations. In total, over 100 new integrable families are presented and analyzed; some of them are isolated in the space of parameters, and some of them are families with one parameter (or the ratio of parameters) being continuous or discrete. At the end of the paper, we suggest how newly discovered maps are related to a general 2D symplectic map via an introduction of discrete perturbation theory and propose a method on how to construct smooth near-integrable dynamical systems based on mappings with polygon invariants.

10aAccelerator Physics (physics.acc-ph)10aAdaptation and Self-Organizing Systems (nlin.AO)10aExactly Solvable and Integrable Systems (nlin.SI)10aFOS: Physical sciences1 aZolkin, Timofey1 aKharkov, Yaroslav1 aNagaitsev, Sergei uhttps://arxiv.org/abs/2201.1313301571nas a2200205 4500008004100000245006800041210006700109260001400176520091100190653002701101653003101128100002801159700001801187700003201205700002301237700002201260700002501282700002101307856003701328 2022 eng d00aMonitoring-induced Entanglement Entropy and Sampling Complexity0 aMonitoringinduced Entanglement Entropy and Sampling Complexity c1/29/20223 a

The dynamics of open quantum systems is generally described by a master equation, which describes the loss of information into the environment. By using a simple model of uncoupled emitters, we illustrate how the recovery of this information depends on the monitoring scheme applied to register the decay clicks. The dissipative dynamics, in this case, is described by pure-state stochastic trajectories and we examine different unravelings of the same master equation. More precisely, we demonstrate how registering the sequence of clicks from spontaneously emitted photons through a linear optical interferometer induces entanglement in the trajectory states. Since this model consists of an array of single-photon emitters, we show a direct equivalence with Fock-state boson sampling and link the hardness of sampling the outcomes of the quantum jumps with the scaling of trajectory entanglement.

10aFOS: Physical sciences10aQuantum Physics (quant-ph)1 aVan Regemortel, Mathias1 aShtanko, Oles1 aGarcía-Pintos, Luis, Pedro1 aDeshpande, Abhinav1 aDehghani, Hossein1 aGorshkov, Alexey, V.1 aHafezi, Mohammad uhttps://arxiv.org/abs/2201.1267201919nas a2200193 4500008004100000245005700041210005600098260001400154520133700168653002701505653003101532100001601563700002101579700002201600700002701622700001901649700002001668856003701688 2022 eng d00aMulti-Angle QAOA Does Not Always Need All Its Angles0 aMultiAngle QAOA Does Not Always Need All Its Angles c9/23/20223 a

Introducing additional tunable parameters to quantum circuits is a powerful way of improving performance without increasing hardware requirements. A recently introduced multi-angle extension of the quantum approximate optimization algorithm (ma-QAOA) significantly improves the solution from QAOA by allowing the parameters for each term in the Hamiltonian to vary independently. However, prior results suggest that there is considerable redundancy in parameters, the removal of which would reduce the cost of parameter optimization. In this work, we show numerically that problem symmetries can be used to reduce the number of parameters used by ma-QAOA without decreasing the solution quality. We study MaxCut on all 7,565 connected, non-isomorphic 8-node graphs with a non-trivial symmetry group and show numerically that in 67.4\% of these graphs, symmetry can be used to reduce the number of parameters with no decrease in the objective, with the average ratio of parameters reduced by 28.1\%. Moreover, we show that in 35.9\% of the graphs this can be achieved by simply using the largest symmetry. For the graphs where reducing the number of parameters leads to a decrease in the objective, the largest symmetry can be used to reduce the parameter count by 37.1\% at the cost of only a 6.1\% decrease in the objective.

10aFOS: Physical sciences10aQuantum Physics (quant-ph)1 aShi, Kaiyan1 aHerrman, Rebekah1 aShaydulin, Ruslan1 aChakrabarti, Shouvanik1 aPistoia, Marco1 aLarson, Jeffrey uhttps://arxiv.org/abs/2209.1183900942nas a2200133 4500008004100000245007100041210006900112260001500181520049500196653002700691653003100718100002200749856003700771 2022 eng d00aOpportunities and Challenges in Fault-Tolerant Quantum Computation0 aOpportunities and Challenges in FaultTolerant Quantum Computatio c10/28/20223 a

I will give an overview of what I see as some of the most important future directions in the theory of fault-tolerant quantum computation. In particular, I will give a brief summary of the major problems that need to be solved in fault tolerance based on low-density parity check codes and in hardware-specific fault tolerance. I will then conclude with a discussion of a possible new paradigm for designing fault-tolerant protocols based on a space-time picture of quantum circuits.

10aFOS: Physical sciences10aQuantum Physics (quant-ph)1 aGottesman, Daniel uhttps://arxiv.org/abs/2210.1584401895nas a2200169 4500008004100000245007600041210006900117260001400186520129700200653002701497653005601524653004401580100002101624700002201645700002101667856003701688 2022 eng d00aOptical conductivity and orbital magnetization of Floquet vortex states0 aOptical conductivity and orbital magnetization of Floquet vortex c4/20/20223 a

Motivated by recent experimental demonstrations of Floquet topological insulators, there have been several theoretical proposals for using structured light, either spatial or spectral, to create other properties such as flat band and vortex states. In particular, the generation of vortex states in a massive Dirac fermion insulator irradiated by light carrying nonzero orbital angular momentum (OAM) has been proposed [Kim et al. Phys. Rev. B 105, L081301(2022)]. Here, we evaluate the orbital magnetization and optical conductivity as physical observables for such a system. We show that the OAM of light induces nonzero orbital magnetization and current density. The orbital magnetization density increases linearly as a function of OAM degree. In certain regimes, we find that orbital magnetization density is independent of the system size, width, and Rabi frequency of light. It is shown that the orbital magnetization arising from our Floquet theory is large and can be probed by magnetometry measurements. Furthermore, we study the optical conductivity for various types of electron transitions between different states such as vortex, edge, and bulk that are present in the system. Based on conductance frequency peaks, a scheme for the detection of vortex states is proposed.

10aFOS: Physical sciences10aMesoscale and Nanoscale Physics (cond-mat.mes-hall)10aOther Condensed Matter (cond-mat.other)1 aAhmadabadi, Iman1 aDehghani, Hossein1 aHafezi, Mohammad uhttps://arxiv.org/abs/2204.0948801875nas a2200217 4500008004100000245008100041210006900122260001400191300001100205490000600216520122600222653002701448653003101475100002401506700001301530700002301543700001301566700001801579700002301597856003701620 2022 eng d00aOptimal scaling quantum linear systems solver via discrete adiabatic theorem0 aOptimal scaling quantum linear systems solver via discrete adiab c10/7/2022 a0403030 v33 a

Recently, several approaches to solving linear systems on a quantum computer have been formulated in terms of the quantum adiabatic theorem for a continuously varying Hamiltonian. Such approaches enabled near-linear scaling in the condition number κ of the linear system, without requiring a complicated variable-time amplitude amplification procedure. However, the most efficient of those procedures is still asymptotically sub-optimal by a factor of log(κ). Here, we prove a rigorous form of the adiabatic theorem that bounds the error in terms of the spectral gap for intrinsically discrete time evolutions. We use this discrete adiabatic theorem to develop a quantum algorithm for solving linear systems that is asymptotically optimal, in the sense that the complexity is strictly linear in κ, matching a known lower bound on the complexity. Our O(κlog(1/ϵ)) complexity is also optimal in terms of the combined scaling in κ and the precision ϵ. Compared to existing suboptimal methods, our algorithm is simpler and easier to implement. Moreover, we determine the constant factors in the algorithm, which would be suitable for determining the complexity in terms of gate counts for specific applications.

10aFOS: Physical sciences10aQuantum Physics (quant-ph)1 aCosta, Pedro, C. S.1 aAn, Dong1 aSanders, Yuval, R.1 aSu, Yuan1 aBabbush, Ryan1 aBerry, Dominic, W. uhttps://arxiv.org/abs/2111.0815202246nas a2200205 4500008004100000245006600041210006600107260001400173520157400187653002701761653003101788653005201819100002301871700001601894700001501910700002001925700003001945700002801975856003702003 2022 eng d00aPauli topological subsystem codes from Abelian anyon theories0 aPauli topological subsystem codes from Abelian anyon theories c11/7/20223 a

We construct Pauli topological subsystem codes characterized by arbitrary two-dimensional Abelian anyon theories--this includes anyon theories with degenerate braiding relations and those without a gapped boundary to the vacuum. Our work both extends the classification of two-dimensional Pauli topological subsystem codes to systems of composite-dimensional qudits and establishes that the classification is at least as rich as that of Abelian anyon theories. We exemplify the construction with topological subsystem codes defined on four-dimensional qudits based on the Z(1)4 anyon theory with degenerate braiding relations and the chiral semion theory--both of which cannot be captured by topological stabilizer codes. The construction proceeds by "gauging out" certain anyon types of a topological stabilizer code. This amounts to defining a gauge group generated by the stabilizer group of the topological stabilizer code and a set of anyonic string operators for the anyon types that are gauged out. The resulting topological subsystem code is characterized by an anyon theory containing a proper subset of the anyons of the topological stabilizer code. We thereby show that every Abelian anyon theory is a subtheory of a stack of toric codes and a certain family of twisted quantum doubles that generalize the double semion anyon theory. We further prove a number of general statements about the logical operators of translation invariant topological subsystem codes and define their associated anyon theories in terms of higher-form symmetries.

10aFOS: Physical sciences10aQuantum Physics (quant-ph)10aStrongly Correlated Electrons (cond-mat.str-el)1 aEllison, Tyler, D.1 aChen, Yu-An1 aDua, Arpit1 aShirley, Wilbur1 aTantivasadakarn, Nathanan1 aWilliamson, Dominic, J. uhttps://arxiv.org/abs/2211.0379800782nas a2200229 4500008004100000245009900041210006900140260001500209490000700224653004300231653002100274653002700295653002900322653003900351653003100390100002300421700001700444700001800461700001800479700001800497856003700515 2022 eng d00aQuantum Algorithms for Sampling Log-Concave Distributions and Estimating Normalizing Constants0 aQuantum Algorithms for Sampling LogConcave Distributions and Est c10/12/20220 v3510aFOS: Computer and information sciences10aFOS: Mathematics10aFOS: Physical sciences10aMachine Learning (cs.LG)10aOptimization and Control (math.OC)10aQuantum Physics (quant-ph)1 aChilds, Andrew, M.1 aLi, Tongyang1 aLiu, Jin-Peng1 aWang, Chunhao1 aZhang, Ruizhe uhttps://arxiv.org/abs/2210.0653902089nas a2200229 4500008004100000245004500041210004500086260001500131520136900146653003701515653003801552653004301590653002701633653003101660100002301691700002401714700002101738700002501759700001701784700002101801856003701822 2022 eng d00aQuantum Depth in the Random Oracle Model0 aQuantum Depth in the Random Oracle Model c10/12/20223 a

We give a comprehensive characterization of the computational power of shallow quantum circuits combined with classical computation. Specifically, for classes of search problems, we show that the following statements hold, relative to a random oracle:
(a) BPPQNCBPP≠BQP. This refutes Jozsa's conjecture [QIP 05] in the random oracle model. As a result, this gives the first instantiatable separation between the classes by replacing the oracle with a cryptographic hash function, yielding a resolution to one of Aaronson's ten semi-grand challenges in quantum computing.
(b) BPPQNC⊈QNCBPP and QNCBPP⊈BPPQNC. This shows that there is a subtle interplay between classical computation and shallow quantum computation. In fact, for the second separation, we establish that, for some problems, the ability to perform adaptive measurements in a single shallow quantum circuit, is more useful than the ability to perform polynomially many shallow quantum circuits without adaptive measurements.
(c) There exists a 2-message proof of quantum depth protocol. Such a protocol allows a classical verifier to efficiently certify that a prover must be performing a computation of some minimum quantum depth. Our proof of quantum depth can be instantiated using the recent proof of quantumness construction by Yamakawa and Zhandry [STOC 22].

10aComputational Complexity (cs.CC)10aCryptography and Security (cs.CR)10aFOS: Computer and information sciences10aFOS: Physical sciences10aQuantum Physics (quant-ph)1 aArora, Atul, Singh1 aColadangelo, Andrea1 aCoudron, Matthew1 aGheorghiu, Alexandru1 aSingh, Uttam1 aWaldner, Hendrik uhttps://arxiv.org/abs/2210.0645401490nas a2200205 4500008004100000245003100041210003100072260001500103520088200118653004301000653004301043653002701086653003101113100002301144700001901167700002201186700002101208700001801229856003701247 2022 eng d00aQuantum divide and conquer0 aQuantum divide and conquer c10/12/20223 a

The divide-and-conquer framework, used extensively in classical algorithm design, recursively breaks a problem of size n into smaller subproblems (say, a copies of size n/b each), along with some auxiliary work of cost Caux(n), to give a recurrence relation
C(n)≤aC(n/b)+Caux(n)
for the classical complexity C(n). We describe a quantum divide-and-conquer framework that, in certain cases, yields an analogous recurrence relation
CQ(n)≤a−−√CQ(n/b)+O(CauxQ(n))
that characterizes the quantum query complexity. We apply this framework to obtain near-optimal quantum query complexities for various string problems, such as (i) recognizing regular languages; (ii) decision versions of String Rotation and String Suffix; and natural parameterized versions of (iii) Longest Increasing Subsequence and (iv) Longest Common Subsequence.

10aData Structures and Algorithms (cs.DS)10aFOS: Computer and information sciences10aFOS: Physical sciences10aQuantum Physics (quant-ph)1 aChilds, Andrew, M.1 aKothari, Robin1 aKovacs-Deak, Matt1 aSundaram, Aarthi1 aWang, Daochen uhttps://arxiv.org/abs/2210.0641901622nas a2200193 4500008004100000245008300041210006900124260001400193520097000207653002701177653005201204100002101256700003001277700002001307700002501327700002101352700001801373856003701391 2022 eng d00aQuantum Many-Body Scars from Einstein-Podolsky-Rosen States in Bilayer Systems0 aQuantum ManyBody Scars from EinsteinPodolskyRosen States in Bila c9/12/20223 a

Quantum many-body scar states are special eigenstates of nonintegrable models with distinctive entanglement features that give rise to infinitely long-lived coherent dynamics under quantum quenches from certain initial states. We elaborate on a construction of quantum many-body scar states in which they emerge from Einstein-Podolsky-Rosen (EPR) states in systems with two layers, wherein the two layers are maximally entangled. We apply this construction to spin systems as well as systems of itinerant fermions and bosons and demonstrate how symmetries can be harnessed to enhance its versatility. We show that several well-known examples of quantum many-body scars, including the tower of states in the spin-1 XY model and the η-pairing states in the Fermi-Hubbard model, can be understood within this formalism. We also demonstrate how an {\it infinite} tower of many-body scar states can emerge in bilayer Bose-Hubbard models with charge conservation.

10aFOS: Physical sciences10aStrongly Correlated Electrons (cond-mat.str-el)1 aWildeboer, Julia1 aLanglett, Christopher, M.1 aYang, Zhi-Cheng1 aGorshkov, Alexey, V.1 aIadecola, Thomas1 aXu, Shenglong uhttps://arxiv.org/abs/2209.0552701921nas a2200205 4500008004100000245009400041210006900135260001500204520125300219653004301472653002701515653003401542653003101576100001301607700001701620700001201637700001401649700001501663856003701678 2022 eng d00aQuantum Natural Proof: A New Perspective of Hybrid Quantum-Classical Program Verification0 aQuantum Natural Proof A New Perspective of Hybrid QuantumClassic c11/11/20223 a

Many quantum programs are assured by formal verification, but such verification is usually laborious and time-consuming. This paper proposes quantum natural proof (QNP), an automated proof system for verifying hybrid quantum-classical algorithms. Natural proofs are a subclass of proofs that are amenable to completely automated reasoning, provide sound but incomplete procedures, and capture common reasoning tactics in program verification. The core of QNP is a type-guided quantum proof system, named Qafny, which views quantum operations as some classical array operations that can be modeled as proof rules in a classical separation logic framework, suitable for automated reasoning. We proved the soundness and completeness of the Qafny proof system as well as the soundness of the proof system compilation from Qafny to Dafny. By using the QNP implementation in Dafny, automated verification can be efficiently perform for many hybrid quantum-classical algorithms, including GHZ, Shor's, Grover's, and quantum walk algorithms, which saves a great amount of human efforts. In addition, quantum programs written in Qafny can be compiled to quantum circuits so that every verified quantum program can be run on a quantum machine.

10aFOS: Computer and information sciences10aFOS: Physical sciences10aProgramming Languages (cs.PL)10aQuantum Physics (quant-ph)1 aLi, Liyi1 aZhu, Mingwei1 aLee, Yi1 aChang, Le1 aWu, Xiaodi uhttps://arxiv.org/abs/2211.0641101358nas a2200181 4500008004100000245003900041210003900080260001300119520083800132653002700970653003100997100002301028700001901051700002101070700002301091700002501114856003701139 2022 eng d00aQuantum Routing with Teleportation0 aQuantum Routing with Teleportation c4/8/20223 a

We study the problem of implementing arbitrary permutations of qubits under interaction constraints in quantum systems that allow for arbitrarily fast local operations and classical communication (LOCC). In particular, we show examples of speedups over swap-based and more general unitary routing methods by distributing entanglement and using LOCC to perform quantum teleportation. We further describe an example of an interaction graph for which teleportation gives a logarithmic speedup in the worst-case routing time over swap-based routing. We also study limits on the speedup afforded by quantum teleportation - showing an O(NlogN−−−−−−−√) upper bound on the separation in routing time for any interaction graph - and give tighter bounds for some common classes of graphs.

10aFOS: Physical sciences10aQuantum Physics (quant-ph)1 aDevulapalli, Dhruv1 aSchoute, Eddie1 aBapat, Aniruddha1 aChilds, Andrew, M.1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/2204.0418502845nas a2200541 4500008004100000245004700041210004700088260001300135520125300148653002701401653004401428653004901472653004201521653002901563653003101592100002501623700002001648700002101668700002501689700002001714700002201734700002001756700002001776700001801796700002101814700002101835700001601856700001801872700001501890700001901905700002101924700002401945700002201969700001801991700001902009700002002028700002402048700002402072700002302096700001902119700002002138700002202158700001802180700002102198700002602219700002102245856003702266 2022 eng d00aQuantum Simulation for High Energy Physics0 aQuantum Simulation for High Energy Physics c4/7/20223 a

It is for the first time that Quantum Simulation for High Energy Physics (HEP) is studied in the U.S. decadal particle-physics community planning, and in fact until recently, this was not considered a mainstream topic in the community. This fact speaks of a remarkable rate of growth of this subfield over the past few years, stimulated by the impressive advancements in Quantum Information Sciences (QIS) and associated technologies over the past decade, and the significant investment in this area by the government and private sectors in the U.S. and other countries. High-energy physicists have quickly identified problems of importance to our understanding of nature at the most fundamental level, from tiniest distances to cosmological extents, that are intractable with classical computers but may benefit from quantum advantage. They have initiated, and continue to carry out, a vigorous program in theory, algorithm, and hardware co-design for simulations of relevance to the HEP mission. This community whitepaper is an attempt to bring this exciting and yet challenging area of research to the spotlight, and to elaborate on what the promises, requirements, challenges, and potential solutions are over the next decade and beyond.

10aFOS: Physical sciences10aHigh Energy Physics - Lattice (hep-lat)10aHigh Energy Physics - Phenomenology (hep-ph)10aHigh Energy Physics - Theory (hep-th)10aNuclear Theory (nucl-th)10aQuantum Physics (quant-ph)1 aBauer, Christian, W.1 aDavoudi, Zohreh1 aBalantekin, Baha1 aBhattacharya, Tanmoy1 aCarena, Marcela1 ade Jong, Wibe, A.1 aDraper, Patrick1 aEl-Khadra, Aida1 aGemelke, Nate1 aHanada, Masanori1 aKharzeev, Dmitri1 aLamm, Henry1 aLi, Ying-Ying1 aLiu, Junyu1 aLukin, Mikhail1 aMeurice, Yannick1 aMonroe, Christopher1 aNachman, Benjamin1 aPagano, Guido1 aPreskill, John1 aRinaldi, Enrico1 aRoggero, Alessandro1 aSantiago, David, I.1 aSavage, Martin, J.1 aSiddiqi, Irfan1 aSiopsis, George1 aVan Zanten, David1 aWiebe, Nathan1 aYamauchi, Yukari1 aYeter-Aydeniz, Kübra1 aZorzetti, Silvia uhttps://arxiv.org/abs/2204.0338101806nas a2200181 4500008004100000245007200041210006900113260001500182520123900197653002701436653003101463100002001494700001601514700001801530700001901548700002001567856003701587 2022 eng d00aQuantum state tomography via non-convex Riemannian gradient descent0 aQuantum state tomography via nonconvex Riemannian gradient desce c10/10/20223 a

The recovery of an unknown density matrix of large size requires huge computational resources. The recent Factored Gradient Descent (FGD) algorithm and its variants achieved state-of-the-art performance since they could mitigate the dimensionality barrier by utilizing some of the underlying structures of the density matrix. Despite their theoretical guarantee of a linear convergence rate, the convergence in practical scenarios is still slow because the contracting factor of the FGD algorithms depends on the condition number κ of the ground truth state. Consequently, the total number of iterations can be as large as O(κ−−√ln(1ε)) to achieve the estimation error ε. In this work, we derive a quantum state tomography scheme that improves the dependence on κ to the logarithmic scale; namely, our algorithm could achieve the approximation error ε in O(ln(1κε)) steps. The improvement comes from the application of the non-convex Riemannian gradient descent (RGD). The contracting factor in our approach is thus a universal constant that is independent of the given state. Our theoretical results of extremely fast convergence and nearly optimal error bounds are corroborated by numerical results.

10aFOS: Physical sciences10aQuantum Physics (quant-ph)1 aHsu, Ming-Chien1 aKuo, En-Jui1 aYu, Wei-Hsuan1 aCai, Jian-Feng1 aHsieh, Min-Hsiu uhttps://arxiv.org/abs/2210.0471701906nas a2200205 4500008004100000245008600041210006900127260001400196520121200210653004301422653002701465653003801492653003401530653003101564100001901595700001301614700001701627700001901644856003701663 2022 eng d00aQunity: A Unified Language for Quantum and Classical Computing (Extended Version)0 aQunity A Unified Language for Quantum and Classical Computing Ex c4/26/20223 a

We introduce Qunity, a new quantum programming language designed to treat quantum computing as a natural generalization of classical computing. Qunity presents a unified syntax where familiar programming constructs can have both quantum and classical effects. For example, one can use sum types to implement the direct sum of linear operators, exception-handling syntax to implement projective measurements, and aliasing to induce entanglement. Further, Qunity takes advantage of the overlooked BQP subroutine theorem, allowing one to construct reversible subroutines from irreversible quantum algorithms through the uncomputation of "garbage" outputs. Unlike existing languages that enable quantum aspects with separate add-ons (like a classical language with quantum gates bolted on), Qunity provides a unified syntax and a novel denotational semantics that guarantees that programs are quantum mechanically valid. We present Qunity's syntax, type system, and denotational semantics, showing how it can cleanly express several quantum algorithms. We also detail how Qunity can be compiled into a low-level qubit circuit language like OpenQASM, proving the realizability of our design.

10aFOS: Computer and information sciences10aFOS: Physical sciences10aLogic in Computer Science (cs.LO)10aProgramming Languages (cs.PL)10aQuantum Physics (quant-ph)1 aVoichick, Finn1 aLi, Liyi1 aRand, Robert1 aHicks, Michael uhttps://arxiv.org/abs/2204.1238401949nas a2200193 4500008004100000245005300041210005200094260001500146520133800161653004301499653002701542653003101569653002901600653003101629100001801660700002001678700002001698856003701718 2022 eng d00aSample-optimal classical shadows for pure states0 aSampleoptimal classical shadows for pure states c11/21/20223 a

We consider the classical shadows task for pure states in the setting of both joint and independent measurements. The task is to measure few copies of an unknown pure state ρ in order to learn a classical description which suffices to later estimate expectation values of observables. Specifically, the goal is to approximate Tr(Oρ) for any Hermitian observable O to within additive error ϵ provided Tr(O2)≤B and ∥O∥=1. Our main result applies to the joint measurement setting, where we show Θ~(B−−√ϵ−1+ϵ−2) samples of ρ are necessary and sufficient to succeed with high probability. The upper bound is a quadratic improvement on the previous best sample complexity known for this problem. For the lower bound, we see that the bottleneck is not how fast we can learn the state but rather how much any classical description of ρ can be compressed for observable estimation. In the independent measurement setting, we show that O(Bd−−−√ϵ−1+ϵ−2) samples suffice. Notably, this implies that the random Clifford measurements algorithm of Huang, Kueng, and Preskill, which is sample-optimal for mixed states, is not optimal for pure states. Interestingly, our result also uses the same random Clifford measurements but employs a different estimator.

10aFOS: Computer and information sciences10aFOS: Physical sciences10aInformation Theory (cs.IT)10aMachine Learning (cs.LG)10aQuantum Physics (quant-ph)1 aGrier, Daniel1 aPashayan, Hakop1 aSchaeffer, Luke uhttps://arxiv.org/abs/2211.1181001923nas a2200241 4500008004100000245007300041210006900114260001400183520110600197653004301303653002701346653002901373653003901402653003101441653005201472100002001524700002801544700001501572700002401587700001601611700001701627856003701644 2022 eng d00aScalably learning quantum many-body Hamiltonians from dynamical data0 aScalably learning quantum manybody Hamiltonians from dynamical d c9/28/20223 a

The physics of a closed quantum mechanical system is governed by its Hamiltonian. However, in most practical situations, this Hamiltonian is not precisely known, and ultimately all there is are data obtained from measurements on the system. In this work, we introduce a highly scalable, data-driven approach to learning families of interacting many-body Hamiltonians from dynamical data, by bringing together techniques from gradient-based optimization from machine learning with efficient quantum state representations in terms of tensor networks. Our approach is highly practical, experimentally friendly, and intrinsically scalable to allow for system sizes of above 100 spins. In particular, we demonstrate on synthetic data that the algorithm works even if one is restricted to one simple initial state, a small number of single-qubit observables, and time evolution up to relatively short times. For the concrete example of the one-dimensional Heisenberg model our algorithm exhibits an error constant in the system size and scaling as the inverse square root of the size of the data set.

10aFOS: Computer and information sciences10aFOS: Physical sciences10aMachine Learning (cs.LG)10aQuantum Gases (cond-mat.quant-gas)10aQuantum Physics (quant-ph)10aStrongly Correlated Electrons (cond-mat.str-el)1 aWilde, Frederik1 aKshetrimayum, Augustine1 aRoth, Ingo1 aHangleiter, Dominik1 aSweke, Ryan1 aEisert, Jens uhttps://arxiv.org/abs/2209.1432802029nas a2200325 4500008004100000245006700041210006500108260001400173520109100187653003701278653002701315653003101342100001701373700001201390700002301402700001901425700001901444700001501463700001201478700002001490700001801510700001701528700002001545700001901565700001901584700002201603700001901625700002201644856003701666 2022 eng d00aSelf-Testing of a Single Quantum System: Theory and Experiment0 aSelfTesting of a Single Quantum System Theory and Experiment c3/17/20223 a

Certifying individual quantum devices with minimal assumptions is crucial for the development of quantum technologies. Here, we investigate how to leverage single-system contextuality to realize self-testing. We develop a robust self-testing protocol based on the simplest contextuality witness for the simplest contextual quantum system, the Klyachko-Can-Binicioğlu-Shumovsky (KCBS) inequality for the qutrit. We establish a lower bound on the fidelity of the state and the measurements (to an ideal configuration) as a function of the value of the witness under a pragmatic assumption on the measurements we call the KCBS orthogonality condition. We apply the method in an experiment with randomly chosen measurements on a single trapped 40Ca+ and near-perfect detection efficiency. The observed statistics allow us to self-test the system and provide the first experimental demonstration of quantum self-testing of a single system. Further, we quantify and report that deviations from our assumptions are minimal, an aspect previously overlooked by contextuality experiments.

10aAtomic Physics (physics.atom-ph)10aFOS: Physical sciences10aQuantum Physics (quant-ph)1 aHu, Xiao-Min1 aXie, Yi1 aArora, Atul, Singh1 aAi, Ming-Zhong1 aBharti, Kishor1 aZhang, Jie1 aWu, Wei1 aChen, Ping-Xing1 aCui, Jin-Ming1 aLiu, Bi-Heng1 aHuang, Yun-Feng1 aLi, Chuan-Feng1 aGuo, Guang-Can1 aRoland, Jérémie1 aCabello, Adán1 aKwek, Leong-Chuan uhttps://arxiv.org/abs/2203.0900301587nas a2200181 4500008004100000245010600041210006900147260001400216520099600230653002701226653003101253100001801284700001701302700001501319700001701334700001701351856003701368 2022 eng d00aShadow Distillation: Quantum Error Mitigation with Classical Shadows for Near-Term Quantum Processors0 aShadow Distillation Quantum Error Mitigation with Classical Shad c3/14/20223 a

Mitigating errors in quantum information processing devices is especially important in the absence of fault tolerance. An effective method in suppressing state-preparation errors is using multiple copies to distill the ideal component from a noisy quantum state. Here, we use classical shadows and randomized measurements to circumvent the need for coherent access to multiple copies at an exponential cost. We study the scaling of resources using numerical simulations and find that the overhead is still favorable compared to full state tomography. We optimize measurement resources under realistic experimental constraints and apply our method to an experiment preparing Greenberger-Horne-Zeilinger (GHZ) state with trapped ions. In addition to improving stabilizer measurements, the analysis of the improved results reveals the nature of errors affecting the experiment. Hence, our results provide a directly applicable method for mitigating errors in near-term quantum computers.

10aFOS: Physical sciences10aQuantum Physics (quant-ph)1 aSeif, Alireza1 aCian, Ze-Pei1 aZhou, Sisi1 aChen, Senrui1 aJiang, Liang uhttps://arxiv.org/abs/2203.0730901867nas a2200205 4500008004100000245006500041210006500106260001500171520119000186653003701376653004301413653002701456653003101483100001801514700002301532700002401555700002501579700002001604856003701624 2022 eng d00aSharp complexity phase transitions generated by entanglement0 aSharp complexity phase transitions generated by entanglement c12/20/20223 a

Entanglement is one of the physical properties of quantum systems responsible for the computational hardness of simulating quantum systems. But while the runtime of specific algorithms, notably tensor network algorithms, explicitly depends on the amount of entanglement in the system, it is unknown whether this connection runs deeper and entanglement can also cause inherent, algorithm-independent complexity. In this work, we quantitatively connect the entanglement present in certain quantum systems to the computational complexity of simulating those systems. Moreover, we completely characterize the entanglement and complexity as a function of a system parameter. Specifically, we consider the task of simulating single-qubit measurements of k--regular graph states on n qubits. We show that, as the regularity parameter is increased from 1 to n−1, there is a sharp transition from an easy regime with low entanglement to a hard regime with high entanglement at k=3, and a transition back to easy and low entanglement at k=n−3. As a key technical result, we prove a duality for the simulation complexity of regular graph states between low and high regularity.

10aComputational Complexity (cs.CC)10aFOS: Computer and information sciences10aFOS: Physical sciences10aQuantum Physics (quant-ph)1 aGhosh, Soumik1 aDeshpande, Abhinav1 aHangleiter, Dominik1 aGorshkov, Alexey, V.1 aFefferman, Bill uhttps://arxiv.org/abs/2212.1058201457nas a2200157 4500008004100000245003100041210003100072260001500103490000800118520103500126653002701161653003101188100002201219700002101241856003701262 2022 eng d00aSimultaneous Stoquasticity0 aSimultaneous Stoquasticity c06/09/20220 v1053 a

Stoquastic Hamiltonians play a role in the computational complexity of the local Hamiltonian problem as well as the study of classical simulability. In particular, stoquastic Hamiltonians can be straightforwardly simulated using Monte Carlo techniques. We address the question of whether two or more Hamiltonians may be made simultaneously stoquastic via a unitary transformation. This question has important implications for the complexity of simulating quantum annealing where quantum advantage is related to the stoquasticity of the Hamiltonians involved in the anneal. We find that for almost all problems no such unitary exists and show that the problem of determining the existence of such a unitary is equivalent to identifying if there is a solution to a system of polynomial (in)equalities in the matrix elements of the initial and transformed Hamiltonians. Solving such a system of equations is NP-hard. We highlight a geometric understanding of this problem in terms of a collection of generalized Bloch vectors.

10aFOS: Physical sciences10aQuantum Physics (quant-ph)1 aBringewatt, Jacob1 aBrady, Lucas, T. uhttps://arxiv.org/abs/2202.0886301392nas a2200229 4500008004100000245008100041210006900122260001400191520061400205653002700819653005300846653004900899653003100948100001900979700001700998700001901015700002001034700002401054700002501078700002201103856003701125 2022 eng d00aSnowmass 2021 White Paper: Tabletop experiments for infrared quantum gravity0 aSnowmass 2021 White Paper Tabletop experiments for infrared quan c3/22/20223 a

Progress in the quantum readout and control of mechanical devices from single atoms to large masses may enable a first generation of experiments probing the gravitational interaction in the quantum regime, conceivably within the next decade. In this Snowmass whitepaper, we briefly outline the possibilities and challenges facing the realization of these experiments. In particular, we emphasize the need for detailed theories of modifications to the usual effective QFT of gravitons in the infrared regime E/L3≪mPl/ℓ3Pl in which these experiments operate, and relations to possible UV completions.

10aFOS: Physical sciences10aGeneral Relativity and Quantum Cosmology (gr-qc)10aHigh Energy Physics - Phenomenology (hep-ph)10aQuantum Physics (quant-ph)1 aCarney, Daniel1 aChen, Yanbei1 aGeraci, Andrew1 aMüller, Holger1 aPanda, Cristian, D.1 aStamp, Philip, C. E.1 aTaylor, Jacob, M. uhttps://arxiv.org/abs/2203.1184602149nas a2200457 4500008004100000245005300041210005200094260001400146520077300160653005700933653002700990653004601017653004901063100003401112700002201146700002101168700001901189700001901208700002201227700001901249700002201268700002501290700001901315700001701334700001901351700002101370700002101391700001801412700001401430700002701444700002201471700002201493700001601515700002001531700001701551700002501568700002201593700001401615700002501629856003701654 2022 eng d00aSnowmass 2021 White Paper: The Windchime Project0 aSnowmass 2021 White Paper The Windchime Project c3/14/20223 a

The absence of clear signals from particle dark matter in direct detection experiments motivates new approaches in disparate regions of viable parameter space. In this Snowmass white paper, we outline the Windchime project, a program to build a large array of quantum-enhanced mechanical sensors. The ultimate aim is to build a detector capable of searching for Planck mass-scale dark matter purely through its gravitational coupling to ordinary matter. In the shorter term, we aim to search for a number of other physics targets, especially some ultralight dark matter candidates. Here, we discuss the basic design, open R&D challenges and opportunities, current experimental efforts, and both short- and long-term physics targets of the Windchime project.

10aCosmology and Nongalactic Astrophysics (astro-ph.CO)10aFOS: Physical sciences10aHigh Energy Physics - Experiment (hep-ex)10aHigh Energy Physics - Phenomenology (hep-ph)1 aCollaboration, The, Windchime1 aAttanasio, Alaina1 aBhave, Sunil, A.1 aBlanco, Carlos1 aCarney, Daniel1 aDemarteau, Marcel1 aElshimy, Bahaa1 aFebbraro, Michael1 aFeldman, Matthew, A.1 aGhosh, Sohitri1 aHickin, Abby1 aHong, Seongjin1 aLang, Rafael, F.1 aLawrie, Benjamin1 aLi, Shengchao1 aLiu, Zhen1 aMaldonado, Juan, P. A.1 aMarvinney, Claire1 aOo, Hein, Zay Yar1 aPai, Yun-Yi1 aPooser, Raphael1 aQin, Juehang1 aSparmann, Tobias, J.1 aTaylor, Jacob, M.1 aTian, Hao1 aTunnell, Christopher uhttps://arxiv.org/abs/2203.0724202034nas a2200217 4500008004100000245004900041210004900090260001300139520129000152653006101442653002701503653004201530653004701572653005201619100001901671700002001690700002901710700002101739700001901760856003701779 2022 eng d00aSpectral Form Factor of a Quantum Spin Glass0 aSpectral Form Factor of a Quantum Spin Glass c4/4/20223 a

It is widely expected that systems which fully thermalize are chaotic in the sense of exhibiting random-matrix statistics of their energy level spacings, whereas integrable systems exhibit Poissonian statistics. In this paper, we investigate a third class: spin glasses. These systems are partially chaotic but do not achieve full thermalization due to large free energy barriers. We examine the level spacing statistics of a canonical infinite-range quantum spin glass, the quantum p-spherical model, using an analytic path integral approach. We find statistics consistent with a direct sum of independent random matrices, and show that the number of such matrices is equal to the number of distinct metastable configurations -- the exponential of the spin glass "complexity" as obtained from the quantum Thouless-Anderson-Palmer equations. We also consider the statistical properties of the complexity itself and identify a set of contributions to the path integral which suggest a Poissonian distribution for the number of metastable configurations. Our results show that level spacing statistics can probe the ergodicity-breaking in quantum spin glasses and provide a way to generalize the notion of spin glass complexity beyond models with a semi-classical limit.

10aDisordered Systems and Neural Networks (cond-mat.dis-nn)10aFOS: Physical sciences10aHigh Energy Physics - Theory (hep-th)10aStatistical Mechanics (cond-mat.stat-mech)10aStrongly Correlated Electrons (cond-mat.str-el)1 aWiner, Michael1 aBarney, Richard1 aBaldwin, Christopher, L.1 aGalitski, Victor1 aSwingle, Brian uhttps://arxiv.org/abs/2203.1275302392nas a2200181 4500008004100000245006700041210006600108260001400174520183100188653002702019653003102046100001602077700001802093700002702111700002002138700001502158856003702173 2022 eng d00aTailoring three-dimensional topological codes for biased noise0 aTailoring threedimensional topological codes for biased noise c11/3/20223 a

Tailored topological stabilizer codes in two dimensions have been shown to exhibit high storage threshold error rates and improved subthreshold performance under biased Pauli noise. Three-dimensional (3D) topological codes can allow for several advantages including a transversal implementation of non-Clifford logical gates, single-shot decoding strategies, parallelized decoding in the case of fracton codes as well as construction of fractal lattice codes. Motivated by this, we tailor 3D topological codes for enhanced storage performance under biased Pauli noise. We present Clifford deformations of various 3D topological codes, such that they exhibit a threshold error rate of 50% under infinitely biased Pauli noise. Our examples include the 3D surface code on the cubic lattice, the 3D surface code on a checkerboard lattice that lends itself to a subsystem code with a single-shot decoder, the 3D color code, as well as fracton models such as the X-cube model, the Sierpinski model and the Haah code. We use the belief propagation with ordered statistics decoder (BP-OSD) to study threshold error rates at finite bias. We also present a rotated layout for the 3D surface code, which uses roughly half the number of physical qubits for the same code distance under appropriate boundary conditions. Imposing coprime periodic dimensions on this rotated layout leads to logical operators of weight O(n) at infinite bias and a corresponding exp[−O(n)] subthreshold scaling of the logical failure rate, where n is the number of physical qubits in the code. Even though this scaling is unstable due to the existence of logical representations with O(1) low-rate Pauli errors, the number of such representations scales only polynomially for the Clifford-deformed code, leading to an enhanced effective distance.

10aFOS: Physical sciences10aQuantum Physics (quant-ph)1 aHuang, Eric1 aPesah, Arthur1 aChubb, Christopher, T.1 aVasmer, Michael1 aDua, Arpit uhttps://arxiv.org/abs/2211.0211602559nas a2200193 4500008004100000245008700041210006900128260001400197520194300211653002102154653002702175653003302202653003102235100001302266700001802279700001802297700001302315856003702328 2022 eng d00aA theory of quantum differential equation solvers: limitations and fast-forwarding0 atheory of quantum differential equation solvers limitations and  c11/9/20223 a

We study the limitations and fast-forwarding of quantum algorithms for solving linear ordinary differential equation (ODE) systems with particular focus on non-quantum dynamics, where the coefficient matrix in the ODE is not anti-Hermitian or the ODE is inhomogeneous. On the one hand, for generic homogeneous linear ODEs, by proving worst-case lower bounds, we show that quantum algorithms suffer from computational overheads due to two types of ``non-quantumness'': real part gap and non-normality of the coefficient matrix. We then show that ODEs in the absence of both types of ``non-quantumness'' are equivalent to quantum dynamics, and reach the conclusion that quantum algorithms for quantum dynamics work best. We generalize our results to the inhomogeneous case and find that existing generic quantum ODE solvers cannot be substantially improved. To obtain these lower bounds, we propose a general framework for proving lower bounds on quantum algorithms that are amplifiers, meaning that they amplify the difference between a pair of input quantum states. On the other hand, we show how to fast-forward quantum algorithms for solving special classes of ODEs which leads to improved efficiency. More specifically, we obtain quadratic to exponential improvements in terms of the evolution time T and the spectral norm of the coefficient matrix for the following classes of ODEs: inhomogeneous ODEs with a negative definite coefficient matrix, inhomogeneous ODEs with a coefficient matrix having an eigenbasis that can be efficiently prepared on a quantum computer and eigenvalues that can be efficiently computed classically, and the spatially discretized inhomogeneous heat equation and advection-diffusion equation. We give fast-forwarding algorithms that are conceptually different from existing ones in the sense that they neither require time discretization nor solving high-dimensional linear systems.

10aFOS: Mathematics10aFOS: Physical sciences10aNumerical Analysis (math.NA)10aQuantum Physics (quant-ph)1 aAn, Dong1 aLiu, Jin-Peng1 aWang, Daochen1 aZhao, Qi uhttps://arxiv.org/abs/2211.0524601959nas a2200217 4500008004100000245010400041210006900145260001400214520119900228653002701427653003501454653003101489653005201520100002001572700001601592700001501608700002301623700003001646700002801676856003701704 2022 eng d00aThree-dimensional quantum cellular automata from chiral semion surface topological order and beyond0 aThreedimensional quantum cellular automata from chiral semion su c2/10/20223 a

We construct a novel three-dimensional quantum cellular automaton (QCA) based on a system with short-range entangled bulk and chiral semion boundary topological order. We argue that either the QCA is nontrivial, i.e. not a finite-depth circuit of local quantum gates, or there exists a two-dimensional commuting projector Hamiltonian realizing the chiral semion topological order (characterized by U(1)2 Chern-Simons theory). Our QCA is obtained by first constructing the Walker-Wang Hamiltonian of a certain premodular tensor category of order four, then condensing the deconfined bulk boson at the level of lattice operators. We show that the resulting Hamiltonian hosts chiral semion surface topological order in the presence of a boundary and can be realized as a non-Pauli stabilizer code on qubits, from which the QCA is defined. The construction is then generalized to a class of QCAs defined by non-Pauli stabilizer codes on 2n-dimensional qudits that feature surface anyons described by U(1)2n Chern-Simons theory. Our results support the conjecture that the group of nontrivial three-dimensional QCAs is isomorphic to the Witt group of non-degenerate braided fusion categories.

10aFOS: Physical sciences10aMathematical Physics (math-ph)10aQuantum Physics (quant-ph)10aStrongly Correlated Electrons (cond-mat.str-el)1 aShirley, Wilbur1 aChen, Yu-An1 aDua, Arpit1 aEllison, Tyler, D.1 aTantivasadakarn, Nathanan1 aWilliamson, Dominic, J. uhttps://arxiv.org/abs/2202.0544201797nas a2200229 4500008004100000245007000041210006800111260001400179300001200193490000800205520107400213653003701287653002701324653003901351653003101390100002101421700002401442700001901466700002301485700002201508856003701530 2022 eng d00aTweezer-programmable 2D quantum walks in a Hubbard-regime lattice0 aTweezerprogrammable 2D quantum walks in a Hubbardregime lattice c8/18/2022 a885-8890 v3773 a

Quantum walks provide a framework for understanding and designing quantum algorithms that is both intuitive and universal. To leverage the computational power of these walks, it is important to be able to programmably modify the graph a walker traverses while maintaining coherence. Here, we do this by combining the fast, programmable control provided by optical tweezer arrays with the scalable, homogeneous environment of an optical lattice. Using this new combination of tools we study continuous-time quantum walks of single atoms on a 2D square lattice, and perform proof-of-principle demonstrations of spatial search using these walks. When scaled to more particles, the capabilities demonstrated here can be extended to study a variety of problems in quantum information science and quantum simulation, including the deterministic assembly of ground and excited states in Hubbard models with tunable interactions, and performing versions of spatial search in a larger graph with increased connectivity, where search by quantum walk can be more effective.

10aAtomic Physics (physics.atom-ph)10aFOS: Physical sciences10aQuantum Gases (cond-mat.quant-gas)10aQuantum Physics (quant-ph)1 aYoung, Aaron, W.1 aEckner, William, J.1 aSchine, Nathan1 aChilds, Andrew, M.1 aKaufman, Adam, M. uhttps://arxiv.org/abs/2202.0120401963nas a2200205 4500008004100000245006300041210006200104260001400166520131600180653002701496653003901523653003101562100002401593700001901617700001801636700001901654700002501673700002201698856003701720 2022 eng d00aUltrastrong light-matter interaction in a photonic crystal0 aUltrastrong lightmatter interaction in a photonic crystal c9/29/20223 a

Harnessing the interaction between light and matter at the quantum level has been a central theme in the fields of atomic physics and quantum optics, with applications from quantum computation to quantum metrology. Combining complex interactions with photonic synthetic materials provides an opportunity to investigate novel quantum phases and phenomena, establishing interesting connections to condensed matter physics. Here we explore many-body phenomena with a single artificial atom coupled to the many discrete modes of a photonic crystal. This experiment reaches the ultrastrong light-matter coupling regime using the circuit QED paradigm, by galvanically coupling a highly nonlinear fluxonium qubit to a tight-binding lattice of microwave resonators. In this regime, the transport of a single photon is strongly modified by the presence of multi-photon bound states, owing to interactions that break particle number conservation. Exploiting the effective photon-photon interactions mediated by the qubit, the driven system can be configured as a continuous reservoir of strongly-correlated photons, a resource of interest for quantum networks. This work opens exciting prospects for exploring nonlinear quantum optics at the single-photon level and stabilizing entangled many-body phases of light.

10aFOS: Physical sciences10aQuantum Gases (cond-mat.quant-gas)10aQuantum Physics (quant-ph)1 aVrajitoarea, Andrei1 aBelyansky, Ron1 aLundgren, Rex1 aWhitsitt, Seth1 aGorshkov, Alexey, V.1 aHouck, Andrew, A. uhttps://arxiv.org/abs/2209.1497201811nas a2200205 4500008004100000245005900041210005900100260001300159490000600172520120100178653002701379653003501406653003101441100001601472700002101488700001501509700001901524700002501543856003701568 2022 eng d00aUniversal scattering with general dispersion relations0 aUniversal scattering with general dispersion relations c4/6/20220 v43 a

Many synthetic quantum systems allow particles to have dispersion relations that are neither linear nor quadratic functions. Here, we explore single-particle scattering in general spatial dimension D≥1 when the density of states diverges at a specific energy. To illustrate the underlying principles in an experimentally relevant setting, we focus on waveguide quantum electrodynamics (QED) problems (i.e. D=1) with dispersion relation ϵ(k)=±|d|km, where m≥2 is an integer. For a large class of these problems for any positive integer m, we rigorously prove that when there are no bright zero-energy eigenstates, the S-matrix evaluated at an energy E→0 converges to a universal limit that is only dependent on m. We also give a generalization of a key index theorem in quantum scattering theory known as Levinson's theorem -- which relates the scattering phases to the number of bound states -- to waveguide QED scattering for these more general dispersion relations. We then extend these results to general integer dimensions D≥1, dispersion relations ϵ(k)=|k|a for a D-dimensional momentum vector k with any real positive a, and separable potential scattering.

10aFOS: Physical sciences10aMathematical Physics (math-ph)10aQuantum Physics (quant-ph)1 aWang, Yidan1 aGullans, Michael1 aNa, Xuesen1 aWhitsitt, Seth1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/2103.0983001295nas a2200145 4500008004100000245008500041210006900126260001500195520080400210653002701014653003101041100002301072700001701095856003701112 2021 eng d00aFully device-independent quantum key distribution using synchronous correlations0 aFully deviceindependent quantum key distribution using synchrono c10/27/20213 a

We derive a device-independent quantum key distribution protocol based on synchronous correlations and their Bell inequalities. This protocol offers several advantages over other device-independent schemes including symmetry between the two users and no need for preshared randomness. We close a "synchronicity" loophole by showing that an almost synchronous correlation inherits the self-testing property of the associated synchronous correlation. We also pose a new security assumption that closes the "locality" (or "causality") loophole: an unbounded adversary with even a small uncertainty about the users' choice of measurement bases cannot produce any almost synchronous correlation that approximately maximally violates a synchronous Bell inequality.

10aFOS: Physical sciences10aQuantum Physics (quant-ph)1 aRodrigues, Nishant1 aLackey, Brad uhttps://arxiv.org/abs/2110.1453001833nas a2200217 4500008004100000245007400041210006900115260001500184490000800199520114200207653004301349653002701392653002901419653003101448100001801479700002101497700001901518700001901537700002201556856003701578 2021 eng d00aQuantum Algorithms for Reinforcement Learning with a Generative Model0 aQuantum Algorithms for Reinforcement Learning with a Generative  c12/15/20210 v1393 a

Reinforcement learning studies how an agent should interact with an environment to maximize its cumulative reward. A standard way to study this question abstractly is to ask how many samples an agent needs from the environment to learn an optimal policy for a γ-discounted Markov decision process (MDP). For such an MDP, we design quantum algorithms that approximate an optimal policy (π∗), the optimal value function (v∗), and the optimal Q-function (q∗), assuming the algorithms can access samples from the environment in quantum superposition. This assumption is justified whenever there exists a simulator for the environment; for example, if the environment is a video game or some other program. Our quantum algorithms, inspired by value iteration, achieve quadratic speedups over the best-possible classical sample complexities in the approximation accuracy (ϵ) and two main parameters of the MDP: the effective time horizon (11−γ) and the size of the action space (A). Moreover, we show that our quantum algorithm for computing q∗ is optimal by proving a matching quantum lower bound.

10aFOS: Computer and information sciences10aFOS: Physical sciences10aMachine Learning (cs.LG)10aQuantum Physics (quant-ph)1 aWang, Daochen1 aSundaram, Aarthi1 aKothari, Robin1 aKapoor, Ashish1 aRoetteler, Martin uhttps://arxiv.org/abs/2112.0845101780nas a2200181 4500008004100000245006700041210006600108260001500174520113500189653002701324653003101351653004701382653005201429100002201481700003201503700002601535856003701561 2021 eng d00aRelaxation of non-integrable systems and correlation functions0 aRelaxation of nonintegrable systems and correlation functions c12/17/20213 a

We investigate early-time equilibration rates of observables in closed many-body quantum systems and compare them to those of two correlation functions, first introduced by Kubo and Srednicki. We explore whether these different rates coincide at a universal value that sets the timescales of processes at a finite energy density. We find evidence for this coincidence when the initial conditions are sufficiently generic, or typical. We quantify this with the effective dimension of the state and with a state-observable effective dimension, which estimate the number of energy levels that participate in the dynamics. Our findings are confirmed by proving that these different timescales coincide for dynamics generated by Haar-random Hamiltonians. This also allows to quantitatively understand the scope of previous theoretical results on equilibration timescales and on random matrix formalisms. We approach this problem with exact, full spectrum diagonalization. The numerics are carried out in a non-integrable Heisenberg-like Hamiltonian, and the dynamics are investigated for several pairs of observables and states.

10aFOS: Physical sciences10aQuantum Physics (quant-ph)10aStatistical Mechanics (cond-mat.stat-mech)10aStrongly Correlated Electrons (cond-mat.str-el)1 aRiddell, Jonathon1 aGarcía-Pintos, Luis, Pedro1 aAlhambra, Álvaro, M. uhttps://arxiv.org/abs/2112.09475