01910nas a2200121 4500008004100000245008000041210006900121260001300190520150500203100002001708700002301728856003701751 2024 eng d00aQuantum One-Wayness of the Single-Round Sponge with Invertible Permutations0 aQuantum OneWayness of the SingleRound Sponge with Invertible Per c3/7/20243 a
Sponge hashing is a novel class of cryptographic hash algorithms which underlies the current international hash function standard SHA-3. In a nutshell, a sponge function takes as input a bit-stream of any length and processes it via a simple iterative procedure: it repeatedly feeds each block of the input into a so-called block function, and then produces a short digest which consists of a subset of the final output bits. While much is known about the post-quantum security of the sponge construction in the case when the block function is modeled as a random function or permutation, the case of invertible permutations, which more accurately models the construction underlying SHA-3, has so far remained a fundamental open problem.
In this work, we make new progress towards overcoming this barrier and show several results. First, we prove the "double-sided zero-search" conjecture proposed by Unruh (eprint' 2021) and show that finding zero-pairs in a random 2n-bit permutation requires at least Ω(2n/2) many queries -- and this is tight due to Grover's algorithm. At the core of our proof lies a novel "symmetrization argument" which uses insights from the theory of Young subgroups. Second, we consider more general variants of the double-sided search problem and show similar query lower bounds for them. As an application, we prove the quantum one-wayness of the single-round sponge with invertible permutations in the quantum random oracle model.
Quantum information science and technology (QIST) is a critical and emerging technology with the potential for enormous world impact and is currently invested in by over 40 nations. To bring these large-scale investments to fruition and bridge the lower technology readiness levels (TRLs) of fundamental research at universities to the high TRLs necessary to realize the promise of practical quantum advantage accessible to industry and the public, we present a roadmap for Quantum Technology Demonstration Projects (QTDPs). Such QTDPs, focused on intermediate TRLs, are large-scale public-private partnerships with a high probability of translation from laboratory to practice. They create technology demonstrating a clear 'quantum advantage' for science breakthroughs that are user-motivated and will provide access to a broad and diverse community of scientific users. Successful implementation of a program of QTDPs will have large positive economic impacts.
1 aAlsing, Paul1 aBattle, Phil1 aBienfang, Joshua, C.1 aBorders, Tammie1 aBrower-Thomas, Tina1 aCarr, Lincoln, D.1 aChong, Fred1 aDadras, Siamak1 aDeMarco, Brian1 aDeutsch, Ivan1 aFigueroa, Eden1 aFreedman, Danna1 aEveritt, Henry1 aGauthier, Daniel1 aJohnston-Halperin, Ezekiel1 aKim, Jungsang1 aKira, Mackillo1 aKumar, Prem1 aKwiat, Paul1 aLekki, John1 aLoiacono, Anjul1 aLončar, Marko1 aLowell, John, R.1 aLukin, Mikhail1 aMerzbacher, Celia1 aMiller, Aaron1 aMonroe, Christopher1 aPollanen, Johannes1 aPappas, David1 aRaymer, Michael1 aReano, Ronald1 aRodenburg, Brandon1 aSavage, Martin1 aSearles, Thomas1 aYe, Jun uhttps://arxiv.org/abs/2210.1475701769nas 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 aThe 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.0176601807nas a2200145 4500008004100000245009300041210006900134260001400203520133200217100001601549700002701565700001701592700001501609856003701624 2023 eng d00aAnalyzing Convergence in Quantum Neural Networks: Deviations from Neural Tangent Kernels0 aAnalyzing Convergence in Quantum Neural Networks Deviations from c3/26/20233 aA quantum neural network (QNN) is a parameterized mapping efficiently implementable on near-term Noisy Intermediate-Scale Quantum (NISQ) computers. It can be used for supervised learning when combined with classical gradient-based optimizers. Despite the existing empirical and theoretical investigations, the convergence of QNN training is not fully understood. Inspired by the success of the neural tangent kernels (NTKs) in probing into the dynamics of classical neural networks, a recent line of works proposes to study over-parameterized QNNs by examining a quantum version of tangent kernels. In this work, we study the dynamics of QNNs and show that contrary to popular belief it is qualitatively different from that of any kernel regression: due to the unitarity of quantum operations, there is a non-negligible deviation from the tangent kernel regression derived at the random initialization. As a result of the deviation, we prove the at-most sublinear convergence for QNNs with Pauli measurements, which is beyond the explanatory power of any kernel regression dynamics. We then present the actual dynamics of QNNs in the limit of over-parameterization. The new dynamics capture the change of convergence rate during training and implies that the range of measurements is crucial to the fast QNN convergence.
1 aYou, Xuchen1 aChakrabarti, Shouvanik1 aChen, Boyang1 aWu, Xiaodi uhttps://arxiv.org/abs/2303.1484401210nas a2200157 4500008004100000245004000041210003900081260001400120520077300134100002300907700001900930700002300949700002100972700002200993856003701015 2023 eng d00aCollision-resolved pressure sensing0 aCollisionresolved pressure sensing c3/17/20233 aHeat and pressure are ultimately transmitted via quantized degrees of freedom, like gas particles and phonons. While a continuous Brownian description of these noise sources is adequate to model measurements with relatively long integration times, sufficiently precise measurements can resolve the detailed time dependence coming from individual bath-system interactions. We propose the use of nanomechanical devices operated with impulse readout sensitivity around the ``standard quantum limit'' to sense ultra-low gas pressures by directly counting the individual collisions of gas particles on a sensor. We illustrate this in two paradigmatic model systems: an optically levitated nanobead and a tethered membrane system in a phononic bandgap shield.
1 aBarker, Daniel, S.1 aCarney, Daniel1 aLeBrun, Thomas, W.1 aMoore, David, C.1 aTaylor, Jacob, M. uhttps://arxiv.org/abs/2303.0992202369nas a2200145 4500008004100000245008400041210006900125260001500194520190500209100002002114700001602134700001802150700001802168856003702186 2023 eng d00aCompressed gate characterization for quantum devices with time-correlated noise0 aCompressed gate characterization for quantum devices with timeco c12/22/20233 aAs quantum devices make steady progress towards intermediate scale and fault-tolerant quantum computing, it is essential to develop rigorous and efficient measurement protocols that account for known sources of noise. Most existing quantum characterization protocols such as gate set tomography and randomized benchmarking assume the noise acting on the qubits is Markovian. However, this assumption is often not valid, as for the case of 1/f charge noise or hyperfine nuclear spin noise. Here, we present a general framework for quantum process tomography (QPT) in the presence of time-correlated noise. We further introduce fidelity benchmarks that quantify the relative strength of different sources of Markovian and non-Markovian noise. As an application of our method, we perform a comparative theoretical and experimental analysis of silicon spin qubits. We first develop a detailed noise model that accounts for the dominant sources of noise and validate the model against experimental data. Applying our framework for time-correlated QPT, we find that the number of independent parameters needed to characterize one and two-qubit gates can be compressed by 10x and 100x, respectively, when compared to the fully generic case. These compressions reduce the amount of tomographic measurements needed in experiment, while also significantly speeding up numerical simulations of noisy quantum circuit dynamics compared to time-dependent Hamiltonian simulation. Using this compressed noise model, we find good agreement between our theoretically predicted process fidelities and two qubit interleaved randomized benchmarking fidelities of 99.8% measured in recent experiments on silicon spin qubits. More broadly, our formalism can be directly extended to develop efficient and scalable tuning protocols for high-fidelity control of large-arrays of quantum devices with non-Markovian noise.
1 aGullans, M., J.1 aCaranti, M.1 aMills, A., R.1 aPetta, J., R. uhttps://arxiv.org/abs/2307.1443201850nas a2200337 4500008004100000245008100041210006900122260001500191520083900206100002401045700002201069700001801091700001801109700002001127700002301147700002301170700002301193700002301216700002301239700002501262700001801287700002201305700002401327700001701351700002501368700002101393700002301414700002101437700001701458856003701475 2023 eng d00aData Needs and Challenges of Quantum Dot Devices Automation: Workshop Report0 aData Needs and Challenges of Quantum Dot Devices Automation Work c12/21/20233 aGate-defined quantum dots are a promising candidate system to realize scalable, coupled qubit systems and serve as a fundamental building block for quantum computers. However, present-day quantum dot devices suffer from imperfections that must be accounted for, which hinders the characterization, tuning, and operation process. Moreover, with an increasing number of quantum dot qubits, the relevant parameter space grows sufficiently to make heuristic control infeasible. Thus, it is imperative that reliable and scalable autonomous tuning approaches are developed. In this report, we outline current challenges in automating quantum dot device tuning and operation with a particular focus on datasets, benchmarking, and standardization. We also present ideas put forward by the quantum dot community on how to overcome them.
1 aZwolak, Justyna, P.1 aTaylor, Jacob, M.1 aAndrews, Reed1 aBenson, Jared1 aBryant, Garnett1 aButerakos, Donovan1 aChatterjee, Anasua1 aSarma, Sankar, Das1 aEriksson, Mark, A.1 aGreplová, Eliška1 aGullans, Michael, J.1 aHader, Fabian1 aKovach, Tyler, J.1 aMundada, Pranav, S.1 aRamsey, Mick1 aRasmussen, Torbjoern1 aSeverin, Brandon1 aSigillito, Anthony1 aUndseth, Brennan1 aWeber, Brian uhttps://arxiv.org/abs/2312.1432200422nas a2200133 4500008004100000245006200041210006100103260001400164490000800178100002400186700001900210700002200229856003700251 2023 eng d00aDecoherence from Long-Range Forces in Atom Interferometry0 aDecoherence from LongRange Forces in Atom Interferometry c3/17/20230 v1071 aKunjummen, Jonathan1 aCarney, Daniel1 aTaylor, Jacob, M. uhttps://arxiv.org/abs/2205.0300601726nas a2200253 4500008004100000022001400041245005000055210005000105260001500155490000600170520104100176100002201217700002201239700001801261700002101279700001601300700001301316700002901329700001801358700002401376700001901400700001601419856003701435 2023 eng d a2375-254800aDigital quantum simulation of NMR experiments0 aDigital quantum simulation of NMR experiments c11/29/20230 v93 aSimulations of nuclear magnetic resonance (NMR) experiments can be an important tool for extracting information about molecular structure and optimizing experimental protocols but are often intractable on classical computers for large molecules such as proteins and for protocols such as zero-field NMR. We demonstrate the first quantum simulation of an NMR spectrum, computing the zero-field spectrum of the methyl group of acetonitrile using four qubits of a trapped-ion quantum computer. We reduce the sampling cost of the quantum simulation by an order of magnitude using compressed sensing techniques. We show how the intrinsic decoherence of NMR systems may enable the zero-field simulation of classically hard molecules on relatively near-term quantum hardware and discuss how the experimentally demonstrated quantum algorithm can be used to efficiently simulate scientifically and technologically relevant solid-state NMR experiments on more mature devices. Our work opens a practical application for quantum computation.
1 aSeetharam, Kushal1 aBiswas, Debopriyo1 aNoel, Crystal1 aRisinger, Andrew1 aZhu, Daiwei1 aKatz, Or1 aChattopadhyay, Sambuddha1 aCetina, Marko1 aMonroe, Christopher1 aDemler, Eugene1 aSels, Dries uhttps://arxiv.org/abs/2109.1329801347nas a2200145 4500008004100000245012000041210006900161260001500230520084500245100002401090700001301114700001801127700001901145856003701164 2023 eng d00aThe discrete adiabatic quantum linear system solver has lower constant factors than the randomized adiabatic solver0 adiscrete adiabatic quantum linear system solver has lower consta c12/12/20233 aThe solution of linear systems of equations is the basis of many other quantum algorithms, and recent results provided an algorithm with optimal scaling in both the condition number κ and the allowable error ϵ [PRX Quantum \textbf{3}, 0403003 (2022)]. That work was based on the discrete adiabatic theorem, and worked out an explicit constant factor for an upper bound on the complexity. Here we show via numerical testing on random matrices that the constant factor is in practice about 1,500 times smaller than the upper bound found numerically in the previous results. That means that this approach is far more efficient than might naively be expected from the upper bound. In particular, it is over an order of magnitude more efficient than using a randomised approach from [arXiv:2305.11352] that claimed to be more efficient.
1 aCosta, Pedro, C. S.1 aAn, Dong1 aBabbush, Ryan1 aBerry, Dominic uhttps://arxiv.org/abs/2312.0769001229nas a2200157 4500008004100000245007900041210006900120260001300189520074400202100001900946700001700965700001300982700002100995700001801016856003701034 2023 eng d00aEver more optimized simulations of fermionic systems on a quantum computer0 aEver more optimized simulations of fermionic systems on a quantu c3/6/20233 aDespite using a novel model of computation, quantum computers break down programs into elementary gates. Among such gates, entangling gates are the most expensive. In the context of fermionic simulations, we develop a suite of compilation and optimization techniques that massively reduce the entangling-gate counts. We exploit the well-studied non-quantum optimization algorithms to achieve up to 24\% savings over the state of the art for several small-molecule simulations, with no loss of accuracy or hidden costs. Our methodologies straightforwardly generalize to wider classes of near-term simulations of the ground state of a fermionic system or real-time simulations probing dynamical properties of a fermionic system.
1 aWang, Qingfeng1 aCian, Ze-Pei1 aLi, Ming1 aMarkov, Igor, L.1 aNam, Yunseong uhttps://arxiv.org/abs/2303.0346001715nas a2200181 4500008004100000245004900041210004900090260001400139300001200153490000600165520119200171653003801363653004301401100001401444700001901458700001901477856003701496 2023 eng d00aFat Pointers for Temporal Memory Safety of C0 aFat Pointers for Temporal Memory Safety of C c3/20/2023 a316-3470 v73 aTemporal memory safety bugs, especially use-after-free and double free bugs, pose a major security threat to C programs. Real-world exploits utilizing these bugs enable attackers to read and write arbitrary memory locations, causing disastrous violations of confidentiality, integrity, and availability. Many previous solutions retrofit temporal memory safety to C, but they all either incur high performance overhead and/or miss detecting certain types of temporal memory safety bugs.
In this paper, we propose a temporal memory safety solution that is both efficient and comprehensive. Specifically, we extend Checked C, a spatially-safe extension to C, with temporally-safe pointers. These are implemented by combining two techniques: fat pointers and dynamic key-lock checks. We show that the fat-pointer solution significantly improves running time and memory overhead compared to the disjoint-metadata approach that provides the same level of protection. With empirical program data and hands-on experience porting real-world applications, we also show that our solution is practical in terms of backward compatibility -- one of the major complaints about fat pointers.
Today's mechanical sensors are capable of detecting extremely weak perturbations while operating near the standard quantum limit. However, further improvements can be made in both sensitivity and bandwidth when we reduce the noise originating from the process of measurement itself -- the quantum-mechanical backaction of measurement -- and go below this 'standard' limit, possibly approaching the Heisenberg limit. One of the ways to eliminate this noise is by measuring a quantum nondemolition variable such as the momentum in a free-particle system. Here, we propose and characterize theoretical models for direct velocity measurement that utilize traditional electric and magnetic transducer designs to generate a signal while enabling this backaction evasion. We consider the general readout of this signal via electric or magnetic field sensing by creating toy models analogous to the standard optomechanical position-sensing problem, thereby facilitating the assessment of measurement-added noise. Using simple models that characterize a wide range of transducers, we find that the choice of readout scheme -- voltage or current -- for each mechanical detector configuration implies access to either the position or velocity of the mechanical sub-system. This in turn suggests a path forward for key fundamental physics experiments such as the direct detection of dark matter particles.
1 aRichman, Brittany1 aGhosh, Sohitri1 aCarney, Daniel1 aHiggins, Gerard1 aShawhan, Peter1 aLobb, C., J.1 aTaylor, Jacob, M. uhttps://arxiv.org/abs/2311.0958702329nas a2200133 4500008004100000245008800041210006900129260001400198520190700212100002402119700001602143700001502159856002102174 2023 eng d00aGeneralized Hybrid Search and Applications to Blockchain and Hash Function Security0 aGeneralized Hybrid Search and Applications to Blockchain and Has c11/7/20233 aIn this work we first examine the hardness of solving various search problems by hybrid quantum-classical strategies, namely, by algorithms that have both quantum and classical capabilities. We then construct a hybrid quantum-classical search algorithm and analyze its success probability. Regarding the former, for search problems that are allowed to have multiple solutions and in which the input is sampled according to arbitrary distributions we establish their hybrid quantum-classical query complexities -- i.e., given a fixed number of classical and quantum queries, determine what is the probability of solving the search task. At a technical level, our results generalize the framework for hybrid quantum-classical search algorithms proposed by Rosmanis. Namely, for an arbitrary distribution D on Boolean functions, the probability an algorithm equipped with τc classical and τq quantum queries succeeds in finding a preimage of 1 for a function sampled from D is at most νD⋅(2τc−−√+2τq+1)2, where νD captures the average (over D) fraction of preimages of 1. As applications of our hardness results, we first revisit and generalize the security of the Bitcoin protocol called the Bitcoin backbone, to a setting where the adversary has both quantum and classical capabilities, presenting a new hybrid honest majority condition necessary for the protocol to properly operate. Secondly, we examine the generic security of hash functions against hybrid adversaries. Regarding our second contribution, we design a hybrid algorithm which first spends all of its classical queries and in the second stage runs a ``modified Grover'' where the initial state depends on the distribution D. We show how to analyze its success probability for arbitrary target distributions and, importantly, its optimality for the uniform and the Bernoulli distribution cases.
1 aCojocaru, Alexandru1 aGaray, Juan1 aSong, Fang uarXiv:2311.0372301577nas a2200145 4500008004100000245006900041210006300110260001400173520112200187100002101309700002101330700001601351700002701367856003701394 2023 eng d00aHamiltonians whose low-energy states require $\Omega(n)$ T gates0 aHamiltonians whose lowenergy states require Omegan T gates c10/2/20233 aThe recent resolution of the NLTS Conjecture [ABN22] establishes a prerequisite to the Quantum PCP (QPCP) Conjecture through a novel use of newly-constructed QLDPC codes [LZ22]. Even with NLTS now solved, there remain many independent and unresolved prerequisites to the QPCP Conjecture, such as the NLSS Conjecture of [GL22]. In this work we focus on a specific and natural prerequisite to both NLSS and the QPCP Conjecture, namely, the existence of local Hamiltonians whose low-energy states all require ω(logn) T gates to prepare. In fact, we prove a stronger result which is not necessarily implied by either conjecture: we construct local Hamiltonians whose low-energy states require Ω(n) T gates. Following a previous work [CCNN23], we further show that our procedure can be applied to the NLTS Hamiltonians of [ABN22] to yield local Hamiltonians whose low-energy states require both Ω(logn)-depth and Ω(n) T gates to prepare. Our results utilize a connection between T-count and stabilizer groups, which was recently applied in the context of learning low T-count states [GIKL23a, GIKL23b, GIKL23c].
1 aCoble, Nolan, J.1 aCoudron, Matthew1 aNelson, Jon1 aNezhadi, Seyed, Sajjad uhttps://arxiv.org/abs/2310.0134701358nas a2200181 4500008004100000245010400041210006900145260001500214520076300229100002400992700002201016700001601038700001701054700002101071700002301092700002401115856003701139 2023 eng d00aIon Trap with In-Vacuum High Numerical Aperture Imaging for a Dual-Species Modular Quantum Computer0 aIon Trap with InVacuum High Numerical Aperture Imaging for a Dua c10/10/20233 aPhotonic interconnects between quantum systems will play a central role in both scalable quantum computing and quantum networking. Entanglement of remote qubits via photons has been demonstrated in many platforms; however, improving the rate of entanglement generation will be instrumental for integrating photonic links into modular quantum computers. We present an ion trap system that has the highest reported free-space photon collection efficiency for quantum networking. We use a pair of in-vacuum aspheric lenses, each with a numerical aperture of 0.8, to couple 10% of the 493 nm photons emitted from a 138Ba+ ion into single-mode fibers. We also demonstrate that proximal effects of the lenses on the ion position and motion can be mitigated.
1 aCarter, Allison, L.1 aO'Reilly, Jameson1 aToh, George1 aSaha, Sagnik1 aShalaev, Mikhail1 aGoetting, Isabella1 aMonroe, Christopher uhttps://arxiv.org/abs/2310.0705801454nas a2200145 4500008004100000245006000041210005900101260001400160520101200174100002101186700002101207700001601228700002701244856003701271 2023 eng d00aLocal Hamiltonians with no low-energy stabilizer states0 aLocal Hamiltonians with no lowenergy stabilizer states c2/28/20233 aThe recently-defined No Low-energy Sampleable States (NLSS) conjecture of Gharibian and Le Gall [GL22] posits the existence of a family of local Hamiltonians where all states of low-enough constant energy do not have succinct representations allowing perfect sampling access. States that can be prepared using only Clifford gates (i.e. stabilizer states) are an example of sampleable states, so the NLSS conjecture implies the existence of local Hamiltonians whose low-energy space contains no stabilizer states. We describe families that exhibit this requisite property via a simple alteration to local Hamiltonians corresponding to CSS codes. Our method can also be applied to the recent NLTS Hamiltonians of Anshu, Breuckmann, and Nirkhe [ABN22], resulting in a family of local Hamiltonians whose low-energy space contains neither stabilizer states nor trivial states. We hope that our techniques will eventually be helpful for constructing Hamiltonians which simultaneously satisfy NLSS and NLTS.
1 aCoble, Nolan, J.1 aCoudron, Matthew1 aNelson, Jon1 aNezhadi, Seyed, Sajjad uhttps://arxiv.org/abs/2302.1475501030nas a2200349 4500008004100000022001400041245006600055210006600121260001400187100002100201700002200222700002400244700001900268700001800287700001800305700001800323700001800341700002300359700002400382700002800406700002000434700001500454700001300469700002800482700002300510700002200533700002500555700002000580700002000600700002300620856003700643 2023 eng d a1476-468700aLogical quantum processor based on reconfigurable atom arrays0 aLogical quantum processor based on reconfigurable atom arrays c12/7/20231 aBluvstein, Dolev1 aEvered, Simon, J.1 aGeim, Alexandra, A.1 aLi, Sophie, H.1 aZhou, Hengyun1 aManovitz, Tom1 aEbadi, Sepehr1 aCain, Madelyn1 aKalinowski, Marcin1 aHangleiter, Dominik1 aAtaides, Pablo, Bonilla1 aMaskara, Nishad1 aCong, Iris1 aGao, Xun1 aRodriguez, Pedro, Sales1 aKarolyshyn, Thomas1 aSemeghini, Giulia1 aGullans, Michael, J.1 aGreiner, Markus1 aVuletic, Vladan1 aLukin, Mikhail, D. uhttps://arxiv.org/abs/2312.0398202307nas a2200181 4500008004100000245009700041210006900138260001400207520170500221100002401926700001801950700001901968700002901987700002502016700002402041700002302065856003702088 2023 eng d00aThe maximum refractive index of an atomic crystal - from quantum optics to quantum chemistry0 amaximum refractive index of an atomic crystal from quantum optic c3/20/20233 aAll known optical materials have an index of refraction of order unity. Despite the tremendous implications that an ultrahigh index could have for optical technologies, little research has been done on why the refractive index of materials is universally small, and whether this observation is fundamental. Here, we investigate the index of an ordered arrangement of atoms, as a function of atomic density. At dilute densities, this problem falls into the realm of quantum optics, where atoms do not interact with one another except via the scattering of light. On the other hand, when the lattice constant becomes comparable to the Bohr radius, the electronic orbitals begin to overlap, giving rise to quantum chemistry. We present a minimal model that allows for a unifying theory of index spanning these two regimes. A key aspect is the treatment of multiple light scattering, which can be highly non-perturbative over a large density range, and which is the reason that conventional theories of the index break down. In the quantum optics regime, we show that ideal light-matter interactions can have a single-mode nature, allowing for a purely real refractive index that grows with density as (N/V)1/3. At the onset of quantum chemistry, we show how two physical mechanisms (excited electron tunneling dynamics and the buildup of electronic density-density correlations) can open up inelastic or spatial multi-mode light scattering processes, which ultimately reduce the index back to order unity while introducing absorption. Around the onset of chemistry, our theory predicts that ultrahigh index (n∼30), low-loss materials could in principle be allowed by the laws of nature.
1 aAndreoli, Francesco1 aWindt, Bennet1 aGrava, Stefano1 aAndolina, Gian, Marcello1 aGullans, Michael, J.1 aHigh, Alexander, A.1 aChang, Darrick, E. uhttps://arxiv.org/abs/2303.1099802618nas a2200229 4500008004100000245007500041210006900116260001500185520193200200100001902132700002002151700002602171700001702197700001802214700001802232700002302250700002202273700001502295700001802310700002302328856003702351 2023 eng d00aMicrowave signal processing using an analog quantum reservoir computer0 aMicrowave signal processing using an analog quantum reservoir co c12/26/20233 aQuantum reservoir computing (QRC) has been proposed as a paradigm for performing machine learning with quantum processors where the training is efficient in the number of required runs of the quantum processor and takes place in the classical domain, avoiding the issue of barren plateaus in parameterized-circuit quantum neural networks. It is natural to consider using a quantum processor based on superconducting circuits to classify microwave signals that are analog -- continuous in time. However, while theoretical proposals of analog QRC exist, to date QRC has been implemented using circuit-model quantum systems -- imposing a discretization of the incoming signal in time, with each time point input by executing a gate operation. In this paper we show how a quantum superconducting circuit comprising an oscillator coupled to a qubit can be used as an analog quantum reservoir for a variety of classification tasks, achieving high accuracy on all of them. Our quantum system was operated without artificially discretizing the input data, directly taking in microwave signals. Our work does not attempt to address the question of whether QRCs could provide a quantum computational advantage in classifying pre-recorded classical signals. However, beyond illustrating that sophisticated tasks can be performed with a modest-size quantum system and inexpensive training, our work opens up the possibility of achieving a different kind of advantage than a purely computational advantage: superconducting circuits can act as extremely sensitive detectors of microwave photons; our work demonstrates processing of ultra-low-power microwave signals in our superconducting circuit, and by combining sensitive detection with QRC processing within the same system, one could achieve a quantum sensing-computational advantage, i.e., an advantage in the overall analysis of microwave signals comprising just a few photons.
1 aSenanian, Alen1 aPrabhu, Sridhar1 aKremenetski, Vladimir1 aRoy, Saswata1 aCao, Yingkang1 aKline, Jeremy1 aOnodera, Tatsuhiro1 aWright, Logan, G.1 aWu, Xiaodi1 aFatemi, Valla1 aMcMahon, Peter, L. uhttps://arxiv.org/abs/2312.1616601830nas a2200217 4500008004100000245007700041210006900118260001400187520122500201100001101426700001301437700001601450700001501466700001201481700001401493700001501507700002101522700001701543700001501560856003701575 2023 eng d00aNon-equilibrium critical scaling and universality in a quantum simulator0 aNonequilibrium critical scaling and universality in a quantum si c9/19/20233 aUniversality and scaling laws are hallmarks of equilibrium phase transitions and critical phenomena. However, extending these concepts to non-equilibrium systems is an outstanding challenge. Despite recent progress in the study of dynamical phases, the universality classes and scaling laws for non-equilibrium phenomena are far less understood than those in equilibrium. In this work, using a trapped-ion quantum simulator with single-ion resolution, we investigate the non-equilibrium nature of critical fluctuations following a quantum quench to the critical point. We probe the scaling of spin fluctuations after a series of quenches to the critical Hamiltonian of a long-range Ising model. With systems of up to 50 spins, we show that the amplitude and timescale of the post-quench fluctuations scale with system size with distinct universal critical exponents. While a generic quench can lead to thermal critical behaviour, we find that a second quench from one critical state to another (i.e. a double quench) results in critical behaviour that does not have an equilibrium counterpart. Our results demonstrate the ability of quantum simulators to explore universal scaling beyond the equilibrium paradigm.
1 aDe, A.1 aCook, P.1 aCollins, K.1 aMorong, W.1 aPaz, D.1 aTitum, P.1 aPagano, G.1 aGorshkov, A., V.1 aMaghrebi, M.1 aMonroe, C. uhttps://arxiv.org/abs/2309.1085602080nas a2200193 4500008004100000245009100041210006900132260001500201520147600216100002501692700001301717700001401730700001901744700001601763700002101779700002501800700002401825856003701849 2023 eng d00aObservation of a finite-energy phase transition in a one-dimensional quantum simulator0 aObservation of a finiteenergy phase transition in a onedimension c10/30/20233 aOne of the most striking many-body phenomena in nature is the sudden change of macroscopic properties as the temperature or energy reaches a critical value. Such equilibrium transitions have been predicted and observed in two and three spatial dimensions, but have long been thought not to exist in one-dimensional (1D) systems. Fifty years ago, Dyson and Thouless pointed out that a phase transition in 1D can occur in the presence of long-range interactions, but an experimental realization has so far not been achieved due to the requirement to both prepare equilibrium states and realize sufficiently long-range interactions. Here we report on the first experimental demonstration of a finite-energy phase transition in 1D. We use the simple observation that finite-energy states can be prepared by time-evolving product initial states and letting them thermalize under the dynamics of a many-body Hamiltonian. By preparing initial states with different energies in a 1D trapped-ion quantum simulator, we study the finite-energy phase diagram of a long-range interacting quantum system. We observe a ferromagnetic equilibrium phase transition as well as a crossover from a low-energy polarized paramagnet to a high-energy unpolarized paramagnet in a system of up to 23 spins, in excellent agreement with numerical simulations. Our work demonstrates the ability of quantum simulators to realize and study previously inaccessible phases at finite energy density.
1 aSchuckert, Alexander1 aKatz, Or1 aFeng, Lei1 aCrane, Eleanor1 aDe, Arinjoy1 aHafezi, Mohammad1 aGorshkov, Alexey, V.1 aMonroe, Christopher uhttps://arxiv.org/abs/2310.1986901569nas a2200169 4500008004100000245008700041210006900128260001400197520105800211100001301269700001701282700002201299700001201321700001401333700001501347856003701362 2023 eng d00aQafny: Quantum Program Verification Through Type-guided Classical Separation Logic0 aQafny Quantum Program Verification Through Typeguided Classical c7/12/20233 aFormal verification has been proven instrumental to ensure that quantum programs implement their specifications but often requires a significant investment of time and labor. To address this challenge, we present Qafny, an automated proof system designed for verifying quantum programs. At its core, Qafny uses a type-guided quantum proof system that translates quantum operations to classical array operations. By modeling these operations as proof rules within a classical separation logic framework, Qafny provides automated support for the reasoning process that would otherwise be tedious and time-consuming. We prove the soundness and completeness of our proof system and implement a prototype compiler that transforms Qafny programs both into the Dafny programming language and into executable quantum circuits. Using Qafny, we demonstrate how to efficiently verify prominent quantum algorithms, including quantum-walk algorithms, Grover's search algorithm, and Shor's factoring algorithm, with significantly reduced human efforts.
1 aLi, Liyi1 aZhu, Mingwei1 aCleaveland, Rance1 aLee, Yi1 aChang, Le1 aWu, Xiaodi uhttps://arxiv.org/abs/2211.0641101581nas a2200181 4500008004100000245006200041210006200103260001100165490000600176520106100182100002701243700002301270700001901293700001701312700001801329700001501347856003701362 2023 eng d00aQuantum algorithm for estimating volumes of convex bodies0 aQuantum algorithm for estimating volumes of convex bodies c4/20230 v43 aEstimating the volume of a convex body is a central problem in convex geometry and can be viewed as a continuous version of counting. We present a quantum algorithm that estimates the volume of an n-dimensional convex body within multiplicative error ε using O~(n3.5+n2.5/ε) queries to a membership oracle and O~(n5.5+n4.5/ε) additional arithmetic operations. For comparison, the best known classical algorithm uses O~(n4+n3/ε2) queries and O~(n6+n5/ε2) additional arithmetic operations. To the best of our knowledge, this is the first quantum speedup for volume estimation. Our algorithm is based on a refined framework for speeding up simulated annealing algorithms that might be of independent interest. This framework applies in the setting of "Chebyshev cooling", where the solution is expressed as a telescoping product of ratios, each having bounded variance. We develop several novel techniques when implementing our framework, including a theory of continuous-space quantum walks with rigorous bounds on discretization error.
1 aChakrabarti, Shouvanik1 aChilds, Andrew, M.1 aHung, Shih-Han1 aLi, Tongyang1 aWang, Chunhao1 aWu, Xiaodi uhttps://arxiv.org/abs/1908.0390301051nas a2200133 4500008004100000245010100041210006900142260001400211520060600225100001300831700002300844700001300867856003700880 2023 eng d00aQuantum algorithm for linear non-unitary dynamics with near-optimal dependence on all parameters0 aQuantum algorithm for linear nonunitary dynamics with nearoptima c12/6/20233 aWe introduce a family of identities that express general linear non-unitary evolution operators as a linear combination of unitary evolution operators, each solving a Hamiltonian simulation problem. This formulation can exponentially enhance the accuracy of the recently introduced linear combination of Hamiltonian simulation (LCHS) method [An, Liu, and Lin, Physical Review Letters, 2023]. For the first time, this approach enables quantum algorithms to solve linear differential equations with both optimal state preparation cost and near-optimal scaling in matrix queries on all parameters.
1 aAn, Dong1 aChilds, Andrew, M.1 aLin, Lin uhttps://arxiv.org/abs/2312.0391601818nas a2200169 4500008004100000020002200041245005100063210005100114300001600165490000800181520131000189100002301499700002101522700002501543700002401568856005601592 2023 eng d a978-3-95977-263-100aQuantum Algorithms and the Power of Forgetting0 aQuantum Algorithms and the Power of Forgetting a37:1--37:220 v2513 aThe so-called welded tree problem provides an example of a black-box problem that can be solved exponentially faster by a quantum walk than by any classical algorithm [Andrew M. Childs et al., 2003]. Given the name of a special entrance vertex, a quantum walk can find another distinguished exit vertex using polynomially many queries, though without finding any particular path from entrance to exit. It has been an open problem for twenty years whether there is an efficient quantum algorithm for finding such a path, or if the path-finding problem is hard even for quantum computers. We show that a natural class of efficient quantum algorithms provably cannot find a path from entrance to exit. Specifically, we consider algorithms that, within each branch of their superposition, always store a set of vertex labels that form a connected subgraph including the entrance, and that only provide these vertex labels as inputs to the oracle. While this does not rule out the possibility of a quantum algorithm that efficiently finds a path, it is unclear how an algorithm could benefit by deviating from this behavior. Our no-go result suggests that, for some problems, quantum algorithms must necessarily forget the path they take to reach a solution in order to outperform classical computation.
1 aChilds, Andrew, M.1 aCoudron, Matthew1 aGilani, Amin, Shiraz1 aKalai, Yael, Tauman uhttps://drops.dagstuhl.de/opus/volltexte/2023/1754002470nas a2200169 4500008004100000245007100041210006900112260001400181520193200195100002202127700002202149700002402171700002302195700002502218700002002243856003702263 2023 eng d00aQuantum Algorithms for Simulating Nuclear Effective Field Theories0 aQuantum Algorithms for Simulating Nuclear Effective Field Theori c12/8/20233 aQuantum computers offer the potential to simulate nuclear processes that are classically intractable. With the goal of understanding the necessary quantum resources, we employ state-of-the-art Hamiltonian-simulation methods, and conduct a thorough algorithmic analysis, to estimate the qubit and gate costs to simulate low-energy effective field theories (EFTs) of nuclear physics. In particular, within the framework of nuclear lattice EFT, we obtain simulation costs for the leading-order pionless and pionful EFTs. We consider both static pions represented by a one-pion-exchange potential between the nucleons, and dynamical pions represented by relativistic bosonic fields coupled to non-relativistic nucleons. We examine the resource costs for the tasks of time evolution and energy estimation for physically relevant scales. We account for model errors associated with truncating either long-range interactions in the one-pion-exchange EFT or the pionic Hilbert space in the dynamical-pion EFT, and for algorithmic errors associated with product-formula approximations and quantum phase estimation. Our results show that the pionless EFT is the least costly to simulate and the dynamical-pion theory is the costliest. We demonstrate how symmetries of the low-energy nuclear Hamiltonians can be utilized to obtain tighter error bounds on the simulation algorithm. By retaining the locality of nucleonic interactions when mapped to qubits, we achieve reduced circuit depth and substantial parallelization. We further develop new methods to bound the algorithmic error for classes of fermionic Hamiltonians that preserve the number of fermions, and demonstrate that reasonably tight Trotter error bounds can be achieved by explicitly computing nested commutators of Hamiltonian terms. This work highlights the importance of combining physics insights and algorithmic advancement in reducing quantum-simulation costs.
1 aWatson, James, D.1 aBringewatt, Jacob1 aShaw, Alexander, F.1 aChilds, Andrew, M.1 aGorshkov, Alexey, V.1 aDavoudi, Zohreh uhttps://arxiv.org/abs/2312.0534401920nas a2200169 4500008004100000245011700041210006900158260001400227520133400241100002001575700002401595700002101619700002001640700002701660700002601687856003701713 2023 eng d00aQuantum computation of dynamical quantum phase transitions and entanglement tomography in a lattice gauge theory0 aQuantum computation of dynamical quantum phase transitions and e c10/6/20233 aStrongly-coupled gauge theories far from equilibrium may exhibit unique features that could illuminate the physics of the early universe and of hadron and ion colliders. Studying real-time phenomena has proven challenging with classical-simulation methods, but is a natural application of quantum simulation. To demonstrate this prospect, we quantum compute non-equal time correlation functions and perform entanglement tomography of non-equilibrium states of a simple lattice gauge theory, the Schwinger model, using a trapped-ion quantum computer by IonQ Inc. As an ideal target for near-term devices, a recently-predicted [Zache et al., Phys. Rev. Lett. 122, 050403 (2019)] dynamical quantum phase transition in this model is studied by preparing, quenching, and tracking the subsequent non-equilibrium dynamics in three ways: i) overlap echos signaling dynamical transitions, ii) non-equal time correlation functions with an underlying topological nature, and iii) the entanglement structure of non-equilibrium states, including entanglement Hamiltonians. These results constitute the first observation of a dynamical quantum phase transition in a lattice gauge theory on a quantum computer, and are a first step toward investigating topological phenomena in nuclear and high-energy physics using quantum technologies.
1 aMueller, Niklas1 aCarolan, Joseph, A.1 aConnelly, Andrew1 aDavoudi, Zohreh1 aDumitrescu, Eugene, F.1 aYeter-Aydeniz, Kübra uhttps://arxiv.org/abs/2210.0308901522nas a2200145 4500008004100000245006600041210006500107260001300172520107900185100001701264700002501281700001701306700001601323856003701339 2023 eng d00aQuantum Lego Expansion Pack: Enumerators from Tensor Networks0 aQuantum Lego Expansion Pack Enumerators from Tensor Networks c8/9/20233 aWe provide the first tensor network method for computing quantum weight enumerator polynomials in the most general form. As a corollary, if a quantum code has a known tensor network construction of its encoding map, our method produces an algorithm that computes its distance. For non-(Pauli)-stabilizer codes, this constitutes the current best algorithm for computing the code distance. For degenerate stabilizer codes, it can provide up to an exponential speed up compared to the current methods. We also introduce a few novel applications of different weight enumerators. In particular, for any code built from the quantum lego method, we use enumerators to construct its (optimal) decoders under any i.i.d. single qubit or qudit error channels and discuss their applications for computing logical error rates. As a proof of principle, we perform exact analyses of the deformed surface codes, the holographic pentagon code, and the 2d Bacon-Shor code under (biased) Pauli noise and limited instances of coherent error at sizes that are inaccessible by brute force.
1 aCao, ChunJun1 aGullans, Michael, J.1 aLackey, Brad1 aWang, Zitao uhttps://arxiv.org/abs/2308.0515201594nas a2200217 4500008004100000245004000041210004000081260001400121520100000135100002101135700001601156700001501172700002201187700002001209700001901229700001901248700002501267700002201292700002501314856003701339 2023 eng d00aQuantum Sensing with Erasure Qubits0 aQuantum Sensing with Erasure Qubits c10/2/20233 aThe dominant noise in an "erasure qubit" is an erasure -- a type of error whose occurrence and location can be detected. Erasure qubits have potential to reduce the overhead associated with fault tolerance. To date, research on erasure qubits has primarily focused on quantum computing and quantum networking applications. Here, we consider the applicability of erasure qubits to quantum sensing and metrology. We show theoretically that, for the same level of noise, an erasure qubit acts as a more precise sensor or clock compared to its non-erasure counterpart. We experimentally demonstrate this by artificially injecting either erasure errors (in the form of atom loss) or dephasing errors into a differential optical lattice clock comparison, and observe enhanced precision in the case of erasure errors for the same injected error rate. Similar benefits of erasure qubits to sensing can be realized in other quantum platforms like Rydberg atoms and superconducting qubits
1 aNiroula, Pradeep1 aDolde, Jack1 aZheng, Xin1 aBringewatt, Jacob1 aEhrenberg, Adam1 aCox, Kevin, C.1 aThompson, Jeff1 aGullans, Michael, J.1 aKolkowitz, Shimon1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/2310.0151205435nas a2201621 4500008004100000245010800041210006900149260001500218520094500233100001801178700002301196700001601219700002801235700002001263700002001283700001601303700002001319700002101339700002401360700001901384700001901403700002601422700001801448700002301466700002101489700001601510700001701526700002101543700002301564700002101587700001601608700001701624700003101641700003401672700001801706700001801724700002101742700001801763700002401781700001801805700002001823700003501843700002201878700001601900700002001916700001901936700001701955700001901972700002301991700001802014700002402032700002302056700002302079700001802102700001702120700001902137700002602156700002002182700001902202700001902221700002302240700001802263700002202281700001802303700001902321700002802340700002402368700001902392700002002411700002002431700002702451700001202478700001702490700001502507700002102522700001802543700001902561700003202580700002402612700002202636700003102658700001702689700002302706700002402729700002002753700001902773700001902792700001602811700001702827700001802844700001802862700002002880700001902900700002302919700001902942700001702961700002602978700001603004700002003020700001603040700001803056700002803074700002103102700001803123700002403141700001403165700002303179700002003202700002103222700002003243700001803263700001803281700002103299700002103320700002303341700001803364700001803382700001403400700001903414700001603433700001503449700002003464700002103484700002103505700001703526700002803543700002203571700002303593700002603616700001503642700001703657700002303674700002403697700001803721700001703739700002003756856003703776 2023 eng d00aQuantum-centric Supercomputing for Materials Science: A Perspective on Challenges and Future Directions0 aQuantumcentric Supercomputing for Materials Science A Perspectiv c12/14/20233 aComputational models are an essential tool for the design, characterization, and discovery of novel materials. Hard computational tasks in materials science stretch the limits of existing high-performance supercomputing centers, consuming much of their simulation, analysis, and data resources. Quantum computing, on the other hand, is an emerging technology with the potential to accelerate many of the computational tasks needed for materials science. In order to do that, the quantum technology must interact with conventional high-performance computing in several ways: approximate results validation, identification of hard problems, and synergies in quantum-centric supercomputing. In this paper, we provide a perspective on how quantum-centric supercomputing can help address critical computational problems in materials science, the challenges to face in order to solve representative use cases, and new suggested directions.
1 aAlexeev, Yuri1 aAmsler, Maximilian1 aBaity, Paul1 aBarroca, Marco, Antonio1 aBassini, Sanzio1 aBattelle, Torey1 aCamps, Daan1 aCasanova, David1 aChoi, Young, jai1 aChong, Frederic, T.1 aChung, Charles1 aCodella, Chris1 aCorcoles, Antonio, D.1 aCruise, James1 aDi Meglio, Alberto1 aDubois, Jonathan1 aDuran, Ivan1 aEckl, Thomas1 aEconomou, Sophia1 aEidenbenz, Stephan1 aElmegreen, Bruce1 aFare, Clyde1 aFaro, Ismael1 aFernández, Cristina, Sanz1 aFerreira, Rodrigo, Neumann Ba1 aFuji, Keisuke1 aFuller, Bryce1 aGagliardi, Laura1 aGalli, Giulia1 aGlick, Jennifer, R.1 aGobbi, Isacco1 aGokhale, Pranav1 aGonzalez, Salvador, de la Puen1 aGreiner, Johannes1 aGropp, Bill1 aGrossi, Michele1 aGull, Emmanuel1 aHealy, Burns1 aHuang, Benchen1 aHumble, Travis, S.1 aIto, Nobuyasu1 aIzmaylov, Artur, F.1 aJavadi-Abhari, Ali1 aJennewein, Douglas1 aJha, Shantenu1 aJiang, Liang1 aJones, Barbara1 ade Jong, Wibe, Albert1 aJurcevic, Petar1 aKirby, William1 aKister, Stefan1 aKitagawa, Masahiro1 aKlassen, Joel1 aKlymko, Katherine1 aKoh, Kwangwon1 aKondo, Masaaki1 aKurkcuoglu, Doga, Murat1 aKurowski, Krzysztof1 aLaino, Teodoro1 aLandfield, Ryan1 aLeininger, Matt1 aLeyton-Ortega, Vicente1 aLi, Ang1 aLin, Meifeng1 aLiu, Junyu1 aLorente, Nicolas1 aLuckow, Andre1 aMartiel, Simon1 aMartin-Fernandez, Francisco1 aMartonosi, Margaret1 aMarvinney, Claire1 aMedina, Arcesio, Castaneda1 aMerten, Dirk1 aMezzacapo, Antonio1 aMichielsen, Kristel1 aMitra, Abhishek1 aMittal, Tushar1 aMoon, Kyungsun1 aMoore, Joel1 aMotta, Mario1 aNa, Young-Hye1 aNam, Yunseong1 aNarang, Prineha1 aOhnishi, Yu-ya1 aOttaviani, Daniele1 aOtten, Matthew1 aPakin, Scott1 aPascuzzi, Vincent, R.1 aPenault, Ed1 aPiontek, Tomasz1 aPitera, Jed1 aRall, Patrick1 aRavi, Gokul, Subramania1 aRobertson, Niall1 aRossi, Matteo1 aRydlichowski, Piotr1 aRyu, Hoon1 aSamsonidze, Georgy1 aSato, Mitsuhisa1 aSaurabh, Nishant1 aSharma, Vidushi1 aSharma, Kunal1 aShin, Soyoung1 aSlessman, George1 aSteiner, Mathias1 aSitdikov, Iskandar1 aSuh, In-Saeng1 aSwitzer, Eric1 aTang, Wei1 aThompson, Joel1 aTodo, Synge1 aTran, Minh1 aTrenev, Dimitar1 aTrott, Christian1 aTseng, Huan-Hsin1 aTureci, Esin1 aValinas, David, García1 aVallecorsa, Sofia1 aWever, Christopher1 aWojciechowski, Konrad1 aWu, Xiaodi1 aYoo, Shinjae1 aYoshioka, Nobuyuki1 aYu, Victor, Wen-zhe1 aYunoki, Seiji1 aZhuk, Sergiy1 aZubarev, Dmitry uhttps://arxiv.org/abs/2312.0973301610nas a2200157 4500008004100000245005000041210005000091260001300141490000800154520116900162100002401331700001901355700001901374700002201393856003701415 2023 eng d00aShadow process tomography of quantum channels0 aShadow process tomography of quantum channels c4/4/20230 v1073 aQuantum process tomography is a critical capability for building quantum computers, enabling quantum networks, and understanding quantum sensors. Like quantum state tomography, the process tomography of an arbitrary quantum channel requires a number of measurements that scale exponentially in the number of quantum bits affected. However, the recent field of shadow tomography, applied to quantum states, has demonstrated the ability to extract key information about a state with only polynomially many measurements. In this work, we apply the concepts of shadow state tomography to the challenge of characterizing quantum processes. We make use of the Choi isomorphism to directly apply rigorous bounds from shadow state tomography to shadow process tomography, and we find additional bounds on the number of measurements that are unique to process tomography. Our results, which include algorithms for implementing shadow process tomography enable new techniques including evaluation of channel concatenation and the application of channels to shadows of quantum states. This provides a dramatic improvement for understanding large-scale quantum systems.
1 aKunjummen, Jonathan1 aTran, Minh, C.1 aCarney, Daniel1 aTaylor, Jacob, M. uhttps://arxiv.org/abs/2110.0362901289nas a2200169 4500008004100000245004100041210004100082260001400123520084200137100002300979700001601002700001801018700001201036700001701048700001701065856003701082 2023 eng d00aStreaming quantum state purification0 aStreaming quantum state purification c9/28/20233 aQuantum state purification is the task of recovering a nearly pure copy of an unknown pure quantum state using multiple noisy copies of the state. This basic task has applications to quantum communication over noisy channels and quantum computation with imperfect devices, but has only been studied previously for the case of qubits. We derive an efficient purification procedure based on the swap test for qudits of any dimension, starting with any initial error parameter. Treating the initial error parameter and the dimension as constants, we show that our procedure has sample complexity asymptotically optimal in the final error parameter. Our protocol has a simple recursive structure that can be applied when the states are provided one at a time in a streaming fashion, requiring only a small quantum memory to implement.
1 aChilds, Andrew, M.1 aFu, Honghao1 aLeung, Debbie1 aLi, Zhi1 aOzols, Maris1 aVyas, Vedang uhttps://arxiv.org/abs/2309.1638701475nas a2200121 4500008004100000245003200041210003200073260001400105520115600119100001901275700002201294856003701316 2023 eng d00aStrongly incoherent gravity0 aStrongly incoherent gravity c1/20/20233 aWhile most fundamental interactions in nature are known to be mediated by quantized fields, the possibility has been raised that gravity may behave differently. Making this concept precise enough to test requires consistent models. Here we construct an explicit example of a theory where a non-entangling version of an arbitrary two-body potential V(r) arises from local measurements and feedback forces. While a variety of such theories exist, our construction causes particularly strong decoherence compared to more subtle approaches. Regardless, expectation values of observables obey the usual classical dynamics, while the interaction generates no entanglement. Applied to the Newtonian potential, this produces a non-relativistic model of gravity with fundamental loss of unitarity. The model contains a pair of free parameters, a substantial range of which is not excluded by observations to date. As an alternative to testing entanglement properties, we show that the entire remaining parameter space can be tested by looking for loss of quantum coherence in small systems like atom interferometers coupled to oscillating source masses.
1 aCarney, Daniel1 aTaylor, Jacob, M. uhttps://arxiv.org/abs/2301.0837801748nas a2200181 4500008004100000245008400041210006900125260001400194520113500208100002501343700002301368700003101391700002901422700002501451700002801476700002501504856003701529 2023 eng d00aThermally driven quantum refrigerator autonomously resets superconducting qubit0 aThermally driven quantum refrigerator autonomously resets superc c5/26/20233 aThe first thermal machines steered the industrial revolution, but their quantum analogs have yet to prove useful. Here, we demonstrate a useful quantum absorption refrigerator formed from superconducting circuits. We use it to reset a transmon qubit to a temperature lower than that achievable with any one available bath. The process is driven by a thermal gradient and is autonomous -- requires no external control. The refrigerator exploits an engineered three-body interaction between the target qubit and two auxiliary qudits coupled to thermal environments. The environments consist of microwave waveguides populated with synthesized thermal photons. The target qubit, if initially fully excited, reaches a steady-state excited-level population of 5×10−4±5×10−4 (an effective temperature of 23.5~mK) in about 1.6~μs. Our results epitomize how quantum thermal machines can be leveraged for quantum information-processing tasks. They also initiate a path toward experimental studies of quantum thermodynamics with superconducting circuits coupled to propagating thermal microwave fields.
1 aAamir, Mohammed, Ali1 aSuria, Paul, Jamet1 aGuzmán, José, Antonio Ma1 aCastillo-Moreno, Claudia1 aEpstein, Jeffrey, M.1 aHalpern, Nicole, Yunger1 aGasparinetti, Simone uhttps://arxiv.org/abs/2305.1671001108nas a2200145 4500008004100000245001300041210001300054260001500067520075200082100002200834700002100856700002500877700002300902856003700925 2023 eng d00aÆ codes0 aÆ codes c11/21/20233 aDiatomic molecular codes [{arXiv:1911.00099}] are designed to encode quantum information in the orientation of a diatomic molecule, allowing error correction from small torques and changes in angular momentum. Here, we directly study noise native to atomic and molecular platforms -- spontaneous emission, stray electromagnetic fields, and Raman scattering -- and derive simple necessary and sufficient conditions for codes to protect against such noise. We identify existing and develop new absorption-emission (Æ) codes that are more practical than molecular codes, require lower average momentum, can directly protect against photonic processes up to arbitrary order, and are applicable to a broader set of atomic and molecular systems.
1 aJain, Shubham, P.1 aHudson, Eric, R.1 aCampbell, Wesley, C.1 aAlbert, Victor, V. uhttps://arxiv.org/abs/2311.1232402721nas a2200253 4500008004100000245016100041210006900202260001400271300001100285490000600296520192600302100002002228700001502248700001802263700001902281700001802300700001902318700001602337700002102353700001402374700002202388700002002410856003702430 2022 eng d00aAccurate and Efficient Quantum Computations of Molecular Properties Using Daubechies Wavelet Molecular Orbitals: A Benchmark Study against Experimental Data0 aAccurate and Efficient Quantum Computations of Molecular Propert c5/28/2022 a0203600 v33 aAlthough quantum computation (QC) is regarded as a promising numerical method for computational quantum chemistry, current applications of quantum-chemistry calculations on quantum computers are limited to small molecules. This limitation can be ascribed to technical problems in building and manipulating more qubits and the associated complicated operations of quantum gates in a quantum circuit when the size of the molecular system becomes large. As a result, reducing the number of required qubits is necessary to make QC practical. Currently, the minimal STO-3G basis set is commonly used in benchmark studies because it requires the minimum number of spin orbitals. Nonetheless, the accuracy of using STO-3G is generally low and thus cannot provide useful predictions. We propose to adopt Daubechies wavelet functions as an accurate and efficient method for QCs of molecular electronic properties. We demonstrate that a minimal basis set constructed from Daubechies wavelet basis can yield accurate results through a better description of the molecular Hamiltonian, while keeping the number of spin orbitals minimal. With the improved Hamiltonian through Daubechies wavelets, we calculate vibrational frequencies for H2 and LiH using quantum-computing algorithm to show that the results are in excellent agreement with experimental data. As a result, we achieve quantum calculations in which accuracy is comparable with that of the full configuration interaction calculation using the cc-pVDZ basis set, whereas the computational cost is the same as that of a STO-3G calculation. Thus, our work provides a more efficient and accurate representation of the molecular Hamiltonian for efficient QCs of molecular systems, and for the first time demonstrates that predictions in agreement with experimental measurements are possible to be achieved with quantum resources available in near-term quantum computers.
1 aHong, Cheng-Lin1 aTsai, Ting1 aChou, Jyh-Pin1 aChen, Peng-Jen1 aTsai, Pei-Kai1 aChen, Yu-Cheng1 aKuo, En-Jui1 aSrolovitz, David1 aHu, Alice1 aCheng, Yuan-Chung1 aGoan, Hsi-Sheng uhttps://arxiv.org/abs/2205.1447600825nam a2200145 4500008004100000245007900041210006900120260002000189300001100209520027900220100002400499700002100523700002800544856010700572 2022 eng d00aAnalogue Quantum Simulation: A New Instrument for Scientific Understanding0 aAnalogue Quantum Simulation A New Instrument for Scientific Unde bSpringer Nature a83-1023 aAnalyzes analogue quantum simulation philosophically. Provides a framework to support the goals of scientists. Useful to both working scientists and philosophers of science.
1 aHangleiter, Dominik1 aCarolan, Jacques1 aThébault, Karim, P. Y. uhttps://quics.umd.edu/publications/analogue-quantum-simulation-new-instrument-scientific-understanding02622nas 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 aWe 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.
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 aMeasurements 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.0624802117nas a2200157 4500008004100000245008300041210006900124260001400193490000800207520162900215100002301844700001601867700001801883700002101901856003701922 2022 eng d00aClassification of (2+1)D invertible fermionic topological phases with symmetry0 aClassification of 21D invertible fermionic topological phases wi c5/30/20220 v1053 aWe provide a classification of invertible topological phases of interacting fermions with symmetry in two spatial dimensions for general fermionic symmetry groups Gf and general values of the chiral central charge c−. Here Gf is a central extension of a bosonic symmetry group Gb by fermion parity, (−1)F, specified by a second cohomology class [ω2]∈H2(Gb,Z2). Our approach proceeds by gauging fermion parity and classifying the resulting Gb symmetry-enriched topological orders while keeping track of certain additional data and constraints. We perform this analysis through two perspectives, using G-crossed braided tensor categories and Spin(2c−)1 Chern-Simons theory coupled to a background G gauge field. These results give a way to characterize and classify invertible fermionic topological phases in terms of a concrete set of data and consistency equations, which is more physically transparent and computationally simpler than the more abstract methods using cobordism theory and spectral sequences. Our results also generalize and provide a different approach to the recent classification of fermionic symmetry-protected topological phases by Wang and Gu, which have chiral central charge c−=0. We show how the 10-fold way classification of topological insulators and superconductors fits into our scheme, along with general non-perturbative constraints due to certain choices of c− and Gf. Mathematically, our results also suggest an explicit general parameterization of deformation classes of (2+1)D invertible topological quantum field theories with Gf symmetry.
1 aBarkeshli, Maissam1 aChen, Yu-An1 aHsin, Po-Shen1 aManjunath, Naren uhttps://arxiv.org/abs/2109.1103902045nas a2200337 4500008004100000245009200041210006900133260001500202300001100217490000800228520091000236100001301146700001301159700001401172700001701186700002001203700001401223700001401237700001601251700001901267700001801286700001701304700002101321700001501342700002001357700001701377700001701394700001801411700001801429856026001447 2022 eng d00aClosing the Locality and Detection Loopholes in Multiparticle Entanglement Self-Testing0 aClosing the Locality and Detection Loopholes in Multiparticle En c06/23/2022 a2504010 v1283 aFirst proposed by Mayers and Yao, self-testing provides a certification method to infer the underlying physics of quantum experiments in a black-box scenario. Numerous demonstrations have been reported to self-test various types of entangled states. However, all the multiparticle self-testing experiments reported so far suffer from both detection and locality loopholes. Here, we report the first experimental realization of multiparticle entanglement self-testing closing the locality loophole in a photonic system, and the detection loophole in a superconducting system, respectively. We certify three-party and four-party GHZ states with at least 0.84 (1) and 0.86 (3) fidelities in a device-independent way. These results can be viewed as a meaningful advance in multiparticle loophole-free self-testing, and also significant progress on the foundations of quantum entanglement certification.
1 aWu, Dian1 aZhao, Qi1 aWang, Can1 aHuang, Liang1 aJiang, Yang-Fan1 aBai, Bing1 aZhou, You1 aGu, Xue-Mei1 aLiu, Feng-Ming1 aMao, Ying-Qiu1 aSun, Qi-Chao1 aChen, Ming-Cheng1 aZhang, Jun1 aPeng, Cheng-Zhi1 aZhu, Xiao-Bo1 aZhang, Qiang1 aLu, Chao-Yang1 aPan, Jian-Wei uhttps://www.researchgate.net/profile/Dian-Wu/publication/361497881_Closing_the_Locality_and_Detection_Loopholes_in_Multiparticle_Entanglement_Self-Testing/links/62b55a8c1010dc02cc57530c/Closing-the-Locality-and-Detection-Loopholes-in-Multiparticle-Entangl02685nas 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.0736701840nas a2200253 4500008004100000245006100041210006000102260001400162520102500176653002701201653003901228653003101267653004701298653005201345100001401397700001301411700001701424700002301441700002501464700001801489700001801507700002401525856003701549 2022 eng d00aContinuous Symmetry Breaking in a Trapped-Ion Spin Chain0 aContinuous Symmetry Breaking in a TrappedIon Spin Chain c11/2/20223 aOne-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.0127501748nas a2200133 4500008004100000245008100041210006900122260001400191520131400205100001601519700002701535700001501562856003701577 2022 eng d00aA Convergence Theory for Over-parameterized Variational Quantum Eigensolvers0 aConvergence Theory for Overparameterized Variational Quantum Eig c5/25/20223 aThe Variational Quantum Eigensolver (VQE) is a promising candidate for quantum applications on near-term Noisy Intermediate-Scale Quantum (NISQ) computers. Despite a lot of empirical studies and recent progress in theoretical understanding of VQE's optimization landscape, the convergence for optimizing VQE is far less understood. We provide the first rigorous analysis of the convergence of VQEs in the over-parameterization regime. By connecting the training dynamics with the Riemannian Gradient Flow on the unit-sphere, we establish a threshold on the sufficient number of parameters for efficient convergence, which depends polynomially on the system dimension and the spectral ratio, a property of the problem Hamiltonian, and could be resilient to gradient noise to some extent. We further illustrate that this overparameterization threshold could be vastly reduced for specific VQE instances by establishing an ansatz-dependent threshold paralleling our main result. We showcase that our ansatz-dependent threshold could serve as a proxy of the trainability of different VQE ansatzes without performing empirical experiments, which hence leads to a principled way of evaluating ansatz design. Finally, we conclude with a comprehensive empirical study that supports our theoretical findings
1 aYou, Xuchen1 aChakrabarti, Shouvanik1 aWu, Xiaodi uhttps://arxiv.org/abs/2205.1248101033nas a2200193 4500008004100000245005300041210005300094260001300147520041400160653002700574653004200601653002900643653003100672653005200703100001400755700001700769700001600786856003700802 2022 eng d00aDeconfinement and Error Thresholds in Holography0 aDeconfinement and Error Thresholds in Holography c2/9/20223 aWe 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 aQuantum 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.0569102428nas 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 aEfficient 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.0690401492nas a2200181 4500008004100000245008600041210006900127260001500196490000600211520094800217100001601165700002301181700002101204700001701225700001701242700001401259856003701273 2022 eng d00aEfficient Product Formulas for Commutators and Applications to Quantum Simulation0 aEfficient Product Formulas for Commutators and Applications to Q c03/10/20220 v43 aWe construct product formulas for exponentials of commutators and explore their applications. First, we directly construct a third-order product formula with six exponentials by solving polynomial equations obtained using the operator differential method. We then derive higher-order product formulas recursively from the third-order formula. We improve over previous recursive constructions, reducing the number of gates required to achieve the same accuracy. In addition, we demonstrate that the constituent linear terms in the commutator can be included at no extra cost. As an application, we show how to use the product formulas in a digital protocol for counterdiabatic driving, which increases the fidelity for quantum state preparation. We also discuss applications to quantum simulation of one-dimensional fermion chains with nearest- and next-nearest-neighbor hopping terms, and two-dimensional fractional quantum Hall phases.
1 aChen, Yu-An1 aChilds, Andrew, M.1 aHafezi, Mohammad1 aJiang, Zhang1 aKim, Hwanmun1 aXu, Yijia uhttps://arxiv.org/abs/2111.1217701455nas a2200205 4500008004100000245006000041210005900101260001500160520078600175653002100961653002700982653003501009653003001044653003101074653005201105100001601157700002501173700001401198856003701212 2022 eng d00aError-correcting codes for fermionic quantum simulation0 aErrorcorrecting codes for fermionic quantum simulation c10/16/20223 aWe 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.0841102202nas a2200145 4500008004100000245009100041210006900132260001400201490000800215520174200223100001501965700001601980700002301996856003702019 2022 eng d00aEuler-obstructed Cooper pairing: Nodal superconductivity and hinge Majorana zero modes0 aEulerobstructed Cooper pairing Nodal superconductivity and hinge c3/29/20220 v1053 aSince the proposal of monopole Cooper pairing in [Phys. Rev. Lett. 120, 067003 (2018)], considerable research efforts have been dedicated to the study of Cooper pairing order parameters constrained (or obstructed) by the nontrivial normal-state band topology at Fermi surfaces in 3D systems. In the current work, we generalize the topologically obstructed pairings between Chern states (like the monopole Cooper pairing) by proposing Euler obstructed Cooper pairing in 3D systems. The Euler obstructed Cooper pairing widely exists between two Fermi surfaces with nontrivial band topology characterized by nonzero Euler numbers; such Fermi surfaces can exist in 3D PT-protected spinless-Dirac/nodal-line semimetals with negligible spin-orbit coupling, where PT is the space-time inversion symmetry. An Euler obstructed pairing channel must have pairing nodes on the pairing-relevant Fermi surfaces, and the total winding number of the pairing nodes is determined by the sum or difference of the Euler numbers on the Fermi surfaces. In particular, we find that when the normal state is time-reversal invariant and the pairing is weak, a sufficiently-dominant Euler obstructed pairing channel with zero total momentum leads to nodal superconductivity. If the Fermi surface splitting is small, the resultant nodal superconductor hosts hinge Majorana zero modes. The possible dominance of the Euler obstructed pairing channel near the superconducting transition and the robustness of the hinge Majorana zero modes against disorder are explicitly demonstrated using effective or tight-binding models. Our work presents the first class of higher-order nodal superconductivity originating from the topologically obstructed Cooper pairing.
1 aYu, Jiabin1 aChen, Yu-An1 aSarma, Sankar, Das uhttps://arxiv.org/abs/2109.0268501498nas a2200301 4500008004100000245006800041210006800109260001400177520060600191653002700797653004400824653003100868100001700899700001600916700002500932700001800957700001300975700001800988700001901006700002101025700001401046700002201060700001601082700001901098700001801117700002401135856003701159 2022 eng d00aExperimental Implementation of an Efficient Test of Quantumness0 aExperimental Implementation of an Efficient Test of Quantumness c9/28/20223 aA 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.1431601749nas 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 aAn 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.1430201846nas 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 aWe 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.
The algorithmic error of digital quantum simulations is usually explored in terms of the spectral norm distance between the actual and ideal evolution operators. In practice, this worst-case error analysis may be unnecessarily pessimistic. To address this, we develop a theory of average-case performance of Hamiltonian simulation with random initial states. We relate the average-case error to the Frobenius norm of the multiplicative error and give upper bounds for the product formula (PF) and truncated Taylor series methods. As applications, we estimate average-case error for digital Hamiltonian simulation of general lattice Hamiltonians and k-local Hamiltonians. In particular, for the nearest-neighbor Heisenberg chain with n spins, the error is quadratically reduced from O(n) in the worst case to O(n−−√) on average for both the PF method and the Taylor series method. Numerical evidence suggests that this theory accurately characterizes the average error for concrete models. We also apply our results to error analysis in the simulation of quantum scrambling.
1 aZhao, Qi1 aZhou, You1 aShaw, Alexander, F.1 aLi, Tongyang1 aChilds, Andrew, M. uhttps://arxiv.org/abs/2111.0477302101nas 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 aA 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.1176401951nas a2200217 4500008004100000245008300041210006900124260001500193490000600208520129200214100002001506700002301526700001701549700002201566700002401588700002301612700001301635700002301648700002501671856003701696 2022 eng d00aImplementing a Fast Unbounded Quantum Fanout Gate Using Power-Law Interactions0 aImplementing a Fast Unbounded Quantum Fanout Gate Using PowerLaw c10/27/20220 v43 aThe standard circuit model for quantum computation presumes the ability to directly perform gates between arbitrary pairs of qubits, which is unlikely to be practical for large-scale experiments. Power-law interactions with strength decaying as 1/rα in the distance r provide an experimentally realizable resource for information processing, whilst still retaining long-range connectivity. We leverage the power of these interactions to implement a fast quantum fanout gate with an arbitrary number of targets. Our implementation allows the quantum Fourier transform (QFT) and Shor's algorithm to be performed on a D-dimensional lattice in time logarithmic in the number of qubits for interactions with α≤D. As a corollary, we show that power-law systems with α≤D are difficult to simulate classically even for short times, under a standard assumption that factoring is classically intractable. Complementarily, we develop a new technique to give a general lower bound, linear in the size of the system, on the time required to implement the QFT and the fanout gate in systems that are constrained by a linear light cone. This allows us to prove an asymptotically tighter lower bound for long-range systems than is possible with previously available techniques.
1 aGuo, Andrew, Y.1 aDeshpande, Abhinav1 aChu, Su-Kuan1 aEldredge, Zachary1 aBienias, Przemyslaw1 aDevulapalli, Dhruv1 aSu, Yuan1 aChilds, Andrew, M.1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/2007.0066200508nas a2200169 4500008004100000245006400041210006300105260001400168300001200182490000800194100001600202700001800218700001800236700002200254700002500276856003700301 2022 eng d00aKramers' degeneracy for open systems in thermal equilibrium0 aKramers degeneracy for open systems in thermal equilibrium c3/10/2022 aL1211040 v1051 aLieu, Simon1 aMcGinley, Max1 aShtanko, Oles1 aCooper, Nigel, R.1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/2105.0288802540nas a2200229 4500008004100000245009600041210006900137260001300206490000700219520184300226100002102069700001802090700001402108700001502122700002802137700002302165700002302188700002402211700001802235700002002253856003702273 2022 eng d00aMany-Body Quantum Teleportation via Operator Spreading in the Traversable Wormhole Protocol0 aManyBody Quantum Teleportation via Operator Spreading in the Tra c8/5/20220 v123 aBy leveraging shared entanglement between a pair of qubits, one can teleport a quantum state from one particle to another. Recent advances have uncovered an intrinsically many-body generalization of quantum teleportation, with an elegant and surprising connection to gravity. In particular, the teleportation of quantum information relies on many-body dynamics, which originate from strongly-interacting systems that are holographically dual to gravity; from the gravitational perspective, such quantum teleportation can be understood as the transmission of information through a traversable wormhole. Here, we propose and analyze a new mechanism for many-body quantum teleportation -- dubbed peaked-size teleportation. Intriguingly, peaked-size teleportation utilizes precisely the same type of quantum circuit as traversable wormhole teleportation, yet has a completely distinct microscopic origin: it relies upon the spreading of local operators under generic thermalizing dynamics and not gravitational physics. We demonstrate the ubiquity of peaked-size teleportation, both analytically and numerically, across a diverse landscape of physical systems, including random unitary circuits, the Sachdev-Ye-Kitaev model (at high temperatures), one-dimensional spin chains and a bulk theory of gravity with stringy corrections. Our results pave the way towards using many-body quantum teleportation as a powerful experimental tool for: (i) characterizing the size distributions of operators in strongly-correlated systems and (ii) distinguishing between generic and intrinsically gravitational scrambling dynamics. To this end, we provide a detailed experimental blueprint for realizing many-body quantum teleportation in both trapped ions and Rydberg atom arrays; effects of decoherence and experimental imperfections are analyzed.
1 aSchuster, Thomas1 aKobrin, Bryce1 aGao, Ping1 aCong, Iris1 aKhabiboulline, Emil, T.1 aLinke, Norbert, M.1 aLukin, Mikhail, D.1 aMonroe, Christopher1 aYoshida, Beni1 aYao, Norman, Y. uhttps://arxiv.org/abs/2102.0001001919nas 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 aIntroducing 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.1183901181nas a2200145 4500008004100000245008000041210006900121260001300190490000800203520073200211100001300943700001800956700002400974856003700998 2022 eng d00aN-body interactions between trapped ion qubits via spin-dependent squeezing0 aNbody interactions between trapped ion qubits via spindependent c8/5/20220 v1293 aWe describe a simple protocol for the single-step generation of N-body entangling interactions between trapped atomic ion qubits. We show that qubit state-dependent squeezing operations and displacement forces on the collective atomic motion can generate full N-body interactions. Similar to the Mølmer-Sørensen two-body Ising interaction at the core of most trapped ion quantum computers and simulators, the proposed operation is relatively insensitive to the state of motion. We show how this N-body gate operation allows the single-step implementation of a family of N-bit gate operations such as the powerful N-Toffoli gate, which flips a single qubit if and only if all other N-1 qubits are in a particular state.
1 aKatz, Or1 aCetina, Marko1 aMonroe, Christopher uhttps://arxiv.org/abs/2202.0423001875nas 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 aRecently, 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.0815201827nas a2200181 4500008004100000245005500041210005500096260001400151490000600165520130500171100002301476700001601499700001501515700002001530700003001550700002801580856003701608 2022 eng d00aPauli Stabilizer Models of Twisted Quantum Doubles0 aPauli Stabilizer Models of Twisted Quantum Doubles c3/30/20220 v33 aWe construct a Pauli stabilizer model for every two-dimensional Abelian topological order that admits a gapped boundary. Our primary example is a Pauli stabilizer model on four-dimensional qudits that belongs to the double semion (DS) phase of matter. The DS stabilizer Hamiltonian is constructed by condensing an emergent boson in a Z4 toric code, where the condensation is implemented by making certain two-body measurements. We rigorously verify the topological order of the DS stabilizer model by identifying an explicit finite-depth quantum circuit (with ancillary qubits) that maps its ground state subspace to that of a DS string-net model. We show that the construction of the DS stabilizer Hamiltonian generalizes to all twisted quantum doubles (TQDs) with Abelian anyons. This yields a Pauli stabilizer code on composite-dimensional qudits for each such TQD, implying that the classification of topological Pauli stabilizer codes extends well beyond stacks of toric codes - in fact, exhausting all Abelian anyon theories that admit a gapped boundary. We also demonstrate that symmetry-protected topological phases of matter characterized by type I and type II cocycles can be modeled by Pauli stabilizer Hamiltonians by gauging certain 1-form symmetries of the TQD stabilizer models.
1 aEllison, Tyler, D.1 aChen, Yu-An1 aDua, Arpit1 aShirley, Wilbur1 aTantivasadakarn, Nathanan1 aWilliamson, Dominic, J. uhttps://arxiv.org/abs/2112.1139402246nas a2200205 4500008004100000245006600041210006600107260001400173520157400187653002701761653003101788653005201819100002301871700001601894700001501910700002001925700003001945700002801975856003702003 2022 eng d00aPauli topological subsystem codes from Abelian anyon theories0 aPauli topological subsystem codes from Abelian anyon theories c11/7/20223 aWe 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 aWe 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].
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.
We introduce a flexible and graphically intuitive framework that constructs complex quantum error correction codes from simple codes or states, generalizing code concatenation. More specifically, we represent the complex code constructions as tensor networks built from the tensors of simple codes or states in a modular fashion. Using a set of local moves known as operator pushing, one can derive properties of the more complex codes, such as transversal non-Clifford gates, by tracing the flow of operators in the network. The framework endows a network geometry to any code it builds and is valid for constructing stabilizer codes as well as non-stabilizer codes over qubits and qudits. For a contractible tensor network, the sequence of contractions also constructs a decoding/encoding circuit. To highlight the framework's range of capabilities and to provide a tutorial, we lay out some examples where we glue together simple stabilizer codes to construct non-trivial codes. These examples include the toric code and its variants, a holographic code with transversal non-Clifford operators, a 3d stabilizer code, and other stabilizer codes with interesting properties. Surprisingly, we find that the surface code is equivalent to the 2d Bacon-Shor code after "dualizing" its tensor network encoding map.
1 aCao, ChunJun1 aLackey, Brad uhttps://arxiv.org/abs/2109.0815801921nas 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 aMany 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 aWe 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 aIt 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.0338102005nas a2200181 4500008004100000245004600041210004500087260001400132300000800146490000600154520152300160100002301683700001601706700001701722700001801739700001801757856004801775 2022 eng d00aQuantum simulation of real-space dynamics0 aQuantum simulation of realspace dynamics c11/8/2022 a8600 v63 aQuantum simulation is a prominent application of quantum computers. While there is extensive previous work on simulating finite-dimensional systems, less is known about quantum algorithms for real-space dynamics. We conduct a systematic study of such algorithms. In particular, we show that the dynamics of a d-dimensional Schrödinger equation with η particles can be simulated with gate complexity O~(ηdFpoly(log(g′/ϵ))), where ϵ is the discretization error, g′ controls the higher-order derivatives of the wave function, and F measures the time-integrated strength of the potential. Compared to the best previous results, this exponentially improves the dependence on ϵ and g′ from poly(g′/ϵ) to poly(log(g′/ϵ)) and polynomially improves the dependence on T and d, while maintaining best known performance with respect to η. For the case of Coulomb interactions, we give an algorithm using η3(d+η)Tpoly(log(ηdTg′/(Δϵ)))/Δ one- and two-qubit gates, and another using η3(4d)d/2Tpoly(log(ηdTg′/(Δϵ)))/Δ one- and two-qubit gates and QRAM operations, where T is the evolution time and the parameter Δ regulates the unbounded Coulomb interaction. We give applications to several computational problems, including faster real-space simulation of quantum chemistry, rigorous analysis of discretization error for simulation of a uniform electron gas, and a quadratic improvement to a quantum algorithm for escaping saddle points in nonconvex optimization.
1 aChilds, Andrew, M.1 aLeng, Jiaqi1 aLi, Tongyang1 aLiu, Jin-Peng1 aZhang, Chenyi uhttps://doi.org/10.22331%2Fq-2022-11-17-86001806nas a2200181 4500008004100000245007200041210006900113260001500182520123900197653002701436653003101463100002001494700001601514700001801530700001901548700002001567856003701587 2022 eng d00aQuantum state tomography via non-convex Riemannian gradient descent0 aQuantum state tomography via nonconvex Riemannian gradient desce c10/10/20223 aThe 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.0471702029nas 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 aCertifying 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 aMitigating 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.0730901392nas 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 aProgress 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 aThe 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.0724202774nas a2200241 4500008004100000245009900041210006900140260001100209520197600220100001902196700001702215700001802232700001602250700001602266700001702282700002202299700001702321700001802338700001802356700001702374700002102391856012002412 2022 eng d00aStatus Report on the Third Round of the NIST Post-Quantum Cryptography Standardization Process0 aStatus Report on the Third Round of the NIST PostQuantum Cryptog c7/20223 aThe National Institute of Standards and Technology is in the process of selecting publickey cryptographic algorithms through a public, competition-like process. The new publickey cryptography standards will specify additional digital signature, public-key encryption, and key-establishment algorithms to augment Federal Information Processing Standard (FIPS) 186-4, Digital Signature Standard (DSS), as well as NIST Special Publication (SP) 800-56A Revision 3, Recommendation for Pair-Wise Key-Establishment Schemes Using Discrete Logarithm Cryptography, and SP 800-56B Revision 2, Recommendation for Pair-Wise Key Establishment Using Integer Factorization Cryptography. It is intended that these algorithms will be capable of protecting sensitive information well into the foreseeable future, including after the advent of quantum computers.
This report describes the evaluation and selection process of the NIST Post-Quantum Cryptography Standardization process third-round candidates based on public feedback and internal review. The report summarizes each of the 15 third-round candidate algorithms and identifies those selected for standardization, as well as those that will continue to be evaluated in a fourth round of analysis. The public-key encryption and key-establishment algorithm that will be standardized is CRYSTALS–KYBER. The digital signatures that will be standardized are CRYSTALS–Dilithium, FALCON, and SPHINCS+. While there are multiple signature algorithms selected, NIST recommends CRYSTALS–Dilithium as the primary algorithm to be implemented. In addition, four of the alternate key-establishment candidate algorithms will advance to a fourth round of evaluation: BIKE, Classic McEliece, HQC, and SIKE. These candidates are still being considered for future standardization. NIST will also issue a new Call for Proposals for public-key digital signature algorithms to augment and diversify its signature portfolio.
1 aAlagic, Gorjan1 aApon, Daniel1 aCooper, David1 aDang, Quynh1 aDang, Thinh1 aKelsey, John1 aLichtinger, Jacob1 aMiller, Carl1 aMoody, Dustin1 aPeralta, Rene1 aPerlner, Ray1 aRobinson, Angela uhttps://quics.umd.edu/publications/status-report-third-round-nist-post-quantum-cryptography-standardization-process02392nas a2200181 4500008004100000245006700041210006600108260001400174520183100188653002702019653003102046100001602077700001802093700002702111700002002138700001502158856003702173 2022 eng d00aTailoring three-dimensional topological codes for biased noise0 aTailoring threedimensional topological codes for biased noise c11/3/20223 aTailored 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.0211601959nas 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 aWe 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 aQuantum 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.0120402234nas a2200133 4500008004100000245004700041210004600088260001400134490000900148520187200157100001702029700001702046856003702063 2021 eng d00aApproximate Bacon-Shor Code and Holography0 aApproximate BaconShor Code and Holography c5/14/20210 v20213 aWe construct an explicit and solvable toy model for the AdS/CFT correspondence in the form of an approximate quantum error correction code with a non-trivial center in the code subalgebra. Specifically, we use the Bacon-Shor codes and perfect tensors to construct a gauge code (or a stabilizer code with gauge-fixing), which we call the holographic hybrid code. This code admits a local log-depth encoding/decoding circuit, and can be represented as a holographic tensor network which satisfies an analog of the Ryu-Takayanagi formula and reproduces features of the sub-region duality. We then construct approximate versions of the holographic hybrid codes by "skewing" the code subspace, where the size of skewing is analogous to the size of the gravitational constant in holography. These approximate hybrid codes are not necessarily stabilizer codes, but they can be expressed as the superposition of holographic tensor networks that are stabilizer codes. For such constructions, different logical states, representing different bulk matter content, can "back-react" on the emergent geometry, resembling a key feature of gravity. The locality of the bulk degrees of freedom becomes subspace-dependent and approximate. Such subspace-dependence is manifest in the form of bulk operator reconstruction from the boundary. Exact complementary error correction breaks down for certain bipartition of the boundary degrees of freedom; however, a limited, state-dependent form is preserved for particular subspaces. We also construct an example where the connected two-point correlation functions can have a power-law decay. Coupled with known constraints from holography, a weakly back-reacting bulk also forces these skewed tensor network models to the "large N limit" where they are built by concatenating a large N number of copies.
1 aCao, ChunJun1 aLackey, Brad uhttps://arxiv.org/abs/2010.0596001979nas a2200277 4500008004100000245007600041210006900117260001400186520117400200100001301374700001801387700002101405700002901426700001601455700002001471700001801491700001501509700002001524700002301544700001801567700002101585700001801606700002101624700001901645856003701664 2021 eng d00aChiral transport of hot carriers in graphene in the quantum Hall regime0 aChiral transport of hot carriers in graphene in the quantum Hall c10/3/20213 aPhotocurrent (PC) measurements can reveal the relaxation dynamics of photo-excited hot carriers beyond the linear response of conventional transport experiments, a regime important for carrier multiplication. In graphene subject to a magnetic field, PC measurements are able to probe the existence of Landau levels with different edge chiralities which is exclusive to relativistic electron systems. Here, we report the accurate measurement of PC in graphene in the quantum Hall regime. Prominent PC oscillations as a function of gate voltage on samples' edges are observed. These oscillation amplitudes form an envelope which depends on the strength of the magnetic field, as does the PCs' power dependence and their saturation behavior. We explain these experimental observations through a model using optical Bloch equations, incorporating relaxations through acoustic-, optical- phonons and Coulomb interactions. The simulated PC agrees with our experimental results, leading to a unified understanding of the chiral PC in graphene at various magnetic field strengths, and providing hints for the occurrence of a sizable carrier multiplication.
1 aCao, Bin1 aGrass, Tobias1 aGazzano, Olivier1 aPatel, Kishan, Ashokbhai1 aHu, Jiuning1 aMüller, Markus1 aHuber, Tobias1 aAnzi, Luca1 aWatanabe, Kenji1 aTaniguchi, Takashi1 aNewell, David1 aGullans, Michael1 aSordan, Roman1 aHafezi, Mohammad1 aSolomon, Glenn uhttps://arxiv.org/abs/2110.0107900790nas a2200133 4500008004100000245009400041210006900135260001400204520034000218100001900558700002000577700002200597856003700619 2021 eng d00aComment on "Using an atom interferometer to infer gravitational entanglement generation''0 aComment on Using an atom interferometer to infer gravitational e c11/8/20213 aOur paper arXiv:2101.11629 contains a technical error which changes some of the conclusions. We thank Streltsov, Pedernales, and Plenio for bringing the essence of this error to our attention. Here we explain the error, examine its consequences, and suggest methods to overcome the resulting weakness in the proposed experiment.
1 aCarney, Daniel1 aMüller, Holger1 aTaylor, Jacob, M. uhttps://arxiv.org/abs/2111.0466701258nas a2200157 4500008004100000245004100041210004100082260001400123300001100137490000800148520084100156100003000997700001701027700001901044856003701063 2021 eng d00aConformal field theories are magical0 aConformal field theories are magical c2/25/2021 a0751450 v1033 a"Magic" is the degree to which a state cannot be approximated by Clifford gates. We study mana, a measure of magic, in the ground state of the Z3 Potts model, and argue that it is a broadly useful diagnostic for many-body physics. In particular we find that the q=3 ground state has large mana at the model's critical point, and that this mana resides in the system's correlations. We explain the form of the mana by a simple tensor-counting calculation based on a MERA representation of the state. Because mana is present at all length scales, we conclude that the conformal field theory describing the 3-state Potts model critical point is magical. These results control the difficulty of preparing the Potts ground state on an error-corrected quantum computer, and constrain tensor network models of AdS-CFT.
1 aWhite, Christopher, David1 aCao, ChunJun1 aSwingle, Brian uhttps://arxiv.org/abs/2007.0130301894nas a2200301 4500008004100000245006400041210006300105260001400168520102800182100001601210700001701226700001801243700002101261700002201282700001601304700001701320700002201337700003001359700002201389700001901411700002101430700001801451700001801469700002301487700002101510700002401531856003701555 2021 eng d00aCross-Platform Comparison of Arbitrary Quantum Computations0 aCrossPlatform Comparison of Arbitrary Quantum Computations c7/27/20213 aAs we approach the era of quantum advantage, when quantum computers (QCs) can outperform any classical computer on particular tasks, there remains the difficult challenge of how to validate their performance. While algorithmic success can be easily verified in some instances such as number factoring or oracular algorithms, these approaches only provide pass/fail information for a single QC. On the other hand, a comparison between different QCs on the same arbitrary circuit provides a lower-bound for generic validation: a quantum computation is only as valid as the agreement between the results produced on different QCs. Such an approach is also at the heart of evaluating metrological standards such as disparate atomic clocks. In this paper, we report a cross-platform QC comparison using randomized and correlated measurements that results in a wealth of information on the QC systems. We execute several quantum circuits on widely different physical QC platforms and analyze the cross-platform fidelities.
1 aZhu, Daiwei1 aCian, Ze-Pei1 aNoel, Crystal1 aRisinger, Andrew1 aBiswas, Debopriyo1 aEgan, Laird1 aZhu, Yingyue1 aGreen, Alaina, M.1 aAlderete, Cinthia, Huerta1 aNguyen, Nhung, H.1 aWang, Qingfeng1 aMaksymov, Andrii1 aNam, Yunseong1 aCetina, Marko1 aLinke, Norbert, M.1 aHafezi, Mohammad1 aMonroe, Christopher uhttps://arxiv.org/abs/2107.1138702034nas a2200181 4500008004100000245008100041210006900122260001300191490000800204520146900212100001801681700002501699700002001724700002301744700002501767700002301792856003701815 2021 eng d00aEfficient quantum algorithm for dissipative nonlinear differential equations0 aEfficient quantum algorithm for dissipative nonlinear differenti c3/1/20210 v1183 aWhile there has been extensive previous work on efficient quantum algorithms for linear differential equations, analogous progress for nonlinear differential equations has been severely limited due to the linearity of quantum mechanics. Despite this obstacle, we develop a quantum algorithm for initial value problems described by dissipative quadratic n-dimensional ordinary differential equations. Assuming R<1, where R is a parameter characterizing the ratio of the nonlinearity to the linear dissipation, this algorithm has complexity T2poly(logT,logn)/ϵ, where T is the evolution time and ϵ is the allowed error in the output quantum state. This is an exponential improvement over the best previous quantum algorithms, whose complexity is exponential in T. We achieve this improvement using the method of Carleman linearization, for which we give an improved convergence theorem. This method maps a system of nonlinear differential equations to an infinite-dimensional system of linear differential equations, which we discretize, truncate, and solve using the forward Euler method and the quantum linear system algorithm. We also provide a lower bound on the worst-case complexity of quantum algorithms for general quadratic differential equations, showing that the problem is intractable for R≥2–√. Finally, we discuss potential applications of this approach to problems arising in biology as well as in fluid and plasma dynamics.
1 aLiu, Jin-Peng1 aKolden, Herman, Øie1 aKrovi, Hari, K.1 aLoureiro, Nuno, F.1 aTrivisa, Konstantina1 aChilds, Andrew, M. uhttps://arxiv.org/abs/2011.0318502114nas a2200181 4500008004100000245005300041210005300094260001500147490000600162520160200168100002201770700002601792700001801818700001801836700001901854700002201873856003701895 2021 eng d00aEfficient quantum measurement of Pauli operators0 aEfficient quantum measurement of Pauli operators c01/19/20210 v53 aEstimating the expectation value of an observable is a fundamental task in quantum computation. Unfortunately, it is often impossible to obtain such estimates directly, as the computer is restricted to measuring in a fixed computational basis. One common solution splits the observable into a weighted sum of Pauli operators and measures each separately, at the cost of many measurements. An improved version first groups mutually commuting Pauli operators together and then measures all operators within each group simultaneously. The effectiveness of this depends on two factors. First, to enable simultaneous measurement, circuits are required to rotate each group to the computational basis. In our work, we present two efficient circuit constructions that suitably rotate any group of k commuting n-qubit Pauli operators using at most kn−k(k+1)/2 and O(kn/logk) two-qubit gates respectively. Second, metrics that justifiably measure the effectiveness of a grouping are required. In our work, we propose two natural metrics that operate under the assumption that measurements are distributed optimally among groups. Motivated by our new metrics, we introduce SORTED INSERTION, a grouping strategy that is explicitly aware of the weighting of each Pauli operator in the observable. Our methods are numerically illustrated in the context of the Variational Quantum Eigensolver, where the observables in question are molecular Hamiltonians. As measured by our metrics, SORTED INSERTION outperforms four conventional greedy colouring algorithms that seek the minimum number of groups.
1 aCrawford, Ophelia1 avan Straaten, Barnaby1 aWang, Daochen1 aParks, Thomas1 aCampbell, Earl1 aBrierley, Stephen uhttps://arxiv.org/abs/1908.0694201255nas a2200169 4500008004100000245007000041210006900111260001400180300000800194490000600202520075000208100002500958700001300983700003200996700002001028856003701048 2021 eng d00aEnergy storage and coherence in closed and open quantum batteries0 aEnergy storage and coherence in closed and open quantum batterie c7/15/2021 a5050 v53 aWe study the role of coherence in closed and open quantum batteries. We obtain upper bounds to the work performed or energy exchanged by both closed and open quantum batteries in terms of coherence. Specifically, we show that the energy storage can be bounded by the Hilbert-Schmidt coherence of the density matrix in the spectral basis of the unitary operator that encodes the evolution of the battery. We also show that an analogous bound can be obtained in terms of the battery's Hamiltonian coherence in the basis of the unitary operator by evaluating their commutator. We apply these bounds to a 4-state quantum system and the anisotropic XY Ising model in the closed system case, and the Spin-Boson model in the open case.
1 aCaravelli, Francesco1 aYan, Bin1 aGarcía-Pintos, Luis, Pedro1 aHamma, Alioscia uhttps://arxiv.org/abs/2012.1502601588nas a2200241 4500008004100000022001400041245008300055210006900138260001400207300001100221490000600232520086600238100002401104700002201128700002101150700001801171700002801189700001401217700002401231700002301255700002101278856004701299 2021 eng d a2058-956500aEntangled quantum cellular automata, physical complexity, and Goldilocks rules0 aEntangled quantum cellular automata physical complexity and Gold c9/29/2021 a0450170 v63 aCellular automata are interacting classical bits that display diverse emergent behaviors, from fractals to random-number generators to Turing-complete computation. We discover that quantum cellular automata (QCA) can exhibit complexity in the sense of the complexity science that describes biology, sociology, and economics. QCA exhibit complexity when evolving under "Goldilocks rules" that we define by balancing activity and stasis. Our Goldilocks rules generate robust dynamical features (entangled breathers), network structure and dynamics consistent with complexity, and persistent entropy fluctuations. Present-day experimental platforms -- Rydberg arrays, trapped ions, and superconducting qubits -- can implement our Goldilocks protocols, making testable the link between complexity science and quantum computation exposed by our QCA.
1 aHillberry, Logan, E1 aJones, Matthew, T1 aVargas, David, L1 aRall, Patrick1 aHalpern, Nicole, Yunger1 aBao, Ning1 aNotarnicola, Simone1 aMontangero, Simone1 aCarr, Lincoln, D uhttp://dx.doi.org/10.1088/2058-9565/ac1c4101306nas a2200121 4500008004100000245007000041210006900111260001500180520091800195100001601113700001801129856003701147 2021 eng d00aExactly Solvable Lattice Hamiltonians and Gravitational Anomalies0 aExactly Solvable Lattice Hamiltonians and Gravitational Anomalie c10/27/20213 aWe construct infinitely many new exactly solvable local commuting projector lattice Hamiltonian models for general bosonic beyond group cohomology invertible topological phases of order two and four in any spacetime dimensions, whose boundaries are characterized by gravitational anomalies. Examples include the beyond group cohomology invertible phase without symmetry in (4+1)D that has an anomalous boundary Z2 topological order with fermionic particle and fermionic loop excitations that have mutual π statistics. We argue that this construction gives a new non-trivial quantum cellular automaton (QCA) in (4+1)D of order two. We also present an explicit construction of gapped symmetric boundary state for the bosonic beyond group cohomology invertible phase with unitary Z2 symmetry in (4+1)D. We discuss new quantum phase transitions protected by different invertible phases across the transitions.
1 aChen, Yu-An1 aHsin, Po-Shen uhttps://arxiv.org/abs/2110.1464401880nas a2200169 4500008004100000022001400041245006100055210006100116260001400177490000600191520140600197100001901603700001301622700001901635700001901654856003701673 2021 eng d a2691-339900aFaster Digital Quantum Simulation by Symmetry Protection0 aFaster Digital Quantum Simulation by Symmetry Protection c2/14/20210 v23 aSimulating the dynamics of quantum systems is an important application of quantum computers and has seen a variety of implementations on current hardware. We show that by introducing quantum gates implementing unitary transformations generated by the symmetries of the system, one can induce destructive interference between the errors from different steps of the simulation, effectively giving faster quantum simulation by symmetry protection. We derive rigorous bounds on the error of a symmetry-protected simulation algorithm and identify conditions for optimal symmetry protection. In particular, when the symmetry transformations are chosen as powers of a unitary, the error of the algorithm is approximately projected to the so-called quantum Zeno subspaces. We prove a bound on this approximation error, exponentially improving a recent result of Burgarth, Facchi, Gramegna, and Pascazio. We apply our technique to the simulations of the XXZ Heisenberg interactions with local disorder and the Schwinger model in quantum field theory. For both systems, our algorithm can reduce the simulation error by several orders of magnitude over the unprotected simulation. Finally, we provide numerical evidence suggesting that our technique can also protect simulation against other types of coherent, temporally correlated errors, such as the 1/f noise commonly found in solid-state experiments.
1 aTran, Minh, C.1 aSu, Yuan1 aCarney, Daniel1 aTaylor, J., M. uhttps://arxiv.org/abs/2006.1624800786nas a2200109 4500008004100000245007800041210006900119260001500188520041900203100001700622856003700639 2021 eng d00aFrom Quantum Codes to Gravity: A Journey of Gravitizing Quantum Mechanics0 aFrom Quantum Codes to Gravity A Journey of Gravitizing Quantum M c11/30/20213 aIn this note, I review a recent approach to quantum gravity that "gravitizes" quantum mechanics by emerging geometry and gravity from complex quantum states. Drawing further insights from tensor network toy models in AdS/CFT, I propose that approximate quantum error correction codes, when re-adapted into the aforementioned framework, also has promise in emerging gravity in near-flat geometries.
1 aCao, ChunJun uhttps://arxiv.org/abs/2112.0019901877nas a2200181 4500008004100000245007000041210006900111260001400180520132200194100002301516700002101539700001501560700001801575700002301593700001901616700002301635856003701658 2021 eng d00aGeneralization in quantum machine learning from few training data0 aGeneralization in quantum machine learning from few training dat c11/9/20213 aModern quantum machine learning (QML) methods involve variationally optimizing a parameterized quantum circuit on a training data set, and subsequently making predictions on a testing data set (i.e., generalizing). In this work, we provide a comprehensive study of generalization performance in QML after training on a limited number N of training data points. We show that the generalization error of a quantum machine learning model with T trainable gates scales at worst as T/N−−−−√. When only K≪T gates have undergone substantial change in the optimization process, we prove that the generalization error improves to K/N−−−−√. Our results imply that the compiling of unitaries into a polynomial number of native gates, a crucial application for the quantum computing industry that typically uses exponential-size training data, can be sped up significantly. We also show that classification of quantum states across a phase transition with a quantum convolutional neural network requires only a very small training data set. Other potential applications include learning quantum error correcting codes or quantum dynamical simulation. Our work injects new hope into the field of QML, as good generalization is guaranteed from few training data.
1 aCaro, Matthias, C.1 aHuang, Hsin-Yuan1 aCerezo, M.1 aSharma, Kunal1 aSornborger, Andrew1 aCincio, Lukasz1 aColes, Patrick, J. uhttps://arxiv.org/abs/2111.0529201484nas a2200121 4500008004100000245010000041210006900141260001300210520107200223100001601295700001401311856003701325 2021 eng d00aHigher cup products on hypercubic lattices: application to lattice models of topological phases0 aHigher cup products on hypercubic lattices application to lattic c6/9/20213 aIn this paper, we derive the explicit formula for higher cup products on hypercubic lattices, based on the recently developed geometrical interpretation in the simplicial case. We illustrate how this formalism can elucidate lattice constructions on hypercubic lattices for various models and deriving them from spacetime actions. In particular, we demonstrate explicitly that the (3+1)D SPT S=12∫w22+w41 (where w1 and w2 are the first and second Stiefel-Whitney classes) is dual to the 3-fermion Walker-Wang model constructed on the cubic lattice by Burnell-Chen-Fidkowski-Vishwanath. Other examples include the double-semion model, and also the `fermionic' toric code in arbitrary dimensions on hypercubic lattices. In addition, we extend previous constructions of exact boson-fermion dualities and the Gu-Wen Grassmann Integral to arbitrary dimensions. Another result which may be of independent interest is a derivation of a cochain-level action for the generalized double-semion model, reproducing a recently derived action on the cohomology level.
1 aChen, Yu-An1 aTata, Sri uhttps://arxiv.org/abs/2106.0527401422nas a2200145 4500008004100000245007300041210006900114260001400183490000600197520097400203100002301177700001801200700002101218856003701239 2021 eng d00aHigh-precision quantum algorithms for partial differential equations0 aHighprecision quantum algorithms for partial differential equati c11/4/20210 v53 aQuantum computers can produce a quantum encoding of the solution of a system of differential equations exponentially faster than a classical algorithm can produce an explicit description. However, while high-precision quantum algorithms for linear ordinary differential equations are well established, the best previous quantum algorithms for linear partial differential equations (PDEs) have complexity poly(1/ε), where ε is the error tolerance. By developing quantum algorithms based on adaptive-order finite difference methods and spectral methods, we improve the complexity of quantum algorithms for linear PDEs to be poly(d,log(1/ε)), where d is the spatial dimension. Our algorithms apply high-precision quantum linear system algorithms to systems whose condition numbers and approximation errors we bound. We develop a finite difference algorithm for the Poisson equation and a spectral algorithm for more general second-order elliptic equations.
1 aChilds, Andrew, M.1 aLiu, Jin-Peng1 aOstrander, Aaron uhttps://arxiv.org/abs/2002.0786801304nas a2200133 4500008004100000245010100041210006900142260001400211520085700225100001701082700001901099700001501118856003701133 2021 eng d00aHyper-Invariant MERA: Approximate Holographic Error Correction Codes with Power-Law Correlations0 aHyperInvariant MERA Approximate Holographic Error Correction Cod c3/15/20213 aWe consider a class of holographic tensor networks that are efficiently contractible variational ansatze, manifestly (approximate) quantum error correction codes, and can support power-law correlation functions. In the case when the network consists of a single type of tensor that also acts as an erasure correction code, we show that it cannot be both locally contractible and sustain power-law correlation functions. Motivated by this no-go theorem, and the desirability of local contractibility for an efficient variational ansatz, we provide guidelines for constructing networks consisting of multiple types of tensors that can support power-law correlation. We also provide an explicit construction of one such network, which approximates the holographic HaPPY pentagon code in the limit where variational parameters are taken to be small.
1 aCao, ChunJun1 aPollack, Jason1 aWang, Yixu uhttps://arxiv.org/abs/2103.0863101365nas a2200145 4500008004100000245008500041210006900126260001400195520089800209100001801107700001901125700001601144700002201160856003701182 2021 eng d00aOn the Impossibility of Post-Quantum Black-Box Zero-Knowledge in Constant Rounds0 aImpossibility of PostQuantum BlackBox ZeroKnowledge in Constant c3/20/20213 aWe investigate the existence of constant-round post-quantum black-box zero-knowledge protocols for NP. As a main result, we show that there is no constant-round post-quantum black-box zero-knowledge argument for NP unless NP⊆BQP. As constant-round black-box zero-knowledge arguments for NP exist in the classical setting, our main result points out a fundamental difference between post-quantum and classical zero-knowledge protocols. Combining previous results, we conclude that unless NP⊆BQP, constant-round post-quantum zero-knowledge protocols for NP exist if and only if we use non-black-box techniques or relax certain security requirements such as relaxing standard zero-knowledge to ϵ-zero-knowledge. Additionally, we also prove that three-round and public-coin constant-round post-quantum black-box ϵ-zero-knowledge arguments for NP do not exist unless NP⊆BQP.
1 aChia, Nai-Hui1 aChung, Kai-Min1 aLiu, Qipeng1 aYamakawa, Takashi uhttps://arxiv.org/abs/2103.1124402349nas a2200313 4500008004100000245007100041210006900112260001400181520145100195100001601646700003401662700001701696700001801713700001301731700001801744700001901762700002101781700001401802700002201816700001601838700002501854700001801879700001901897700002001916700002001936700001801956700002401974856003701998 2021 eng d00aInteractive Protocols for Classically-Verifiable Quantum Advantage0 aInteractive Protocols for ClassicallyVerifiable Quantum Advantag c12/9/20213 aAchieving quantum computational advantage requires solving a classically intractable problem on a quantum device. Natural proposals rely upon the intrinsic hardness of classically simulating quantum mechanics; however, verifying the output is itself classically intractable. On the other hand, certain quantum algorithms (e.g. prime factorization via Shor's algorithm) are efficiently verifiable, but require more resources than what is available on near-term devices. One way to bridge the gap between verifiability and implementation is to use "interactions" between a prover and a verifier. By leveraging cryptographic functions, such protocols enable the classical verifier to enforce consistency in a quantum prover's responses across multiple rounds of interaction. In this work, we demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer. We execute two complementary protocols -- one based upon the learning with errors problem and another where the cryptographic construction implements a computational Bell test. To perform multiple rounds of interaction, we implement mid-circuit measurements on a subset of trapped ion qubits, with subsequent coherent evolution. For both protocols, the performance exceeds the asymptotic bound for classical behavior; maintaining this fidelity at scale would conclusively demonstrate verifiable quantum advantage.
1 aZhu, Daiwei1 aKahanamoku-Meyer, Gregory, D.1 aLewis, Laura1 aNoel, Crystal1 aKatz, Or1 aHarraz, Bahaa1 aWang, Qingfeng1 aRisinger, Andrew1 aFeng, Lei1 aBiswas, Debopriyo1 aEgan, Laird1 aGheorghiu, Alexandru1 aNam, Yunseong1 aVidick, Thomas1 aVazirani, Umesh1 aYao, Norman, Y.1 aCetina, Marko1 aMonroe, Christopher uhttps://arxiv.org/abs/2112.0515601631nas a2200169 4500008004100000245009500041210006900136260001400205520107500219100001901294700002401313700002101337700002201358700001901380700002501399856003701424 2021 eng d00aLinear and continuous variable spin-wave processing using a cavity-coupled atomic ensemble0 aLinear and continuous variable spinwave processing using a cavit c9/30/20213 aSpin-wave excitations in ensembles of atoms are gaining attention as a quantum information resource. However, current techniques with atomic spin waves do not achieve universal quantum information processing. We conduct a theoretical analysis of methods to create a high-capacity universal quantum processor and network node using an ensemble of laser-cooled atoms, trapped in a one-dimensional periodic potential and coupled to a ring cavity. We describe how to establish linear quantum processing using a lambda-scheme in a rubidium-atom system, calculate the expected experimental operational fidelities. Second, we derive an efficient method to achieve linear controllability with a single ensemble of atoms, rather than two-ensembles as proposed in [K. C. Cox et al. Spin-Wave Quantum Computing with Atoms in a Single-Mode Cavity, preprint 2021]. Finally, we propose to use the spin-wave processor for continuous-variable quantum information processing and present a scheme to generate large dual-rail cluster states useful for deterministic computing.
1 aCox, Kevin, C.1 aBienias, Przemyslaw1 aMeyer, David, H.1 aFahey, Donald, P.1 aKunz, Paul, D.1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/2109.1524601106nas a2200133 4500008004100000245005100041210005100092260001400143520072500157100001400882700001700896700002200913856003700935 2021 eng d00aMagic State Distillation from Entangled States0 aMagic State Distillation from Entangled States c6/23/20213 aMagic can be distributed non-locally in many-body entangled states, such as the low energy states of condensed matter systems. Using the Bravyi-Kitaev magic state distillation protocol, we find that non-local magic is distillable and can improve the distillation outcome. We analyze a few explicit examples and show that spin squeezing can be used to convert non-distillable states into distillable ones.
Our analysis also suggests that the conventional product input states assumed by magic distillation protocols are extremely atypical among general states with distillable magic. It further justifies the need for studying a diverse range of entangled inputs that yield magic states with high probability.
It is interesting to observe that all optical materials with a positive refractive index have a value of index that is of order unity. Surprisingly, though, a deep understanding of the mechanisms that lead to this universal behavior seems to be lacking. Moreover, this observation is difficult to reconcile with the fact that a single, isolated atom is known to have a giant optical response, as characterized by a resonant scattering cross section that far exceeds its physical size. Here, we theoretically and numerically investigate the evolution of the optical properties of an ensemble of ideal atoms as a function of density, starting from the dilute gas limit, including the effects of multiple scattering and near-field interactions. Interestingly, despite the giant response of an isolated atom, we find that the maximum index does not indefinitely grow with increasing density, but rather reaches a limiting value n≈1.7. We propose an explanation based upon strong-disorder renormalization group theory, in which the near-field interaction combined with random atomic positions results in an inhomogeneous broadening of atomic resonance frequencies. This mechanism ensures that regardless of the physical atomic density, light at any given frequency only interacts with at most a few near-resonant atoms per cubic wavelength, thus limiting the maximum index attainable. Our work is a promising first step to understand the limits of refractive index from a bottom-up, atomic physics perspective, and also introduces renormalization group as a powerful tool to understand the generally complex problem of multiple scattering of light overall.
1 aAndreoli, Francesco1 aGullans, Michael1 aHigh, Alexander, A.1 aBrowaeys, Antoine1 aChang, Darrick, E. uhttps://arxiv.org/abs/2006.0168001657nas a2200205 4500008004100000245006800041210006700109260001500176300000900191490000700200520101600207100001701223700002001240700001501260700001801275700001601293700001901309700002301328856010001351 2021 eng d00aNoise-induced barren plateaus in variational quantum algorithms0 aNoiseinduced barren plateaus in variational quantum algorithms c11/29/2021 a69610 v123 aVariational Quantum Algorithms (VQAs) may be a path to quantum advantage on Noisy Intermediate-Scale Quantum (NISQ) computers. A natural question is whether noise on NISQ devices places fundamental limitations on VQA performance. We rigorously prove a serious limitation for noisy VQAs, in that the noise causes the training landscape to have a barren plateau (i.e., vanishing gradient). Specifically, for the local Pauli noise considered, we prove that the gradient vanishes exponentially in the number of qubits n if the depth of the ansatz grows linearly with n. These noise-induced barren plateaus (NIBPs) are conceptually different from noise-free barren plateaus, which are linked to random parameter initialization. Our result is formulated for a generic ansatz that includes as special cases the Quantum Alternating Operator Ansatz and the Unitary Coupled Cluster Ansatz, among others. For the former, our numerical heuristics demonstrate the NIBP phenomenon for a realistic hardware noise model.
1 aWang, Samson1 aFontana, Enrico1 aCerezo, M.1 aSharma, Kunal1 aSone, Akira1 aCincio, Lukasz1 aColes, Patrick, J. uhttps://quics.umd.edu/publications/noise-induced-barren-plateaus-variational-quantum-algorithms01105nas a2200157 4500008004100000024001900041245005600060210005300116260001500169520064400184100001700828700001700845700002700862700002100889856003700910 2021 eng d aLA-UR-21-3232200aOn nonlinear transformations in quantum computation0 anonlinear transformations in quantum computation c12/23/20213 aWhile quantum computers are naturally well-suited to implementing linear operations, it is less clear how to implement nonlinear operations on quantum computers. However, nonlinear subroutines may prove key to a range of applications of quantum computing from solving nonlinear equations to data processing and quantum machine learning. Here we develop algorithms for implementing nonlinear transformations of input quantum states. Our algorithms are framed around the concept of a weighted state, a mathematical entity describing the output of an operational procedure involving both quantum circuits and classical post-processing.
1 aHolmes, Zoë1 aCoble, Nolan1 aSornborger, Andrew, T.1 aSubaşı, Yiğit uhttps://arxiv.org/abs/2112.1230701981nas a2200241 4500008004100000245005400041210005400095260001300149520129500162100002501457700002301482700002001505700002001525700002201545700002201567700001401589700001901603700001801622700001801640700002001658700002401678856003701702 2021 eng d00aObservation of a prethermal discrete time crystal0 aObservation of a prethermal discrete time crystal c2/2/20213 aThe conventional framework for defining and understanding phases of matter requires thermodynamic equilibrium. Extensions to non-equilibrium systems have led to surprising insights into the nature of many-body thermalization and the discovery of novel phases of matter, often catalyzed by driving the system periodically. The inherent heating from such Floquet drives can be tempered by including strong disorder in the system, but this can also mask the generality of non-equilibrium phases. In this work, we utilize a trapped-ion quantum simulator to observe signatures of a non-equilibrium driven phase without disorder: the prethermal discrete time crystal (PDTC). Here, many-body heating is suppressed not by disorder-induced many-body localization, but instead via high-frequency driving, leading to an expansive time window where non-equilibrium phases can emerge. We observe a number of key features that distinguish the PDTC from its many-body-localized disordered counterpart, such as the drive-frequency control of its lifetime and the dependence of time-crystalline order on the energy density of the initial state. Floquet prethermalization is thus presented as a general strategy for creating, stabilizing and studying intrinsically out-of-equilibrium phases of matter.
1 aKyprianidis, Antonis1 aMachado, Francisco1 aMorong, William1 aBecker, Patrick1 aCollins, Kate, S.1 aElse, Dominic, V.1 aFeng, Lei1 aHess, Paul, W.1 aNayak, Chetan1 aPagano, Guido1 aYao, Norman, Y.1 aMonroe, Christopher uhttps://arxiv.org/abs/2102.0169501625nas a2200229 4500008004100000245008800041210006900129260001400198520092400212100001801136700002101154700001601175700002101191700001601212700002201228700001801250700002501268700002101293700002001314700002401334856003701358 2021 eng d00aObservation of measurement-induced quantum phases in a trapped-ion quantum computer0 aObservation of measurementinduced quantum phases in a trappedion c6/10/20213 aMany-body open quantum systems balance internal dynamics against decoherence from interactions with an environment. Here, we explore this balance via random quantum circuits implemented on a trapped ion quantum computer, where the system evolution is represented by unitary gates with interspersed projective measurements. As the measurement rate is varied, a purification phase transition is predicted to emerge at a critical point akin to a fault-tolerent threshold. We probe the "pure" phase, where the system is rapidly projected to a deterministic state conditioned on the measurement outcomes, and the "mixed" or "coding" phase, where the initial state becomes partially encoded into a quantum error correcting codespace. We find convincing evidence of the two phases and show numerically that, with modest system scaling, critical properties of the transition clearly emerge.
1 aNoel, Crystal1 aNiroula, Pradeep1 aZhu, Daiwei1 aRisinger, Andrew1 aEgan, Laird1 aBiswas, Debopriyo1 aCetina, Marko1 aGorshkov, Alexey, V.1 aGullans, Michael1 aHuse, David, A.1 aMonroe, Christopher uhttps://arxiv.org/abs/2106.0588102060nas a2200217 4500008004100000245006500041210006400106260001400170520145900184100001501643700001201658700001501670700002001685700001301705700002001718700001501738700001201753700002501765700001501790856003701805 2021 eng d00aObservation of Stark many-body localization without disorder0 aObservation of Stark manybody localization without disorder c2/14/20213 aThermalization is a ubiquitous process of statistical physics, in which details of few-body observables are washed out in favor of a featureless steady state. Even in isolated quantum many-body systems, limited to reversible dynamics, thermalization typically prevails. However, in these systems, there is another possibility: many-body localization (MBL) can result in preservation of a non-thermal state. While disorder has long been considered an essential ingredient for this phenomenon, recent theoretical work has suggested that a quantum many-body system with a uniformly increasing field -- but no disorder -- can also exhibit MBL, resulting in `Stark MBL.' Here we realize Stark MBL in a trapped-ion quantum simulator and demonstrate its key properties: halting of thermalization and slow propagation of correlations. Tailoring the interactions between ionic spins in an effective field gradient, we directly observe their microscopic equilibration for a variety of initial states, and we apply single-site control to measure correlations between separate regions of the spin chain. Further, by engineering a varying gradient, we create a disorder-free system with coexisting long-lived thermalized and nonthermal regions. The results demonstrate the unexpected generality of MBL, with implications about the fundamental requirements for thermalization and with potential uses in engineering long-lived non-equilibrium quantum matter.
1 aMorong, W.1 aLiu, F.1 aBecker, P.1 aCollins, K., S.1 aFeng, L.1 aKyprianidis, A.1 aPagano, G.1 aYou, T.1 aGorshkov, Alexey, V.1 aMonroe, C. uhttps://arxiv.org/abs/2102.0725001759nas a2200169 4500008004100000245008100041210006900122260001500191520123200206100002401438700001301462700002301475700001301498700001801511700002301529856003701552 2021 eng d00aOptimal scaling quantum linear systems solver via discrete adiabatic theorem0 aOptimal scaling quantum linear systems solver via discrete adiab c11/15/20213 aRecently, 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.
1 aCosta, Pedro, C. S.1 aAn, Dong1 aSanders, Yuval, R.1 aSu, Yuan1 aBabbush, Ryan1 aBerry, Dominic, W. uhttps://arxiv.org/abs/2111.0815201277nas a2200169 4500008004100000022001400041245006300055210006300118260001400181490000800195520078700203100001900990700001901009700002001028700002201048856003701070 2021 eng d a2470-002900aProposal for gravitational direct detection of dark matter0 aProposal for gravitational direct detection of dark matter c8/23/20210 v1023 aThe only coupling dark matter is guaranteed to have with the standard model is through gravity. Here we propose a concept for direct dark matter detection using only this gravitational coupling. We suggest that an array of quantum-limited mechanical impulse sensors may be capable of detecting the correlated gravitational force created by a passing dark matter particle. We consider the effects of irreducible noise from couplings of the sensors to the environment and noise due to the quantum measurement process. We show that the signal from Planck-scale dark matter is in principle detectable using a large number of gram-scale sensors in a meter-scale array with sufficiently low quantum noise, and discuss some experimental challenges en route to achieving this target.
1 aCarney, Daniel1 aGhosh, Sohitri1 aKrnjaic, Gordan1 aTaylor, Jacob, M. uhttps://arxiv.org/abs/1903.0049201360nas a2200229 4500008004100000020002200041022001400063245003700077210003700114260001200151300001700163490000800180520076100188100001900949700001700968700001900985700001301004700001901017700001701036700002101053856005601074 2021 eng d a978-3-95977-188-7 a1868-896900aProving Quantum Programs Correct0 aProving Quantum Programs Correct c06/2021 a21:1–21:190 v1933 aAs quantum computing progresses steadily from theory into practice, programmers will face
a common problem: How can they be sure that their code does what they intend it to do? This
paper presents encouraging results in the application of mechanized proof to the domain of quantum
programming in the context of the sqir development. It verifies the correctness of a range of a
quantum algorithms including Grover’s algorithm and quantum phase estimation, a key component
of Shor’s algorithm. In doing so, it aims to highlight both the successes and challenges of formal
verification in the quantum context and motivate the theorem proving community to target quantum
computing as an application domain.
Quantum walks are a promising framework for developing quantum algorithms and quantum simulations. They represent an important test case for the application of quantum computers. Here we present different forms of discrete-time quantum walks (DTQWs) and show their equivalence for physical realizations. Using an appropriate digital mapping of the position space on which a walker evolves to the multiqubit states of a quantum processor, we present different configurations of quantum circuits for the implementation of DTQWs in one-dimensional position space. We provide example circuits for a five-qubit processor and address scalability to higher dimensions as well as larger quantum processors.
1 aSingh, Shivani1 aAlderete, Huerta1 aBalu, Radhakrishnan1 aMonroe, Christopher1 aLinke, Norbert, M.1 aChandrashekar, C., M. uhttps://arxiv.org/abs/2001.1119701283nas a2200169 4500008004100000245005900041210005800100260000900158300001600167490000700183520079000190100001800980700001600998700001701014700002301031856005901054 2021 eng d00aQuantum exploration algorithms for multi-armed bandits0 aQuantum exploration algorithms for multiarmed bandits c2021 a10102-101100 v353 aIdentifying the best arm of a multi-armed bandit is a central problem in bandit optimization. We study a quantum computational version of this problem with coherent oracle access to states encoding the reward probabilities of each arm as quantum amplitudes. Specifically, we show that we can find the best arm with fixed confidence using O~(∑ni=2Δ−2i−−−−−−−−√) quantum queries, where Δi represents the difference between the mean reward of the best arm and the ith-best arm. This algorithm, based on variable-time amplitude amplification and estimation, gives a quadratic speedup compared to the best possible classical result. We also prove a matching quantum lower bound (up to poly-logarithmic factors).
1 aWang, Daochen1 aYou, Xuchen1 aLi, Tongyang1 aChilds, Andrew, M. uhttps://ojs.aaai.org/index.php/AAAI/article/view/1721201237nas a2200253 4500008004100000245004100041210004100082260001300123520055200136100001900688700002400707700002100731700002000752700002700772700001800799700001600817700001700833700002000850700002100870700001900891700001300910700002300923856003700946 2021 eng d00aQuantum Machine Learning for Finance0 aQuantum Machine Learning for Finance c9/9/20213 aQuantum computers are expected to surpass the computational capabilities of classical computers during this decade, and achieve disruptive impact on numerous industry sectors, particularly finance. In fact, finance is estimated to be the first industry sector to benefit from Quantum Computing not only in the medium and long terms, but even in the short term. This review paper presents the state of the art of quantum algorithms for financial applications, with particular focus to those use cases that can be solved via Machine Learning.
1 aPistoia, Marco1 aAhmad, Syed, Farhan1 aAjagekar, Akshay1 aButs, Alexander1 aChakrabarti, Shouvanik1 aHerman, Dylan1 aHu, Shaohan1 aJena, Andrew1 aMinssen, Pierre1 aNiroula, Pradeep1 aRattew, Arthur1 aSun, Yue1 aYalovetzky, Romina uhttps://arxiv.org/abs/2109.0429801935nas a2200145 4500008004100000245005100041210005100092260001300143520152400156100001801680700001901698700001701717700001801734856003701752 2021 eng d00aQuantum Meets the Minimum Circuit Size Problem0 aQuantum Meets the Minimum Circuit Size Problem c8/6/20213 aIn this work, we initiate the study of the Minimum Circuit Size Problem (MCSP) in the quantum setting. MCSP is a problem to compute the circuit complexity of Boolean functions. It is a fascinating problem in complexity theory---its hardness is mysterious, and a better understanding of its hardness can have surprising implications to many fields in computer science.
We first define and investigate the basic complexity-theoretic properties of minimum quantum circuit size problems for three natural objects: Boolean functions, unitaries, and quantum states. We show that these problems are not trivially in NP but in QCMA (or have QCMA protocols). Next, we explore the relations between the three quantum MCSPs and their variants. We discover that some reductions that are not known for classical MCSP exist for quantum MCSPs for unitaries and states, e.g., search-to-decision reduction and self-reduction. Finally, we systematically generalize results known for classical MCSP to the quantum setting (including quantum cryptography, quantum learning theory, quantum circuit lower bounds, and quantum fine-grained complexity) and also find new connections to tomography and quantum gravity. Due to the fundamental differences between classical and quantum circuits, most of our results require extra care and reveal properties and phenomena unique to the quantum setting. Our findings could be of interest for future studies, and we post several open problems for further exploration along this direction.
We study quantum algorithms that learn properties of a matrix using queries that return its action on an input vector. We show that for various problems, including computing the trace, determinant, or rank of a matrix or solving a linear system that it specifies, quantum computers do not provide an asymptotic speedup over classical computation. On the other hand, we show that for some problems, such as computing the parities of rows or columns or deciding if there are two identical rows or columns, quantum computers provide exponential speedup. We demonstrate this by showing equivalence between models that provide matrix-vector products, vector-matrix products, and vector-matrix-vector products, whereas the power of these models can vary significantly for classical computation.
1 aChilds, Andrew, M.1 aHung, Shih-Han1 aLi, Tongyang uhttps://arxiv.org/abs/2102.1134901323nas a2200145 4500008004100000020002200041245005700063210005600120260008600176520080000262100002301062700001901085700001701104856005601121 2021 eng d a978-3-95977-195-500aQuantum Query Complexity with Matrix-Vector Products0 aQuantum Query Complexity with MatrixVector Products aDagstuhl, GermanybSchloss Dagstuhl – Leibniz-Zentrum für Informatikc2/7/20213 aWe study quantum algorithms that learn properties of a matrix using queries that return its action on an input vector. We show that for various problems, including computing the trace, determinant, or rank of a matrix or solving a linear system that it specifies, quantum computers do not provide an asymptotic speedup over classical computation. On the other hand, we show that for some problems, such as computing the parities of rows or columns or deciding if there are two identical rows or columns, quantum computers provide exponential speedup. We demonstrate this by showing equivalence between models that provide matrix-vector products, vector-matrix products, and vector-matrix-vector products, whereas the power of these models can vary significantly for classical computation.
1 aChilds, Andrew, M.1 aHung, Shih-Han1 aLi, Tongyang uhttps://drops.dagstuhl.de/opus/volltexte/2021/1412401494nas a2200181 4500008004100000245004000041210004000081260001400121490000600135520100800141100002101149700002301170700002501193700001701218700001901235700002101254856003701275 2021 eng d00aQuantum routing with fast reversals0 aQuantum routing with fast reversals c8/24/20210 v53 aWe present methods for implementing arbitrary permutations of qubits under interaction constraints. Our protocols make use of previous methods for rapidly reversing the order of qubits along a path. Given nearest-neighbor interactions on a path of length n, we show that there exists a constant ϵ≈0.034 such that the quantum routing time is at most (1−ϵ)n, whereas any swap-based protocol needs at least time n−1. This represents the first known quantum advantage over swap-based routing methods and also gives improved quantum routing times for realistic architectures such as grids. Furthermore, we show that our algorithm approaches a quantum routing time of 2n/3 in expectation for uniformly random permutations, whereas swap-based protocols require time n asymptotically. Additionally, we consider sparse permutations that route k≤n qubits and give algorithms with quantum routing time at most n/3+O(k2) on paths and at most 2r/3+O(k2) on general graphs with radius r.
1 aBapat, Aniruddha1 aChilds, Andrew, M.1 aGorshkov, Alexey, V.1 aKing, Samuel1 aSchoute, Eddie1 aShastri, Hrishee uhttps://arxiv.org/abs/2103.0326401478nas a2200277 4500008004100000245005400041210005300095260001400148300001100162490000800173520078100181100001300962700001300975700001600988700001901004700001401023700001801037700001401055700001601069700001401085700001101099700001701110700001801127700001801145856003701163 2021 eng d00aRobust Self-Testing of Multiparticle Entanglement0 aRobust SelfTesting of Multiparticle Entanglement c12/7/2021 a2305030 v1273 aQuantum self-testing is a device-independent way to certify quantum states and measurements using only the input-output statistics, with minimal assumptions about the quantum devices. Due to the high demand on tolerable noise, however, experimental self-testing was limited to two-photon systems. Here, we demonstrate the first robust self-testing for multi-particle quantum entanglement. We prepare two examples of four-photon graph states, the Greenberger-Horne-Zeilinger (GHZ) states with a fidelity of 0.957(2) and the linear cluster states with a fidelity of 0.945(2). Based on the observed input-output statistics, we certify the genuine four-photon entanglement and further estimate their qualities with respect to realistic noise in a device-independent manner.
1 aWu, Dian1 aZhao, Qi1 aGu, Xue-Mei1 aZhong, Han-Sen1 aZhou, You1 aPeng, Li-Chao1 aQin, Jian1 aLuo, Yi-Han1 aChen, Kai1 aLi, Li1 aLe Liu, Nai-1 aLu, Chao-Yang1 aPan, Jian-Wei uhttps://arxiv.org/abs/2105.1029801130nas a2200169 4500008004100000245006700041210006500108260001400173520060600187100001900793700002400812700002100836700001900857700002200876700002500898856003700923 2021 eng d00aSpin-Wave Quantum Computing with Atoms in a Single-Mode Cavity0 aSpinWave Quantum Computing with Atoms in a SingleMode Cavity c9/30/20213 aWe present a method for network-capable quantum computing that relies on holographic spin-wave excitations stored collectively in ensembles of qubits. We construct an orthogonal basis of spin waves in a one-dimensional array and show that high-fidelity universal linear controllability can be achieved using only phase shifts, applied in both momentum and position space. Neither single-site addressability nor high single-qubit cooperativity is required, and the spin waves can be read out with high efficiency into a single cavity mode for quantum computing and networking applications.
1 aCox, Kevin, C.1 aBienias, Przemyslaw1 aMeyer, David, H.1 aKunz, Paul, D.1 aFahey, Donald, P.1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/2109.1525201340nas a2200133 4500008004100000245006500041210006500106260001400171520092300185100001901108700002001127700002201147856003701169 2021 eng d00aTesting quantum gravity with interactive information sensing0 aTesting quantum gravity with interactive information sensing c1/27/20213 aWe suggest a test of a central prediction of perturbatively quantized general relativity: the coherent communication of quantum information between massive objects through gravity. To do this, we introduce the concept of interactive quantum information sensing, a protocol tailored to the verification of dynamical entanglement generation between a pair of systems. Concretely, we propose to monitor the periodic wavefunction collapse and revival in an atomic interferometer which is gravitationally coupled to a mechanical oscillator. We prove a theorem which shows that, under the assumption of time-translation invariance, this collapse and revival is possible if and only if the gravitational interaction forms an entangling channel. Remarkably, as this approach improves at moderate temperatures and relies primarily upon atomic coherence, our numerical estimates indicate feasibility with current devices.
1 aCarney, Daniel1 aMüller, Holger1 aTaylor, Jacob, M. uhttps://arxiv.org/abs/2101.1162902331nas a2200181 4500008004100000245005200041210005200093260001300145300000700158490000700165520185000172100002302022700001302045700001902058700001802077700001702095856003702112 2021 eng d00aTheory of Trotter Error with Commutator Scaling0 aTheory of Trotter Error with Commutator Scaling c2/1/2021 a490 v113 aThe Lie-Trotter formula, together with its higher-order generalizations, provides a direct approach to decomposing the exponential of a sum of operators. Despite significant effort, the error scaling of such product formulas remains poorly understood. We develop a theory of Trotter error that overcomes the limitations of prior approaches based on truncating the Baker-Campbell-Hausdorff expansion. Our analysis directly exploits the commutativity of operator summands, producing tighter error bounds for both real- and imaginary-time evolutions. Whereas previous work achieves similar goals for systems with geometric locality or Lie-algebraic structure, our approach holds in general. We give a host of improved algorithms for digital quantum simulation and quantum Monte Carlo methods, including simulations of second-quantized plane-wave electronic structure, k-local Hamiltonians, rapidly decaying power-law interactions, clustered Hamiltonians, the transverse field Ising model, and quantum ferromagnets, nearly matching or even outperforming the best previous results. We obtain further speedups using the fact that product formulas can preserve the locality of the simulated system. Specifically, we show that local observables can be simulated with complexity independent of the system size for power-law interacting systems, which implies a Lieb-Robinson bound as a byproduct. Our analysis reproduces known tight bounds for first- and second-order formulas. Our higher-order bound overestimates the complexity of simulating a one-dimensional Heisenberg model with an even-odd ordering of terms by only a factor of 5, and is close to tight for power-law interactions and other orderings of terms. This suggests that our theory can accurately characterize Trotter error in terms of both asymptotic scaling and constant prefactor.
1 aChilds, Andrew, M.1 aSu, Yuan1 aTran, Minh, C.1 aWiebe, Nathan1 aZhu, Shuchen uhttps://arxiv.org/abs/1912.0885401551nas a2200181 4500008004100000245006000041210005800101300000800159490000600167520101600173100002701189700002401216700002301240700002701263700002001290700002201310856003701332 2021 eng d00aA Threshold for Quantum Advantage in Derivative Pricing0 aThreshold for Quantum Advantage in Derivative Pricing a4630 v53 aWe give an upper bound on the resources required for valuable quantum advantage in pricing derivatives. To do so, we give the first complete resource estimates for useful quantum derivative pricing, using autocallable and Target Accrual Redemption Forward (TARF) derivatives as benchmark use cases. We uncover blocking challenges in known approaches and introduce a new method for quantum derivative pricing - the re-parameterization method - that avoids them. This method combines pre-trained variational circuits with fault-tolerant quantum computing to dramatically reduce resource requirements. We find that the benchmark use cases we examine require 7.5k logical qubits and a T-depth of 46 million and thus estimate that quantum advantage would require a logical clock speed of 10Mhz. While the resource requirements given here are out of reach of current systems, we hope they will provide a roadmap for further improvements in algorithms, implementations, and planned hardware architectures.
1 aChakrabarti, Shouvanik1 aKrishnakumar, Rajiv1 aMazzola, Guglielmo1 aStamatopoulos, Nikitas1 aWoerner, Stefan1 aZeng, William, J. uhttps://arxiv.org/abs/2012.0381902762nas a2200169 4500008004100000022001400041245007800055210006900133260001300202300001200215490000800227520222700235100002102462700001702483700001902500856007302519 2021 eng d a0010-361600aTrading Locality for Time: Certifiable Randomness from Low-Depth Circuits0 aTrading Locality for Time Certifiable Randomness from LowDepth C c2/9/2021 a49 - 860 v3823 aThe generation of certifiable randomness is the most fundamental informationtheoretic task that meaningfully separates quantum devices from their classical counterparts. We propose a protocol for exponential certified randomness expansion using a single quantum device. The protocol calls for the device to implement a simple quantum circuit of constant depth on a 2D lattice of qubits. The output of the circuit can be verified classically in linear time, and is guaranteed to contain a polynomial number of certified random bits assuming that the device used to generate the output operated using a (classical or quantum) circuit of sub-logarithmic depth. This assumption contrasts with the locality assumption used for randomness certification based on Bell inequality violation and more recent proposals for randomness certification based on computational assumptions. Furthermore, to demonstrate randomness generation it is sufficient for a device to sample from the ideal output distribution within constant statistical distance. Our procedure is inspired by recent work of Bravyi et al. (Science 362(6412):308–311, 2018), who introduced a relational problem that can be solved by a constant-depth quantum circuit, but provably cannot be solved by any classical circuit of sub-logarithmic depth. We develop the discovery of Bravyi et al. into a framework for robust randomness expansion. Our results lead to a new proposal for a demonstrated quantum advantage that has some advantages compared to existing proposals. First, our proposal does not rest on any complexity-theoretic conjectures, but relies on the physical assumption that the adversarial device being tested implements a circuit of sub-logarithmic depth. Second, success on our task can be easily verified in classical linear time. Finally, our task is more noise-tolerant than most other existing proposals that can only tolerate multiplicative error, or require additional conjectures from complexity theory; in contrast, we are able to allow a small constant additive error in total variation distance between the sampled and ideal distributions.
1 aCoudron, Matthew1 aStark, Jalex1 aVidick, Thomas uhttps://link.springer.com/content/pdf/10.1007/s00220-021-03963-w.pdf01337nas a2200157 4500008004100000245005300041210005300094260001300147490000800160520089300168100001901061700002201080700002101102700001901123856003701142 2021 eng d00aTrapped electrons and ions as particle detectors0 aTrapped electrons and ions as particle detectors c8/5/20210 v1273 aElectrons and ions trapped with electromagnetic fields have long served as important high-precision metrological instruments, and more recently have also been proposed as a platform for quantum information processing. Here we point out that these systems can also be used as highly sensitive detectors of passing charged particles, due to the combination of their extreme charge-to-mass ratio and low-noise quantum readout and control. In particular, these systems can be used to detect energy depositions many orders of magnitude below typical ionization scales. As an illustration, we show that current devices can be used to provide competitive sensitivity to models where ambient dark matter particles carry small electric millicharges ≪e. Our calculations may also be useful in the characterization of noise in quantum computers coming from backgrounds of charged particles.
1 aCarney, Daniel1 aHäffner, Hartmut1 aMoore, David, C.1 aTaylor, J., M. uhttps://arxiv.org/abs/2104.0573701587nas a2200217 4500008004100000245005800041210005700099260001400156520092600170100003001096700002401126700002801150700002101178700002401199700002301223700001901246700002501265700002401290700001801314856003701332 2021 eng d00aTunable three-body loss in a nonlinear Rydberg medium0 aTunable threebody loss in a nonlinear Rydberg medium c9/28/20203 aLong-range Rydberg interactions, in combination with electromagnetically induced transparency (EIT), give rise to strongly interacting photons where the strength, sign, and form of the interactions are widely tunable and controllable. Such control can be applied to both coherent and dissipative interactions, which provides the potential to generate novel few-photon states. Recently it has been shown that Rydberg-EIT is a rare system in which three-body interactions can be as strong or stronger than two-body interactions. In this work, we study a three-body scattering loss for Rydberg-EIT in a wide regime of single and two-photon detunings. Our numerical simulations of the full three-body wavefunction and analytical estimates based on Fermi's Golden Rule strongly suggest that the observed features in the outgoing photonic correlations are caused by the resonant enhancement of the three-body losses.
1 aHuerta, Dalia, P. Ornelas1 aBienias, Przemyslaw1 aCraddock, Alexander, N.1 aGullans, Michael1 aHachtel, Andrew, J.1 aKalinowski, Marcin1 aLyon, Mary, E.1 aGorshkov, Alexey, V.1 aRolston, Steven, L.1 aPorto, J., V. uhttps://arxiv.org/abs/2009.1359901048nas a2200193 4500008004100000022001400041245006900055210006900124260001400193300001100207490000700218520051000225100001900735700001600754700001400770700001900784700001400803856003700817 2021 eng d a1367-263000aUltralight dark matter detection with mechanical quantum sensors0 aUltralight dark matter detection with mechanical quantum sensors c3/10/2021 a0230410 v233 aWe consider the use of quantum-limited mechanical force sensors to detect ultralight (sub-meV) dark matter candidates which are weakly coupled to the standard model. We show that mechanical sensors with masses around or below the milligram scale, operating around the standard quantum limit, would enable novel searches for dark matter with natural frequencies around the kHz scale. This would complement existing strategies based on torsion balances, atom interferometers, and atomic clock systems
1 aCarney, Daniel1 aHook, Anson1 aLiu, Zhen1 aTaylor, J., M.1 aZhao, Yue uhttps://arxiv.org/abs/1908.0479701487nas a2200157 4500008004100000022001400041245008000055210006900135260001400204490000600218520099400224100001901218700002001237700002201257856005001279 2021 eng d a2691-339900aUsing an Atom Interferometer to Infer Gravitational Entanglement Generation0 aUsing an Atom Interferometer to Infer Gravitational Entanglement c8/20/20210 v23 aIf gravitational perturbations are quantized into gravitons in analogy with the electromagnetic field and photons, the resulting graviton interactions should lead to an entangling interaction between massive objects. We suggest a test of this prediction. To do this, we introduce the concept of interactive quantum information sensing. This novel sensing protocol is tailored to provable verification of weak dynamical entanglement generation between a pair of systems. We show that this protocol is highly robust to typical thermal noise sources. The sensitivity can moreover be increased both using an initial thermal state and/or an initial phase of entangling via a non-gravitational interaction. We outline a concrete implementation testing the ability of the gravitational field to generate entanglement between an atomic interferometer and mechanical oscillator. Preliminary numerical estimates suggest that near-term devices could feasibly be used to perform the experiment.
1 aCarney, Daniel1 aMüller, Holger1 aTaylor, Jacob, M. uhttp://dx.doi.org/10.1103/PRXQuantum.2.03033002481nas a2200229 4500008004100000245006800041210006700109260001300176490000700189520180000196100002401996700002102020700002602041700001902067700002302086700001902109700002002128700002402148700002302172700001902195856003702214 2020 eng d00aAuto-tuning of double dot devices in situ with machine learning0 aAutotuning of double dot devices in situ with machine learning c4/1/20200 v133 aThere are myriad quantum computing approaches, each having its own set of challenges to understand and effectively control their operation. Electrons confined in arrays of semiconductor nanostructures, called quantum dots (QDs), is one such approach. The easy access to control parameters, fast measurements, long qubit lifetimes, and the potential for scalability make QDs especially attractive. However, as the size of the QD array grows, so does the number of parameters needed for control and thus the tuning complexity. The current practice of manually tuning the qubits is a relatively time-consuming procedure and is inherently impractical for scaling up and applications. In this work, we report on the in situ implementation of an auto-tuning protocol proposed by Kalantre et al. [arXiv:1712.04914]. In particular, we discuss how to establish a seamless communication protocol between a machine learning (ML)-based auto-tuner and the experimental apparatus. We then show that a ML algorithm trained exclusively on synthetic data coming from a physical model to quantitatively classify the state of the QD device, combined with an optimization routine, can be used to replace manual tuning of gate voltages in devices. A success rate of over 85 % is determined for tuning to a double quantum dot regime when at least one of the plunger gates is initiated sufficiently close to the desired state. Modifications to the training network, fitness function, and optimizer are discussed as a path towards further improvement in the success rate when starting both near and far detuned from the target double dot range.
1 aZwolak, Justyna, P.1 aMcJunkin, Thomas1 aKalantre, Sandesh, S.1 aDodson, J., P.1 aMacQuarrie, E., R.1 aSavage, D., E.1 aLagally, M., G.1 aCoppersmith, S., N.1 aEriksson, Mark, A.1 aTaylor, J., M. uhttps://arxiv.org/abs/1909.0803001337nas a2200157 4500008004100000245007600041210006900117260001400186490000800200520085400208100001901062700001901081700001901100700001901119856004101138 2020 eng d00aBack-action evading impulse measurement with mechanical quantum sensors0 aBackaction evading impulse measurement with mechanical quantum s c8/28/20200 v1023 aThe quantum measurement of any observable naturally leads to noise added by the act of measurement. Approaches to evade or reduce this noise can lead to substantial improvements in a wide variety of sensors, from laser interferometers to precision magnetometers and more. In this paper, we develop a measurement protocol based upon pioneering work by the gravitational wave community which allows for reduction of added noise from measurement by coupling an optical field to the momentum of a small mirror. As a specific implementation, we present a continuous measurement protocol using a double-ring optomechanical cavity. We demonstrate that with experimentally-relevant parameters, this protocol can lead to significant back-action noise evasion, yielding measurement noise below the standard quantum limit over many decades of frequency.
1 aGhosh, Sohitri1 aCarney, Daniel1 aShawhan, Peter1 aTaylor, J., M. uhttps://arxiv.org/pdf/1910.11892.pdf02079nas a2200133 4500008004100000245007500041210006900116260001400185520165000199100001801849700001901867700002201886856003701908 2020 eng d00aA Black-Box Approach to Post-Quantum Zero-Knowledge in Constant Rounds0 aBlackBox Approach to PostQuantum ZeroKnowledge in Constant Round c11/5/20203 aIn a recent seminal work, Bitansky and Shmueli (STOC '20) gave the first construction of a constant round zero-knowledge argument for NP secure against quantum attacks. However, their construction has several drawbacks compared to the classical counterparts. Specifically, their construction only achieves computational soundness, requires strong assumptions of quantum hardness of learning with errors (QLWE assumption) and the existence of quantum fully homomorphic encryption (QFHE), and relies on non-black-box simulation. In this paper, we resolve these issues at the cost of weakening the notion of zero-knowledge to what is called ε-zero-knowledge. Concretely, we construct the following protocols: - We construct a constant round interactive proof for NP that satisfies statistical soundness and black-box ε-zero-knowledge against quantum attacks assuming the existence of collapsing hash functions, which is a quantum counterpart of collision-resistant hash functions. Interestingly, this construction is just an adapted version of the classical protocol by Goldreich and Kahan (JoC '96) though the proof of ε-zero-knowledge property against quantum adversaries requires novel ideas. - We construct a constant round interactive argument for NP that satisfies computational soundness and black-box ε-zero-knowledge against quantum attacks only assuming the existence of post-quantum one-way functions. At the heart of our results is a new quantum rewinding technique that enables a simulator to extract a committed message of a malicious verifier while simulating verifier's internal state in an appropriate sense.
1 aChia, Nai-Hui1 aChung, Kai-Min1 aYamakawa, Takashi uhttps://arxiv.org/abs/2011.0267001291nas a2200169 4500008004100000245005900041210005900100260001400159300000900173490000900182520082200191100001701013700001801030700001901048700001701067856003701084 2020 eng d00aBuilding Bulk Geometry from the Tensor Radon Transform0 aBuilding Bulk Geometry from the Tensor Radon Transform c12/4/2020 a1-500 v20203 aUsing the tensor Radon transform and related numerical methods, we study how bulk geometries can be explicitly reconstructed from boundary entanglement entropies in the specific case of AdS3/CFT2. We find that, given the boundary entanglement entropies of a 2d CFT, this framework provides a quantitative measure that detects whether the bulk dual is geometric in the perturbative (near AdS) limit. In the case where a well-defined bulk geometry exists, we explicitly reconstruct the unique bulk metric tensor once a gauge choice is made. We then examine the emergent bulk geometries for static and dynamical scenarios in holography and in many-body systems. Apart from the physics results, our work demonstrates that numerical methods are feasible and effective in the study of bulk reconstruction in AdS/CFT.
1 aCao, ChunJun1 aQ, Xiao-Liang1 aSwingle, Brian1 aTang, Eugene uhttps://arxiv.org/abs/2007.0000401616nas a2200121 4500008004100000245005900041210005800100260001400158520124400172100002301416700001801439856003701457 2020 eng d00aCan graph properties have exponential quantum speedup?0 aCan graph properties have exponential quantum speedup c1/28/20203 aQuantum computers can sometimes exponentially outperform classical ones, but only for problems with sufficient structure. While it is well known that query problems with full permutation symmetry can have at most polynomial quantum speedup -- even for partial functions -- it is unclear how far this condition must be relaxed to enable exponential speedup. In particular, it is natural to ask whether exponential speedup is possible for (partial) graph properties, in which the input describes a graph and the output can only depend on its isomorphism class. We show that the answer to this question depends strongly on the input model. In the adjacency matrix model, we prove that the bounded-error randomized query complexity R of any graph property P has R(P)=O(Q(P)6), where Q is the bounded-error quantum query complexity. This negatively resolves an open question of Montanaro and de Wolf in the adjacency matrix model. More generally, we prove R(P)=O(Q(P)3l) for any l-uniform hypergraph property P in the adjacency matrix model. In direct contrast, in the adjacency list model for bounded-degree graphs, we exhibit a promise problem that shows an exponential separation between the randomized and quantum query complexities.
1 aChilds, Andrew, M.1 aWang, Daochen uhttps://arxiv.org/abs/2001.1052001526nas a2200133 4500008004100000245011300041210006900154260001400223520105400237100002001291700002001311700002401331856003701355 2020 eng d00aThe Character of Motional Modes for Entanglement and Sympathetic Cooling of Mixed-Species Trapped Ion Chains0 aCharacter of Motional Modes for Entanglement and Sympathetic Coo c4/16/20203 aModular mixed-species ion-trap networks are a promising framework for scalable quantum information processing, where one species acts as a memory qubit and another as a communication qubit. This architecture requires high-fidelity mixed-species entangling gates to transfer information from communication to memory qubits through their collective motion. We investigate the character of the motional modes of a mixed-species ion chain for entangling operations and also sympathetic cooling. We find that the laser power required for high-fidelity entangling gates based on transverse modes is at least an order of magnitude higher than that based on axial modes for widely different masses of the two species. We also find that for even moderate mass differences, the transverse modes are much harder to cool than the axial modes regardless of the ion chain configuration. Therefore, transverse modes conventionally used for operations in single-species ion chains may not be well suited for mixed-species chains with widely different masses.
1 aSosnova, Ksenia1 aCarter, Allison1 aMonroe, Christopher uhttps://arxiv.org/abs/2004.0804501895nas a2200121 4500008004100000245009500041210006900136260001400205520147700219100002101696700001901717856003701736 2020 eng d00aComputations with Greater Quantum Depth Are Strictly More Powerful (Relative to an Oracle)0 aComputations with Greater Quantum Depth Are Strictly More Powerf c4/23/20203 aA conjecture of Jozsa [Jozsa06] states that any polynomial-time quantum computation can be simulated by polylogarithmic-depth quantum computation interleaved with polynomial-depth classical computation. Separately, Aaronson [Aaronson05, Aaronson11, Aaronson14] conjectured that there exists an oracle O such that BQPO≠(BPPBQNC)O. These conjectures are intriguing allusions to the unresolved potential of combining classical and low-depth quantum computation. In this work we show that the Welded Tree Problem, which is an oracle problem that can be solved in quantum polynomial time as shown by Childs et al. [ChildsCDFGS03], cannot be solved in BPPBQNC, nor can it be solved in the class that Jozsa describes. This proves Aaronson's oracle separation conjecture and provides a counterpoint to Jozsa's conjecture relative to the Welded Tree oracle problem. More precisely, we define two complexity classes, HQC and JC whose languages are decided by two different families of interleaved quantum-classical circuits. HQC contains BPPBQNC and is therefore relevant to Aaronson's conjecture, while JC captures the model of computation that Jozsa considers. We show that the Welded Tree Problem gives an oracle separation between either of {JC,HQC} and BQP. Therefore, even when interleaved with arbitrary polynomial-time classical computation, greater "quantum depth" leads to strictly greater computational ability in this relativized setting.
1 aCoudron, Matthew1 aMenda, Sanketh uhttps://arxiv.org/abs/1909.1050301342nas a2200169 4500008004100000245007000041210006900111260001400180520083000194100002201024700001301046700002001059700001801079700001701097700002101114856003701135 2020 eng d00aConfronting lattice parton distributions with global QCD analysis0 aConfronting lattice parton distributions with global QCD analysi c10/1/20203 aWe present the first Monte Carlo based global QCD analysis of spin-averaged and spin-dependent parton distribution functions (PDFs) that includes nucleon isovector matrix elements in coordinate space from lattice QCD. We investigate the degree of universality of the extracted PDFs when the lattice and experimental data are treated under the same conditions within the Bayesian likelihood analysis. For the unpolarized sector, we find rather weak constraints from the current lattice data on the phenomenological PDFs, and difficulties in describing the lattice matrix elements at large spatial distances. In contrast, for the polarized PDFs we find good agreement between experiment and lattice data, with the latter providing significant constraints on the spin-dependent isovector quark and antiquark distributions
1 aBringewatt, Jacob1 aSato, N.1 aMelnitchouk, W.1 aQiu, Jian-Wei1 aSteffens, F.1 aConstantinou, M. uhttps://arxiv.org/abs/2010.0054802263nas a2200145 4500008004100000245006800041210006700109260001400176520182500190100001902015700001202034700001902046700001502065856003702080 2020 eng d00aConstant-round Blind Classical Verification of Quantum Sampling0 aConstantround Blind Classical Verification of Quantum Sampling c12/8/20203 aIn a recent breakthrough, Mahadev constructed a classical verification of quantum computation (CVQC) protocol for a classical client to delegate decision problems in BQP to an untrusted quantum prover under computational assumptions. In this work, we explore further the feasibility of CVQC with the more general sampling problems in BQP and with the desirable blindness property. We contribute affirmative solutions to both as follows. (1) Motivated by the sampling nature of many quantum applications (e.g., quantum algorithms for machine learning and quantum supremacy tasks), we initiate the study of CVQC for quantum sampling problems (denoted by SampBQP). More precisely, in a CVQC protocol for a SampBQP problem, the prover and the verifier are given an input x∈{0,1}n and a quantum circuit C, and the goal of the classical client is to learn a sample from the output z←C(x) up to a small error, from its interaction with an untrusted prover. We demonstrate its feasibility by constructing a four-message CVQC protocol for SampBQP based on the quantum Learning With Error assumption. (2) The blindness of CVQC protocols refers to a property of the protocol where the prover learns nothing, and hence is blind, about the client's input. It is a highly desirable property that has been intensively studied for the delegation of quantum computation. We provide a simple yet powerful generic compiler that transforms any CVQC protocol to a blind one while preserving its completeness and soundness errors as well as the number of rounds. Applying our compiler to (a parallel repetition of) Mahadev's CVQC protocol for BQP and our CVQC protocol for SampBQP yields the first constant-round blind CVQC protocol for BQP and SampBQP respectively, with negligible completeness and soundness errors.
1 aChung, Kai-Min1 aLee, Yi1 aLin, Han-Hsuan1 aWu, Xiaodi uhttps://arxiv.org/abs/2012.0484801932nas a2200181 4500008004100000245005700041210005700098260001300155520138000168100002501548700002001573700002201593700002701615700002301642700002501665700002301690856003701713 2020 eng d00aCritical Theory for the Breakdown of Photon Blockade0 aCritical Theory for the Breakdown of Photon Blockade c6/9/20203 aPhoton blockade is the result of the interplay between the quantized nature of light and strong optical nonlinearities, whereby strong photon-photon repulsion prevents a quantum optical system from absorbing multiple photons. We theoretically study a single atom coupled to the light field, described by the resonantly driven Jaynes--Cummings model, in which case the photon blockade breaks down in a second order phase transition at a critical drive strength. We show that this transition is associated to the spontaneous breaking of an anti-unitary PT-symmetry. Within a semiclassical approximation we calculate the expectation values of observables in the steady state. We then move beyond the semiclassical approximation and approach the critical point from the disordered (blockaded) phase by reducing the Lindblad quantum master equation to a classical rate equation that we solve. The width of the steady-state distribution in Fock space is found to diverge as we approach the critical point with a simple power-law, allowing us to calculate the critical scaling of steady state observables without invoking mean-field theory. We propose a simple physical toy model for biased diffusion in the space of occupation numbers, which captures the universal properties of the steady state. We list several experimental platforms where this phenomenon may be observed.
1 aCurtis, Jonathan, B.1 aBoettcher, Igor1 aYoung, Jeremy, T.1 aMaghrebi, Mohammad, F.1 aCarmichael, Howard1 aGorshkov, Alexey, V.1 aFoss-Feig, Michael uhttps://arxiv.org/abs/2006.0559301561nas a2200169 4500008004100000245007300041210006900114260001300183490000800196520105300204100001901257700001701276700001301293700002301306700002501329856003701354 2020 eng d00aDestructive Error Interference in Product-Formula Lattice Simulation0 aDestructive Error Interference in ProductFormula Lattice Simulat c6/4/20200 v1243 aQuantum computers can efficiently simulate the dynamics of quantum systems. In this paper, we study the cost of digitally simulating the dynamics of several physically relevant systems using the first-order product formula algorithm. We show that the errors from different Trotterization steps in the algorithm can interfere destructively, yielding a much smaller error than previously estimated. In particular, we prove that the total error in simulating a nearest-neighbor interacting system of n sites for time t using the first-order product formula with r time slices is O(nt/r+nt3/r2) when nt2/r is less than a small constant. Given an error tolerance ε, the error bound yields an estimate of max{O(n2t/ε),O(n2t3/2/ε1/2)} for the total gate count of the simulation. The estimate is tighter than previous bounds and matches the empirical performance observed in Childs et al. [PNAS 115, 9456-9461 (2018)]. We also provide numerical evidence for potential improvements and conjecture an even tighter estimate for the gate count.
1 aTran, Minh, C.1 aChu, Su-Kuan1 aSu, Yuan1 aChilds, Andrew, M.1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/1912.1104701493nas a2200193 4500008004100000245007800041210006900119260001400188490000600202520090100208100002201109700001401131700002101145700002401166700002301190700002401213700002501237856003701262 2020 eng d00aEntanglement Bounds on the Performance of Quantum Computing Architectures0 aEntanglement Bounds on the Performance of Quantum Computing Arch c9/22/20200 v23 aThere are many possible architectures for future quantum computers that designers will need to choose between. However, the process of evaluating a particular connectivity graph's performance as a quantum architecture can be difficult. In this paper, we establish a connection between a quantity known as the isoperimetric number and a lower bound on the time required to create highly entangled states. The metric we propose counts resources based on the use of two-qubit unitary operations, while allowing for arbitrarily fast measurements and classical feedback. We describe how these results can be applied to the evaluation of the hierarchical architecture proposed in Phys. Rev. A 98, 062328 (2018). We also show that the time-complexity bound we place on the creation of highly-entangled states can be saturated up to a multiplicative factor logarithmic in the number of qubits.
1 aEldredge, Zachary1 aZhou, Leo1 aBapat, Aniruddha1 aGarrison, James, R.1 aDeshpande, Abhinav1 aChong, Frederic, T.1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/1908.0480201656nas a2200157 4500008004100000245008100041210006900122260001500191520114900206100002801355700001701383700001801400700002201418700002101440856003701461 2020 eng d00aEntanglement entropy scaling transition under competing monitoring protocols0 aEntanglement entropy scaling transition under competing monitori c08/19/20203 aDissipation generally leads to the decoherence of a quantum state. In contrast, numerous recent proposals have illustrated that dissipation can also be tailored to stabilize many-body entangled quantum states. While the focus of these works has been primarily on engineering the non-equilibrium steady state, we investigate the build-up of entanglement in the quantum trajectories. Specifically, we analyze the competition between two different dissipation channels arising from two incompatible continuous monitoring protocols. The first protocol locks the phase of neighboring sites upon registering a quantum jump, thereby generating a long-range entanglement through the system, while the second one destroys the coherence via dephasing mechanism. By studying the unraveling of stochastic quantum trajectories associated with the continuous monitoring protocols, we present a transition for the scaling of the averaged trajectory entanglement entropies, from critical scaling to area-law behavior. Our work provides novel insights into the occurrence of a measurement-induced phase transition within a continuous monitoring protocol.
1 aVan Regemortel, Mathias1 aCian, Ze-Pei1 aSeif, Alireza1 aDehghani, Hossein1 aHafezi, Mohammad uhttps://arxiv.org/abs/2008.0861901709nas a2200205 4500008004100000245006400041210006200105260001400167490000800181520108400189100002401273700002101297700002301318700002801341700003001369700002401399700001801423700002501441856003701466 2020 eng d00aExotic photonic molecules via Lennard-Jones-like potentials0 aExotic photonic molecules via LennardJoneslike potentials c9/19/20200 v1253 aUltracold systems offer an unprecedented level of control of interactions between atoms. An important challenge is to achieve a similar level of control of the interactions between photons. Towards this goal, we propose a realization of a novel Lennard-Jones-like potential between photons coupled to the Rydberg states via electromagnetically induced transparency (EIT). This potential is achieved by tuning Rydberg states to a F{ö}rster resonance with other Rydberg states. We consider few-body problems in 1D and 2D geometries and show the existence of self-bound clusters ("molecules") of photons. We demonstrate that for a few-body problem, the multi-body interactions have a significant impact on the geometry of the molecular ground state. This leads to phenomena without counterparts in conventional systems: For example, three photons in 2D preferentially arrange themselves in a line-configuration rather than in an equilateral-triangle configuration. Our result opens a new avenue for studies of many-body phenomena with strongly interacting photons.
1 aBienias, Przemyslaw1 aGullans, Michael1 aKalinowski, Marcin1 aCraddock, Alexander, N.1 aOrnelas-Huerta, Dalia, P.1 aRolston, Steven, L.1 aPorto, J., V.1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/2003.0786402128nas a2200229 4500008004100000245006400041210006200105260001400167520146400181100001601645700002301661700001801684700002101702700001601723700002201739700002001761700001501781700002301796700001801819700002401837856003701861 2020 eng d00aFault-Tolerant Operation of a Quantum Error-Correction Code0 aFaultTolerant Operation of a Quantum ErrorCorrection Code c9/24/20203 aQuantum error correction protects fragile quantum information by encoding it in a larger quantum system whose extra degrees of freedom enable the detection and correction of errors. An encoded logical qubit thus carries increased complexity compared to a bare physical qubit. Fault-tolerant protocols contain the spread of errors and are essential for realizing error suppression with an error-corrected logical qubit. Here we experimentally demonstrate fault-tolerant preparation, rotation, error syndrome extraction, and measurement on a logical qubit encoded in the 9-qubit Bacon-Shor code. For the logical qubit, we measure an average fault-tolerant preparation and measurement error of 0.6% and a transversal Clifford gate with an error of 0.3% after error correction. The result is an encoded logical qubit whose logical fidelity exceeds the fidelity of the entangling operations used to create it. We compare these operations with non-fault-tolerant protocols capable of generating arbitrary logical states, and observe the expected increase in error. We directly measure the four Bacon-Shor stabilizer generators and are able to detect single qubit Pauli errors. These results show that fault-tolerant quantum systems are currently capable of logical primitives with error rates lower than their constituent parts. With the future addition of intermediate measurements, the full power of scalable quantum error-correction can be achieved.
1 aEgan, Laird1 aDebroy, Dripto, M.1 aNoel, Crystal1 aRisinger, Andrew1 aZhu, Daiwei1 aBiswas, Debopriyo1 aNewman, Michael1 aLi, Muyuan1 aBrown, Kenneth, R.1 aCetina, Marko1 aMonroe, Christopher uhttps://arxiv.org/abs/2009.1148201216nas a2200157 4500008004100000245005000041210005000091260001500141490000800156520078000164100001900944700001900963700002000982700001901002856003701021 2020 eng d00aGravitational Direct Detection of Dark Matter0 aGravitational Direct Detection of Dark Matter c10/13/20200 v1023 aThe only coupling dark matter is guaranteed to have with the standard model is through gravity. Here we propose a concept for direct dark matter detection using only this gravitational coupling, enabling a new regime of detection. Leveraging dramatic advances in the ability to create, maintain, and probe quantum states of massive objects, we suggest that an array of quantum-limited impulse sensors may be capable of detecting the correlated gravitational force created by a passing dark matter particle. We present two concrete realizations of this scheme, using either mechanical resonators or freely-falling masses. With currently available technology, a meter-scale apparatus of this type could detect any dark matter candidate around the Planck mass or heavier.
1 aCarney, Daniel1 aGhosh, Sohitri1 aKrnjaic, Gordan1 aTaylor, J., M. uhttps://arxiv.org/abs/1903.0049202312nas a2200217 4500008004100000245006500041210006400106260001400170490000700184520168700191100001901878700001901897700002001916700002001936700002301956700001601979700001901995700002502014700001802039856003702057 2020 eng d00aHierarchy of linear light cones with long-range interactions0 aHierarchy of linear light cones with longrange interactions c5/29/20200 v103 aIn quantum many-body systems with local interactions, quantum information and entanglement cannot spread outside of a "linear light cone," which expands at an emergent velocity analogous to the speed of light. Yet most non-relativistic physical systems realized in nature have long-range interactions: two degrees of freedom separated by a distance r interact with potential energy V(r)∝1/rα. In systems with long-range interactions, we rigorously establish a hierarchy of linear light cones: at the same α, some quantum information processing tasks are constrained by a linear light cone while others are not. In one spatial dimension, commutators of local operators 〈ψ|[Ox(t),Oy]|ψ〉 are negligible in every state |ψ〉 when |x−y|≳vt, where v is finite when α>3 (Lieb-Robinson light cone); in a typical state |ψ〉 drawn from the infinite temperature ensemble, v is finite when α>52 (Frobenius light cone); in non-interacting systems, v is finite in every state when α>2 (free light cone). These bounds apply to time-dependent systems and are optimal up to subalgebraic improvements. Our theorems regarding the Lieb-Robinson and free light cones, and their tightness, also generalize to arbitrary dimensions. We discuss the implications of our bounds on the growth of connected correlators and of topological order, the clustering of correlations in gapped systems, and the digital simulation of systems with long-range interactions. In addition, we show that quantum state transfer and many-body quantum chaos are bounded by the Frobenius light cone, and therefore are poorly constrained by all Lieb-Robinson bounds.
1 aTran, Minh, C.1 aChen, Chi-Fang1 aEhrenberg, Adam1 aGuo, Andrew, Y.1 aDeshpande, Abhinav1 aHong, Yifan1 aGong, Zhe-Xuan1 aGorshkov, Alexey, V.1 aLucas, Andrew uhttps://arxiv.org/abs/2001.1150902026nas a2200517 4500008004100000245006100041210006100102260001400163520075200177100001500929700001600944700001800960700001800978700001300996700001401009700001701023700001601040700001401056700001701070700001501087700001401102700002201116700001301138700001701151700001801168700001701186700001101203700001201214700001201226700001501238700001601253700001501269700001801284700001401302700001701316700001401333700001901347700001401366700001401380700001401394700001901408700001201427700001901439700001301458856003701471 2020 eng d00aMechanical Quantum Sensing in the Search for Dark Matter0 aMechanical Quantum Sensing in the Search for Dark Matter c8/13/20203 aNumerous astrophysical and cosmological observations are best explained by the existence of dark matter, a mass density which interacts only very weakly with visible, baryonic matter. Searching for the extremely weak signals produced by this dark matter strongly motivate the development of new, ultra-sensitive detector technologies. Paradigmatic advances in the control and readout of massive mechanical systems, in both the classical and quantum regimes, have enabled unprecedented levels of sensitivity. In this white paper, we outline recent ideas in the potential use of a range of solid-state mechanical sensing technologies to aid in the search for dark matter in a number of energy scales and with a variety of coupling mechanisms.
1 aCarney, D.1 aKrnjaic, G.1 aMoore, D., C.1 aRegal, C., A.1 aAfek, G.1 aBhave, S.1 aBrubaker, B.1 aCorbitt, T.1 aCripe, J.1 aCrisosto, N.1 a.Geraci, A1 aGhosh, S.1 aHarris, J., G. E.1 aHook, A.1 aKolb, E., W.1 aKunjummen, J.1 aLang, R., F.1 aLi, T.1 aLin, T.1 aLiu, Z.1 aLykken, J.1 aMagrini, L.1 aManley, J.1 aMatsumoto, N.1 aMonte, A.1 aMonteiro, F.1 aPurdy, T.1 aRiedel, C., J.1 aSingh, R.1 aSingh, S.1 aSinha, K.1 aTaylor, J., M.1 aQin, J.1 aWilson, D., J.1 aZhao, Y. uhttps://arxiv.org/abs/2008.0607401494nas a2200181 4500008004100000245005100041210005100092260001500143300001100158490000700169520100800176100001401184700001701198700002501215700001901240700001601259856003701275 2020 eng d00aMore of the Bulk from Extremal Area Variations0 aMore of the Bulk from Extremal Area Variations c12/24/2020 a0470010 v383 aIt was shown recently, building on work of Alexakis, Balehowksy, and Nachman that the geometry of (some portion of) a manifold with boundary is uniquely fixed by the areas of a foliation of two-dimensional disk-shaped surfaces anchored to the boundary. In the context of AdS/CFT, this implies that (a portion of) a four-dimensional bulk geometry can be fixed uniquely from the entanglement entropies of disk-shaped boundary regions, subject to several constraints. In this Note, we loosen some of these constraints, in particular allowing for the bulk foliation of extremal surfaces to be local and removing the constraint of disk topology; these generalizations ensure uniqueness of more of the deep bulk geometry by allowing for e.g. surfaces anchored on disconnected asymptotic boundaries, or HRT surfaces past a phase transition. We also explore in more depth the generality of the local foliation requirement, showing that even in a highly dynamical geometry like AdS-Vaidya it is satisfied.
1 aBao, Ning1 aCao, ChunJun1 aFischetti, Sebastian1 aPollack, Jason1 aZhong, Yibo uhttps://arxiv.org/abs/2009.0785001544nas a2200145 4500008004100000245006100041210006000102260001300162520109800175100002101273700001901294700002501313700002301338856003701361 2020 eng d00aNearly optimal time-independent reversal of a spin chain0 aNearly optimal timeindependent reversal of a spin chain c3/5/20203 aWe propose a time-independent Hamiltonian protocol for the reversal of qubit ordering in a chain of N spins. Our protocol has an easily implementable nearest-neighbor, transverse-field Ising model Hamiltonian with time-independent, non-uniform couplings. Under appropriate normalization, we implement this state reversal three times faster than a naive approach using SWAP gates, in time comparable to a protocol of Raussendorf [Phys. Rev. A 72, 052301 (2005)] that requires dynamical control. We also prove lower bounds on state reversal by using results on the entanglement capacity of Hamiltonians and show that we are within a factor 1.502(1+1/N) of the shortest time possible. Our lower bound holds for all nearest-neighbor qubit protocols with arbitrary finite ancilla spaces and local operations and classical communication. Finally, we extend our protocol to an infinite family of nearest-neighbor, time-independent Hamiltonian protocols for state reversal. This includes chains with nearly uniform coupling that may be especially feasible for experimental implementation.
1 aBapat, Aniruddha1 aSchoute, Eddie1 aGorshkov, Alexey, V.1 aChilds, Andrew, M. uhttps://arxiv.org/abs/2003.0284301889nas a2200169 4500008004100000245006600041210006500107260001300172300001200185490004400197520136000241100001901601700002301620700002001643700001901663856003701682 2020 eng d00aNon-interactive classical verification of quantum computation0 aNoninteractive classical verification of quantum computation c3/9/2020 a153-1800 vLecture Notes in Computer Science 125523 aIn a recent breakthrough, Mahadev constructed an interactive protocol that enables a purely classical party to delegate any quantum computation to an untrusted quantum prover. In this work, we show that this same task can in fact be performed non-interactively and in zero-knowledge.
Our protocols result from a sequence of significant improvements to the original four-message protocol of Mahadev. We begin by making the first message instance-independent and moving it to an offline setup phase. We then establish a parallel repetition theorem for the resulting three-message protocol, with an asymptotically optimal rate. This, in turn, enables an application of the Fiat-Shamir heuristic, eliminating the second message and giving a non-interactive protocol. Finally, we employ classical non-interactive zero-knowledge (NIZK) arguments and classical fully homomorphic encryption (FHE) to give a zero-knowledge variant of this construction. This yields the first purely classical NIZK argument system for QMA, a quantum analogue of NP.
We establish the security of our protocols under standard assumptions in quantum-secure cryptography. Specifically, our protocols are secure in the Quantum Random Oracle Model, under the assumption that Learning with Errors is quantumly hard. The NIZK construction also requires circuit-private FHE.
Single photons coupled to atomic systems have shown to be a promising platform for developing quantum technologies. Yet a bright on-demand, highly pure and highly indistinguishable single-photon source compatible with atomic platforms is lacking. In this work, we demonstrate such a source based on a strongly interacting Rydberg system. The large optical nonlinearities in a blockaded Rydberg ensemble convert coherent light into a single-collective excitation that can be coherently retrieved as a quantum field. We observe a single-transverse-mode efficiency up to 0.18(2), g(2)=2.0(1.5)×10−4, and indistinguishability of 0.982(7), making this system promising for scalable quantum information applications. Accounting for losses, we infer a generation probability up to 0.40(4). Furthermore, we investigate the effects of contaminant Rydberg excitations on the source efficiency. Finally, we introduce metrics to benchmark the performance of on-demand single-photon sources.
1 aOrnelas-Huerta, Dalia, P.1 aCraddock, Alexander, N.1 aGoldschmidt, Elizabeth, A.1 aHachtel, Andrew, J.1 aWang, Yidan1 aBienias, P.1 aGorshkov, Alexey, V.1 aRolston, Steve, L.1 aPorto, James, V. uhttps://arxiv.org/abs/2003.0220201122nas a2200169 4500008004100000245008500041210007000126260001300196490000800209520061300217100001700830700001800847700001500865700001600880700001900896856003700915 2020 eng d00aThe operator Lévy flight: light cones in chaotic long-range interacting systems0 aoperator Lévy flight light cones in chaotic longrange interactin c7/6/20200 v1243 aWe propose a generic light cone phase diagram for chaotic long-range r−α interacting systems, where a linear light cone appears for α≥d+1/2 in d dimension. Utilizing the dephasing nature of quantum chaos, we argue that the universal behavior of the squared commutator is described by a stochastic model, for which the exact phase diagram is known. We provide an interpretation in terms of the Lévy flights and show that this suffices to capture the scaling of the squared commutator. We verify these phenomena in numerical computation of a long-range spin chain with up to 200 sites.
1 aZhou, Tianci1 aXu, Shenglong1 aChen, Xiao1 aGuo, Andrew1 aSwingle, Brian uhttps://arxiv.org/abs/1909.0864601577nas a2200157 4500008004100000245004200041210004200083260001400125520114200139100001701281700002301298700001801321700002401339700001901363856003701382 2020 eng d00aOptimal control for quantum detectors0 aOptimal control for quantum detectors c5/12/20203 aQuantum systems are promising candidates for sensing of weak signals as they can provide unrivaled performance when estimating parameters of external fields. However, when trying to detect weak signals that are hidden by background noise, the signal-to-noise-ratio is a more relevant metric than raw sensitivity. We identify, under modest assumptions about the statistical properties of the signal and noise, the optimal quantum control to detect an external signal in the presence of background noise using a quantum sensor. Interestingly, for white background noise, the optimal solution is the simple and well-known spin-locking control scheme. We further generalize, using numerical techniques, these results to the background noise being a correlated Lorentzian spectrum. We show that for increasing correlation time, pulse based sequences such as CPMG are also close to the optimal control for detecting the signal, with the crossover dependent on the signal frequency. These results show that an optimal detection scheme can be easily implemented in near-term quantum sensors without the need for complicated pulse shaping.
1 aTitum, Paraj1 aSchultz, Kevin, M.1 aSeif, Alireza1 aQuiroz, Gregory, D.1 aClader, B., D. uhttps://arxiv.org/abs/2005.0599502249nas a2200133 4500008004100000245007900041210006900120260001500189520179100204100002401995700001902019700001902038856005802057 2020 eng d00aPosition Space Decoherence From Long-Range Interaction With Background Gas0 aPosition Space Decoherence From LongRange Interaction With Backg c06/05/20203 aExperiments in matter wave interferometry and optomechanics are increasing the spatial extent of wavefunctions of massive quantum systems; this gives rise to new sources of decoherence that must be characterized. Here we calculate the position space decoherence of a quantum particle due to interaction with a fluctuating classical background gas for several different force laws. We begin with the calculation of this effect for the Newton potential. To our knowledge, this calculation has not been done before. We then solve the same problem in the case of a Yukawa interaction, which interpolates between our long-range force result and the well-studied formula for collisional decoherence from a contact interaction. Unlike the contact interaction case, where the decoherence rate becomes independent of distance for large quantum particle separations, we observe that a long-range interaction leads to quadratic scaling of the decoherence rate with distance even at large separations. This work is relevant to the generation of massive superposition in optomechanical and atom beam experiments, and to conclude we comment on the use of this decoherence signal for gravitational detection of dark matter.
1 aKunjummen, Jonathan1 aCarney, Daniel1 aTaylor, J., M. uhttp://meetings.aps.org/Meeting/DAMOP20/Session/S08.501867nas a2200145 4500008004100000245007000041210006300111260001300174520141800187100001801605700001901623700002701642700001501669856003701684 2020 eng d00aOn the Principles of Differentiable Quantum Programming Languages0 aPrinciples of Differentiable Quantum Programming Languages c4/2/20203 aVariational Quantum Circuits (VQCs), or the so-called quantum neural-networks, are predicted to be one of the most important near-term quantum applications, not only because of their similar promises as classical neural-networks, but also because of their feasibility on near-term noisy intermediate-size quantum (NISQ) machines. The need for gradient information in the training procedure of VQC applications has stimulated the development of auto-differentiation techniques for quantum circuits. We propose the first formalization of this technique, not only in the context of quantum circuits but also for imperative quantum programs (e.g., with controls), inspired by the success of differentiable programming languages in classical machine learning. In particular, we overcome a few unique difficulties caused by exotic quantum features (such as quantum no-cloning) and provide a rigorous formulation of differentiation applied to bounded-loop imperative quantum programs, its code-transformation rules, as well as a sound logic to reason about their correctness. Moreover, we have implemented our code transformation in OCaml and demonstrated the resource-efficiency of our scheme both analytically and empirically. We also conduct a case study of training a VQC instance with controls, which shows the advantage of our scheme over existing auto-differentiation for quantum circuits without controls.
1 aZhu, Shaopeng1 aHung, Shih-Han1 aChakrabarti, Shouvanik1 aWu, Xiaodi uhttps://arxiv.org/abs/2004.0112201854nas a2200193 4500008004100000245008800041210006900129260001400198520128100212100001501493700001701508700001501525700001601540700001701556700001401573700001901587700001701606856003701623 2020 eng d00aProbing XY phase transitions in a Josephson junction array with tunable frustration0 aProbing XY phase transitions in a Josephson junction array with c1/22/20203 aThe seminal theoretical works of Berezinskii, Kosterlitz, and Thouless presented a new paradigm for phase transitions in condensed matter that are driven by topological excitations. These transitions have been extensively studied in the context of two-dimensional XY models -- coupled compasses -- and have generated interest in the context of quantum simulation. Here, we use a circuit quantum-electrodynamics architecture to study the critical behavior of engineered XY models through their dynamical response. In particular, we examine not only the unfrustrated case but also the fully-frustrated case which leads to enhanced degeneracy associated with the spin rotational [U(1)] and discrete chiral (Z2) symmetries. The nature of the transition in the frustrated case has posed a challenge for theoretical studies while direct experimental probes remain elusive. Here we identify the transition temperatures for both the unfrustrated and fully-frustrated XY models by probing a Josephson junction array close to equilibrium using weak microwave excitations and measuring the temperature dependence of the effective damping obtained from the complex reflection coefficient. We argue that our probing technique is primarily sensitive to the dynamics of the U(1) part.
1 aCosmic, R.1 aKawabata, K.1 aAshida, Y.1 aIkegami, H.1 aFurukawa, S.1 aPatil, P.1 aTaylor, J., M.1 aNakamura, Y. uhttps://arxiv.org/abs/2001.0787702048nas a2200145 4500008004100000245005900041210005900100260001500159520160200174100001801776700002201794700002601816700002301842856003701865 2020 eng d00aProgrammable Quantum Annealers as Noisy Gibbs Samplers0 aProgrammable Quantum Annealers as Noisy Gibbs Samplers c12/16/20203 aDrawing independent samples from high-dimensional probability distributions represents the major computational bottleneck for modern algorithms, including powerful machine learning frameworks such as deep learning. The quest for discovering larger families of distributions for which sampling can be efficiently realized has inspired an exploration beyond established computing methods and turning to novel physical devices that leverage the principles of quantum computation. Quantum annealing embodies a promising computational paradigm that is intimately related to the complexity of energy landscapes in Gibbs distributions, which relate the probabilities of system states to the energies of these states. Here, we study the sampling properties of physical realizations of quantum annealers which are implemented through programmable lattices of superconducting flux qubits. Comprehensive statistical analysis of the data produced by these quantum machines shows that quantum annealers behave as samplers that generate independent configurations from low-temperature noisy Gibbs distributions. We show that the structure of the output distribution probes the intrinsic physical properties of the quantum device such as effective temperature of individual qubits and magnitude of local qubit noise, which result in a non-linear response function and spurious interactions that are absent in the hardware implementation. We anticipate that our methodology will find widespread use in characterization of future generations of quantum annealers and other emerging analog computing devices.
1 aVuffray, Marc1 aCoffrin, Carleton1 aKharkov, Yaroslav, A.1 aLokhov, Andrey, Y. uhttps://arxiv.org/abs/2012.0882701173nas a2200157 4500008004100000245006400041210006400105260001500169490000600184520070600190100002700896700002300923700001700946700001500963856003700978 2020 eng d00aQuantum algorithms and lower bounds for convex optimization0 aQuantum algorithms and lower bounds for convex optimization c12/18/20190 v43 aWhile recent work suggests that quantum computers can speed up the solution of semidefinite programs, little is known about the quantum complexity of more general convex optimization. We present a quantum algorithm that can optimize a convex function over an n-dimensional convex body using O~(n) queries to oracles that evaluate the objective function and determine membership in the convex body. This represents a quadratic improvement over the best-known classical algorithm. We also study limitations on the power of quantum computers for general convex optimization, showing that it requires Ω~(n−−√) evaluation queries and Ω(n−−√) membership queries.
1 aChakrabarti, Shouvanik1 aChilds, Andrew, M.1 aLi, Tongyang1 aWu, Xiaodi uhttps://arxiv.org/abs/1809.0173101627nas a2200193 4500008004100000245002900041210002900070260001400099300001500113490000800128520112700136100002801263700002301291700002301314700001901337700002001356700002001376856003701396 2020 eng d00aQuantum Coupon Collector0 aQuantum Coupon Collector c2/18/2020 a10:1-10:170 v1583 aWe study how efficiently a k-element set S⊆[n] can be learned from a uniform superposition |S〉 of its elements. One can think of |S〉=∑i∈S|i〉/|S|−−−√ as the quantum version of a uniformly random sample over S, as in the classical analysis of the ``coupon collector problem.'' We show that if k is close to n, then we can learn S using asymptotically fewer quantum samples than random samples. In particular, if there are n−k=O(1) missing elements then O(k) copies of |S〉 suffice, in contrast to the Θ(klogk) random samples needed by a classical coupon collector. On the other hand, if n−k=Ω(k), then Ω(klogk) quantum samples are~necessary. More generally, we give tight bounds on the number of quantum samples needed for every k and n, and we give efficient quantum learning algorithms. We also give tight bounds in the model where we can additionally reflect through |S〉. Finally, we relate coupon collection to a known example separating proper and improper PAC learning that turns out to show no separation in the quantum case.
1 aArunachalam, Srinivasan1 aBelovs, Aleksandrs1 aChilds, Andrew, M.1 aKothari, Robin1 aRosmanis, Ansis1 ade Wolf, Ronald uhttps://arxiv.org/abs/2002.0768801292nas a2200145 4500008004100000245005600041210005600097260001400153300001400167490000800181520087900189100002301068700001801091856003701109 2020 eng d00aQuantum spectral methods for differential equations0 aQuantum spectral methods for differential equations c2/18/2020 a1427-14570 v3753 aRecently developed quantum algorithms address computational challenges in numerical analysis by performing linear algebra in Hilbert space. Such algorithms can produce a quantum state proportional to the solution of a d-dimensional system of linear equations or linear differential equations with complexity poly(logd). While several of these algorithms approximate the solution to within ε with complexity poly(log(1/ε)), no such algorithm was previously known for differential equations with time-dependent coefficients. Here we develop a quantum algorithm for linear ordinary differential equations based on so-called spectral methods, an alternative to finite difference methods that approximates the solution globally. Using this approach, we give a quantum algorithm for time-dependent initial and boundary value problems with complexity poly(logd,log(1/ε)).
1 aChilds, Andrew, M.1 aLiu, Jin-Peng uhttps://arxiv.org/abs/1901.0096101551nas a2200193 4500008004100000245009300041210006900134260001300203520092900216100002101145700001901166700002201185700001601207700002401223700002401247700002601271700002301297856003701320 2020 eng d00aQuantum walks and Dirac cellular automata on a programmable trapped-ion quantum computer0 aQuantum walks and Dirac cellular automata on a programmable trap c2/6/20203 aThe quantum walk formalism is a widely used and highly successful framework for modeling quantum systems, such as simulations of the Dirac equation, different dynamics in both the low and high energy regime, and for developing a wide range of quantum algorithms. Here we present the circuit-based implementation of a discrete-time quantum walk in position space on a five-qubit trapped-ion quantum processor. We encode the space of walker positions in particular multi-qubit states and program the system to operate with different quantum walk parameters, experimentally realizing a Dirac cellular automaton with tunable mass parameter. The quantum walk circuits and position state mapping scale favorably to a larger model and physical systems, allowing the implementation of any algorithm based on discrete-time quantum walks algorithm and the dynamics associated with the discretized version of the Dirac equation.
1 aAlderete, Huerta1 aSingh, Shivani1 aNguyen, Nhung, H.1 aZhu, Daiwei1 aBalu, Radhakrishnan1 aMonroe, Christopher1 aChandrashekar, C., M.1 aLinke, Norbert, M. uhttps://arxiv.org/abs/2002.0253702278nas a2200121 4500008004100000245012000041210006900161260001500230520183200245100002102077700002102098856003702119 2020 eng d00aQuasi-polynomial Time Approximation of Output Probabilities of Constant-depth, Geometrically-local Quantum Circuits0 aQuasipolynomial Time Approximation of Output Probabilities of Co c12/10/20203 aWe present a classical algorithm that, for any 3D geometrically-local, constant-depth quantum circuit C, and any bit string x∈{0,1}n, can compute the quantity |<x|C|0⊗n>|2 to within any inverse-polynomial additive error in quasi-polynomial time. It is known that it is #P-hard to compute this same quantity to within 2−n2 additive error [Mov20]. The previous best known algorithm for this problem used O(2n1/3poly(1/ε)) time to compute probabilities to within additive error ε [BGM20]. Notably, the [BGM20] paper included an elegant polynomial time algorithm for the same estimation task with 2D circuits, which makes a novel use of 1D Matrix Product States carefully tailored to the 2D geometry of the circuit in question. Surprisingly, it is not clear that it is possible to extend this use of MPS to address the case of 3D circuits in polynomial time. This raises a natural question as to whether the computational complexity of the 3D problem might be drastically higher than that of the 2D problem. In this work we address this question by exhibiting a quasi-polynomial time algorithm for the 3D case. In order to surpass the technical barriers encountered by previously known techniques we are forced to pursue a novel approach: Our algorithm has a Divide-and-Conquer structure, constructing a recursive sub-division of the given 3D circuit using carefully designed block-encodings, each creating a 3D-local circuit on at most half the number of qubits as the original. This division step is then applied recursively, expressing the original quantity as a weighted sum of smaller and smaller 3D-local quantum circuits. A central technical challenge is to control correlations arising from the entanglement that may exist between the different circuit "pieces" produced this way.
1 aCoble, Nolan, J.1 aCoudron, Matthew uhttps://arxiv.org/abs/2012.0546002321nas a2200121 4500008004100000245011300041210006900154260001500223520188200238100002102120700002102141856003702162 2020 eng d00aQuasi-polynomial time approximation of output probabilities of geometrically-local, shallow quantum circuits0 aQuasipolynomial time approximation of output probabilities of ge c12/10/20203 aWe present a classical algorithm that, for any 3D geometrically-local, polylogarithmic-depth quantum circuit C acting on n qubits, and any bit string x∈{0,1}n, can compute the quantity |<x|C|0⊗n>|2 to within any inverse-polynomial additive error in quasi-polynomial time. It is known that it is #P-hard to compute this same quantity to within 2−n2 additive error [Mov20, KMM21]. The previous best known algorithm for this problem used O(2n1/3poly(1/ϵ)) time to compute probabilities to within additive error ϵ [BGM20]. Notably, the [BGM20] paper included an elegant polynomial time algorithm for this estimation task restricted to 2D circuits, which makes a novel use of 1D Matrix Product States (MPS) carefully tailored to the 2D geometry of the circuit in question. Surprisingly, it is not clear that it is possible to extend this use of MPS to address the case of 3D circuits in polynomial time. This raises a natural question as to whether the computational complexity of the 3D problem might be drastically higher than that of the 2D problem. In this work we address this question by exhibiting a quasi-polynomial time algorithm for the 3D case. In order to surpass the technical barriers encountered by previously known techniques we are forced to pursue a novel approach.
Our algorithm has a Divide-and-Conquer structure, demonstrating how to approximate the desired quantity via several instantiations of the same problem type, each involving 3D-local circuits on about half the number of qubits as the original. This division step is then applied recursively, expressing the original quantity as a weighted combination of smaller and smaller 3D-local quantum circuits. A central technical challenge is to control correlations arising from entanglement that may exist between the different circuit ``pieces" produced this way.
Quantum nano-devices are fundamental systems in quantum thermodynamics that have been the subject of profound interest in recent years. Among these, quantum batteries play a very important role. In this paper we lay down a theory of random quantum batteries and provide a systematic way of computing the average work and work fluctuations in such devices by investigating their typical behavior. We show that the performance of random quantum batteries exhibits typicality and depends only on the spectral properties of the time evolving operator, the initial state and the measuring Hamiltonian. At given revival times a random quantum battery features a quantum advantage over classical random batteries. Our method is particularly apt to be used both for exactly solvable models like the Jaynes-Cummings model or in perturbation theory, e.g., systems subject to harmonic perturbations. We also study the setting of quantum adiabatic random batteries.
1 aCaravelli, Francesco1 aDe Wit, Ghislaine, Coulter-1 aGarcía-Pintos, Luis, Pedro1 aHamma, Alioscia uhttps://arxiv.org/abs/1908.0806401689nas a2200145 4500008004100000245002500041210002500066260001400091520132300105100002101428700001601449700002001465700002101485856003701506 2020 eng d00aRaw Image Deblurring0 aRaw Image Deblurring c12/8/20203 aDeep learning-based blind image deblurring plays an essential role in solving image blur since all existing kernels are limited in modeling the real world blur. Thus far, researchers focus on powerful models to handle the deblurring problem and achieve decent results. For this work, in a new aspect, we discover the great opportunity for image enhancement (e.g., deblurring) directly from RAW images and investigate novel neural network structures benefiting RAW-based learning. However, to the best of our knowledge, there is no available RAW image deblurring dataset. Therefore, we built a new dataset containing both RAW images and processed sRGB images and design a new model to utilize the unique characteristics of RAW images. The proposed deblurring model, trained solely from RAW images, achieves the state-of-art performance and outweighs those trained on processed sRGB images. Furthermore, with fine-tuning, the proposed model, trained on our new dataset, can generalize to other sensors. Additionally, by a series of experiments, we demonstrate that existing deblurring models can also be improved by training on the RAW images in our new dataset. Ultimately, we show a new venue for further opportunities based on the devised novel raw-based deblurring method and the brand-new Deblur-RAW dataset.
1 aLiang, Chih-Hung1 aChen, Yu-An1 aLiu, Yueh-Cheng1 aHsu, Winston, H. uhttps://arxiv.org/abs/2012.0426401558nas a2200217 4500008004100000245008100041210006900122260001500191520086200206100002301068700001601091700002401107700002101131700003001152700002801182700002401210700001801234700002601252700002501278856003701303 2020 eng d00aResonant enhancement of three-body loss between strongly interacting photons0 aResonant enhancement of threebody loss between strongly interact c10/19/20203 aRydberg polaritons provide an example of a rare type of system where three-body interactions can be as strong or even stronger than two-body interactions. The three-body interactions can be either dispersive or dissipative, with both types possibly giving rise to exotic, strongly-interacting, and topological phases of matter. Despite past theoretical and experimental studies of the regime with dispersive interaction, the dissipative regime is still mostly unexplored. Using a renormalization group technique to solve the three-body Schrödinger equation, we show how the shape and strength of dissipative three-body forces can be universally enhanced for Rydberg polaritons. We demonstrate how these interactions relate to the transmission through a single-mode cavity, which can be used as a probe of the three-body physics in current experiment
1 aKalinowski, Marcin1 aWang, Yidan1 aBienias, Przemyslaw1 aGullans, Michael1 aOrnelas-Huerta, Dalia, P.1 aCraddock, Alexander, N.1 aRolston, Steven, L.1 aPorto, J., V.1 aBüchler, Hans, Peter1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/2010.0977201214nas a2200145 4500008004100000245004500041210004500086260001300131490000700144520081700151100002300968700002100991700001901012856003701031 2020 eng d00aRobust Encoding of a Qubit in a Molecule0 aRobust Encoding of a Qubit in a Molecule c9/1/20200 v103 aWe construct quantum error-correcting codes that embed a finite-dimensional code space in the infinite-dimensional Hilbert space of rotational states of a rigid body. These codes, which protect against both drift in the body’s orientation and small changes in its angular momentum, may be well suited for robust storage and coherent processing of quantum information using rotational states of a polyatomic molecule. Extensions of such codes to rigid bodies with a symmetry axis are compatible with rotational states of diatomic molecules as well as nuclear states of molecules and atoms. We also describe codes associated with general non-Abelian groups and develop orthogonality relations for coset spaces, laying the groundwork for quantum information processing with exotic configuration spaces.
1 aAlbert, Victor, V.1 aCovey, Jacob, P.1 aPreskill, John uhttps://arxiv.org/abs/1911.0009902222nas a2200169 4500008004100000245010800041210006900149260001400218520167700232100001801909700001901927700001701946700001901963700001501982700001801997856003702015 2020 eng d00aSampling-based sublinear low-rank matrix arithmetic framework for dequantizing quantum machine learning0 aSamplingbased sublinear lowrank matrix arithmetic framework for c6/18/20203 aWe present an algorithmic framework for quantum-inspired classical algorithms on close-to-low-rank matrices, generalizing the series of results started by Tang's breakthrough quantum-inspired algorithm for recommendation systems [STOC'19]. Motivated by quantum linear algebra algorithms and the quantum singular value transformation (SVT) framework of Gilyén et al. [STOC'19], we develop classical algorithms for SVT that run in time independent of input dimension, under suitable quantum-inspired sampling assumptions. Our results give compelling evidence that in the corresponding QRAM data structure input model, quantum SVT does not yield exponential quantum speedups. Since the quantum SVT framework generalizes essentially all known techniques for quantum linear algebra, our results, combined with sampling lemmas from previous work, suffice to generalize all recent results about dequantizing quantum machine learning algorithms. In particular, our classical SVT framework recovers and often improves the dequantization results on recommendation systems, principal component analysis, supervised clustering, support vector machines, low-rank regression, and semidefinite program solving. We also give additional dequantization results on low-rank Hamiltonian simulation and discriminant analysis. Our improvements come from identifying the key feature of the quantum-inspired input model that is at the core of all prior quantum-inspired results: ℓ2-norm sampling can approximate matrix products in time independent of their dimension. We reduce all our main results to this fact, making our exposition concise, self-contained, and intuitive.
1 aChia, Nai-Hui1 aGilyen, Andras1 aLi, Tongyang1 aLin, Han-Hsuan1 aTang, Ewin1 aWang, Chunhao uhttps://arxiv.org/abs/1910.0615101697nas a2200181 4500008004100000245007000041210006900111260001400180490000800194520115900202100002301361700001501384700001901399700002001418700001901438700002101457856003701478 2020 eng d00aSearch for composite dark matter with optically levitated sensors0 aSearch for composite dark matter with optically levitated sensor c11/2/20200 v1253 aResults are reported from a search for a class of composite dark matter models with feeble, long-range interactions with normal matter. We search for impulses arising from passing dark matter particles by monitoring the mechanical motion of an optically levitated nanogram mass over the course of several days. Assuming such particles constitute the dominant component of dark matter, this search places upper limits on their interaction with neutrons of αn≤1.2×10−7 at 95\% confidence for dark matter masses between 1--10 TeV and mediator masses mφ≤0.1 eV. Due to the large enhancement of the cross-section for dark matter to coherently scatter from a nanogram mass (∼1029 times that for a single neutron) and the ability to detect momentum transfers as small as ∼200 MeV/c, these results provide sensitivity to certain classes of composite dark matter models that substantially exceeds existing searches, including those employing kg-scale or ton-scale targets. Extensions of these techniques can enable directionally-sensitive searches for a broad class of previously inaccessible heavy dark matter candidates.
1 aMonteiro, Fernando1 aAfek, Gadi1 aCarney, Daniel1 aKrnjaic, Gordan1 aWang, Jiaxiang1 aMoore, David, C. uhttps://arxiv.org/abs/2007.1206702382nas a2200145 4500008004100000245007400041210006900115260001500184520192100199100001902120700002402139700001902163700001702182856003702199 2020 eng d00aSecure Quantum Two-Party Computation: Impossibility and Constructions0 aSecure Quantum TwoParty Computation Impossibility and Constructi c10/15/20203 aSecure two-party computation considers the problem of two parties computing a joint function of their private inputs without revealing anything beyond the output of the computation. In this work, we take the first steps towards understanding the setting in which the two parties want to evaluate a joint quantum functionality while using only a classical channel between them. Our first result indicates that it is in general impossible to realize a two-party quantum functionality against malicious adversaries with black-box simulation, relying only on classical channels. The negative result stems from reducing the existence of a black-box simulator to an extractor for classical proof of quantum knowledge, which in turn leads to violation of the quantum no-cloning. Next, we introduce the notion of oblivious quantum function evaluation (OQFE). An OQFE is a two-party quantum cryptographic primitive with one fully classical party (Alice) whose input is (a classical description of a) quantum unitary, U, and a quantum party (Bob) whose input is a quantum state, ψ. In particular, Alice receives a classical output corresponding to the measurement of U(ψ) while Bob receives no output. In OQFE, Bob remains oblivious to Alice's input, while Alice learns nothing about ψ more than what can be learned from the output. We present two constructions, one secure against semi-honest parties and the other against malicious parties. Due to the no-go result mentioned above, we consider what is arguably the best possible notion obtainable in our model concerning malicious adversaries: one-sided simulation security. Our protocol relies on the assumption of injective homomorphic trapdoor OWFs, which in turn rely on the LWE problem. As a result, we put forward a first, simple and modular, construction of one-sided quantum two-party computation and quantum oblivious transfer over classical networks.
1 aCiamp, Michele1 aCojocaru, Alexandru1 aKashefi, Elham1 aMantri, Atul uhttps://arxiv.org/abs/2010.0792502441nas a2200181 4500008004100000245007300041210006900114260001300183520187800196100002702074700002402101700001902125700001902144700002202163700001702185700002002202856003702222 2020 eng d00aSecurity Limitations of Classical-Client Delegated Quantum Computing0 aSecurity Limitations of ClassicalClient Delegated Quantum Comput c7/3/20203 aSecure delegated quantum computing allows a computationally weak client to outsource an arbitrary quantum computation to an untrusted quantum server in a privacy-preserving manner. One of the promising candidates to achieve classical delegation of quantum computation is classical-client remote state preparation (RSPCC), where a client remotely prepares a quantum state using a classical channel. However, the privacy loss incurred by employing RSPCC as a sub-module is unclear.
In this work, we investigate this question using the Constructive Cryptography framework by Maurer and Renner (ICS'11). We first identify the goal of RSPCC as the construction of ideal RSP resources from classical channels and then reveal the security limitations of using RSPCC. First, we uncover a fundamental relationship between constructing ideal RSP resources (from classical channels) and the task of cloning quantum states. Any classically constructed ideal RSP resource must leak to the server the full classical description (possibly in an encoded form) of the generated quantum state, even if we target computational security only. As a consequence, we find that the realization of common RSP resources, without weakening their guarantees drastically, is impossible due to the no-cloning theorem. Second, the above result does not rule out that a specific RSPCC protocol can replace the quantum channel at least in some contexts, such as the Universal Blind Quantum Computing (UBQC) protocol of Broadbent et al. (FOCS '09). However, we show that the resulting UBQC protocol cannot maintain its proven composable security as soon as RSPCC is used as a subroutine. Third, we show that replacing the quantum channel of the above UBQC protocol by the RSPCC protocol QFactory of Cojocaru et al. (Asiacrypt '19), preserves the weaker, game-based, security of UBQC.
Strongly long-range interacting quantum systems---those with interactions decaying as a power-law 1/rα in the distance r on a D-dimensional lattice for α≤D---have received significant interest in recent years. They are present in leading experimental platforms for quantum computation and simulation, as well as in theoretical models of quantum information scrambling and fast entanglement creation. Since no notion of locality is expected in such systems, a general understanding of their dynamics is lacking. As a first step towards rectifying this problem, we prove two new Lieb-Robinson-type bounds that constrain the time for signaling and scrambling in strongly long-range interacting systems, for which no tight bounds were previously known. Our first bound applies to systems mappable to free-particle Hamiltonians with long-range hopping, and is saturable for α≤D/2. Our second bound pertains to generic long-range interacting spin Hamiltonians, and leads to a tight lower bound for the signaling time to extensive subsets of the system for all α<D. This result also lower-bounds the scrambling time, and suggests a path towards achieving a tight scrambling bound that can prove the long-standing fast scrambling conjecture.
1 aGuo, Andrew, Y.1 aTran, Minh, C.1 aChilds, Andrew, M.1 aGorshkov, Alexey, V.1 aGong, Zhe-Xuan uhttps://arxiv.org/abs/1906.0266203206nas a2200253 4500008004100000245010000041210006900141260001200210520236500222100001902587700002702606700001702633700001802650700001602668700001702684700001602701700001702717700001802734700001802752700001702770700002102787700002302808856012102831 2020 eng d00aStatus Report on the Second Round of the NIST Post-Quantum Cryptography Standardization Process0 aStatus Report on the Second Round of the NIST PostQuantum Crypto c07/20203 aThe National Institute of Standards and Technology is in the process of selecting one or more public-key cryptographic algorithms through a public, competition-like process. The new public-key cryptography standards will specify one or more additional digital signatures, public-key encryption, and key-establishment algorithms to augment Federal Information Processing Standard (FIPS) 186-4, Digital Signature Standard (DSS), as well as NIST Special Publication (SP) 800-56A Revision 3, Recommendation for Pair-Wise Key-Establishment Schemes Using Discrete Logarithm Cryptography, and SP 800-56B Revision 2, Recommendation for Pair-Wise Key Establishment Using Integer Factorization Cryptography. It is intended that these algorithms will be capable of protecting sensitive information well into the foreseeable future, including after the advent of quantum computers.
The NIST Post-Quantum Cryptography Standardization Process began in 2017 with 69 candidate algorithms that met both the minimum acceptance criteria and submission requirements. The first round lasted until January 2019, during which candidate algorithms were evaluated based on their security, performance, and other characteristics. NIST selected 26 algorithms to advance to the second round for more analysis. This report describes the evaluation and selection process, based on public feedback and internal review, of the second-round candidates. The report summarizes the 26 second-round candidate algorithms and identifies those selected to move forward to the third round of the competition. The third-round finalist public-key encryption and key-establishment algorithms are Classic McEliece, CRYSTALS-KYBER, NTRU, and SABER. The third-round finalists for digital signatures are CRYSTALS-DILITHIUM, FALCON, and Rainbow. These finalists will be considered for standardization at the end of the third round. In addition, eight alternate candidate algorithms will also advance to the third round: BIKE, FrodoKEM, HQC, NTRU Prime, SIKE, GeMSS, Picnic, and SPHINCS+. These additional candidates are still being considered for standardization, although this is unlikely to occur at the end of the third round. NIST hopes that the announcement of these finalists and additional candidates will serve to focus the cryptographic community’s attention during the next round.
1 aAlagic, Gorjan1 aAlperin-Sheriff, Jacob1 aApon, Daniel1 aCooper, David1 aDang, Quynh1 aKelsey, John1 aLiu, Yi-Kai1 aMiller, Carl1 aMoody, Dustin1 aPeralta, Rene1 aPerlner, Ray1 aRobinson, Angela1 aSmith-Tone, Daniel uhttps://quics.umd.edu/publications/status-report-second-round-nist-post-quantum-cryptography-standardization-process01601nas a2200145 4500008004100000245007200041210006900113260001500182520114400197100001701341700001801358700002701376700001501403856003701418 2020 eng d00aSublinear classical and quantum algorithms for general matrix games0 aSublinear classical and quantum algorithms for general matrix ga c12/11/20203 aWe investigate sublinear classical and quantum algorithms for matrix games, a fundamental problem in optimization and machine learning, with provable guarantees. Given a matrix A∈Rn×d, sublinear algorithms for the matrix game minx∈Xmaxy∈Yy⊤Ax were previously known only for two special cases: (1) Y being the ℓ1-norm unit ball, and (2) X being either the ℓ1- or the ℓ2-norm unit ball. We give a sublinear classical algorithm that can interpolate smoothly between these two cases: for any fixed q∈(1,2], we solve the matrix game where X is a ℓq-norm unit ball within additive error ε in time O~((n+d)/ε2). We also provide a corresponding sublinear quantum algorithm that solves the same task in time O~((n−−√+d−−√)poly(1/ε)) with a quadratic improvement in both n and d. Both our classical and quantum algorithms are optimal in the dimension parameters n and d up to poly-logarithmic factors. Finally, we propose sublinear classical and quantum algorithms for the approximate Carathéodory problem and the ℓq-margin support vector machines as applications.
1 aLi, Tongyang1 aWang, Chunhao1 aChakrabarti, Shouvanik1 aWu, Xiaodi uhttps://arxiv.org/abs/2012.0651901555nas a2200169 4500008004100000245005500041210005300096260001400149520105800163100002201221700002301243700001901266700002401285700002101309700001801330856003701348 2020 eng d00aSymmetries, graph properties, and quantum speedups0 aSymmetries graph properties and quantum speedups c6/23/20203 aAaronson and Ambainis (2009) and Chailloux (2018) showed that fully symmetric (partial) functions do not admit exponential quantum query speedups. This raises a natural question: how symmetric must a function be before it cannot exhibit a large quantum speedup?
In this work, we prove that hypergraph symmetries in the adjacency matrix model allow at most a polynomial separation between randomized and quantum query complexities. We also show that, remarkably, permutation groups constructed out of these symmetries are essentially the only permutation groups that prevent super-polynomial quantum speedups. We prove this by fully characterizing the primitive permutation groups that allow super-polynomial quantum speedups.
In contrast, in the adjacency list model for bounded-degree graphs (where graph symmetry is manifested differently), we exhibit a property testing problem that shows an exponential quantum speedup. These results resolve open questions posed by Ambainis, Childs, and Liu (2010) and Montanaro and de Wolf (2013).
The difficulty of simulating quantum dynamics depends on the norm of the Hamiltonian. When the Hamiltonian varies with time, the simulation complexity should only depend on this quantity instantaneously. We develop quantum simulation algorithms that exploit this intuition. For the case of sparse Hamiltonian simulation, the gate complexity scales with the L1 norm ∫t0dτ∥H(τ)∥max, whereas the best previous results scale with tmaxτ∈[0,t]∥H(τ)∥max. We also show analogous results for Hamiltonians that are linear combinations of unitaries. Our approaches thus provide an improvement over previous simulation algorithms that can be substantial when the Hamiltonian varies significantly. We introduce two new techniques: a classical sampler of time-dependent Hamiltonians and a rescaling principle for the Schrödinger equation. The rescaled Dyson-series algorithm is nearly optimal with respect to all parameters of interest, whereas the sampling-based approach is easier to realize for near-term simulation. By leveraging the L1-norm information, we obtain polynomial speedups for semi-classical simulations of scattering processes in quantum chemistry.
1 aBerry, Dominic, W.1 aChilds, Andrew, M.1 aSu, Yuan1 aWang, Xin1 aWiebe, Nathan uhttps://arxiv.org/abs/1906.0711501306nas a2200169 4500008004100000245011300041210006900154260001400223520072000237100001900957700002600976700002401002700002401026700002301050700002601073856003701099 2020 eng d00aUniversal one-dimensional discrete-time quantum walks and their implementation on near term quantum hardware0 aUniversal onedimensional discretetime quantum walks and their im c1/30/20203 aQuantum walks are a promising framework for developing quantum algorithms and quantum simulations. Quantum walks represent an important test case for the application of quantum computers. Here we present different forms of discrete-time quantum walks and show their equivalence for physical realizations. Using an appropriate digital mapping of the position space on which a walker evolves onto the multi-qubit states in a quantum processor, we present different configurations of quantum circuits for the implementation of discrete-time quantum walks in one-dimensional position space. With example circuits for a five qubit machine we address scalability to higher dimensions and larger quantum processors.
1 aSingh, Shivani1 aAlderete, Cinthia, H.1 aBalu, Radhakrishnan1 aMonroe, Christopher1 aLinke, Norbert, M.1 aChandrashekar, C., M. uhttps://arxiv.org/abs/2001.1119701125nas a2200121 4500008004100000245003500041210003500076260001500111520080500126100001600931700001900947856003700966 2019 eng d00aChaos in a quantum rotor model0 aChaos in a quantum rotor model c01/29/20193 aWe study scrambling in a model consisting of a number N of M-component quantum rotors coupled by random infinite-range interactions. This model is known to have both a paramagnetic phase and a spin glass phase separated by second order phase transition. We calculate in perturbation theory the squared commutator of rotor fields at different sites in the paramagnetic phase, to leading non-trivial order at large N and large M. This quantity diagnoses the onset of quantum chaos in this system, and we show that the squared commutator grows exponentially with time, with a Lyapunov exponent proportional to 1M. At high temperature, the Lyapunov exponent limits to a value set by the microscopic couplings, while at low temperature, the exponent exhibits a T4 dependence on temperature T.
1 aCheng, Gong1 aSwingle, Brian uhttps://arxiv.org/abs/1901.1044601730nas a2200145 4500008004100000245005400041210005400095260001500149490000900164520131300173100002301486700001901509700001901528856003701547 2019 eng d00aCircuit Transformations for Quantum Architectures0 aCircuit Transformations for Quantum Architectures c02/25/20190 v135 3 aQuantum computer architectures impose restrictions on qubit interactions. We propose efficient circuit transformations that modify a given quantum circuit to fit an architecture, allowing for any initial and final mapping of circuit qubits to architecture qubits. To achieve this, we first consider the qubit movement subproblem and use the routing via matchings framework to prove tighter bounds on parallel routing. In practice, we only need to perform partial permutations, so we generalize routing via matchings to that setting. We give new routing procedures for common architecture graphs and for the generalized hierarchical product of graphs, which produces subgraphs of the Cartesian product. Secondly, for serial routing, we consider the token swapping framework and extend a 4-approximation algorithm for general graphs to support partial permutations. We apply these routing procedures to give several circuit transformations, using various heuristic qubit placement subroutines. We implement these transformations in software and compare their performance for large quantum circuits on grid and modular architectures, identifying strategies that work well in practice.
1 aChilds, Andrew, M.1 aSchoute, Eddie1 aUnsal, Cem, M. uhttps://arxiv.org/abs/1902.0910202955nas a2200397 4500008004100000245008600041210006900127260001500196520181200211100002102023700002302044700002002067700001702087700002202104700001702126700002502143700001802168700001902186700001702205700001702222700002702239700001502266700001702281700001802298700001702316700001602333700002002349700001902369700002302388700002502411700002402436700001802460700002002478700002202498856003702520 2019 eng d00aDevelopment of Quantum InterConnects for Next-Generation Information Technologies0 aDevelopment of Quantum InterConnects for NextGeneration Informat c12/13/20193 aJust as classical information technology rests on a foundation built of interconnected information-processing systems, quantum information technology (QIT) must do the same. A critical component of such systems is the interconnect, a device or process that allows transfer of information between disparate physical media, for example, semiconductor electronics, individual atoms, light pulses in optical fiber, or microwave fields. While interconnects have been well engineered for decades in the realm of classical information technology, quantum interconnects (QuICs) present special challenges, as they must allow the transfer of fragile quantum states between different physical parts or degrees of freedom of the system. The diversity of QIT platforms (superconducting, atomic, solid-state color center, optical, etc.) that will form a quantum internet poses additional challenges. As quantum systems scale to larger size, the quantum interconnect bottleneck is imminent, and is emerging as a grand challenge for QIT. For these reasons, it is the position of the community represented by participants of the NSF workshop on Quantum Interconnects that accelerating QuIC research is crucial for sustained development of a national quantum science and technology program. Given the diversity of QIT platforms, materials used, applications, and infrastructure required, a convergent research program including partnership between academia, industry and national laboratories is required. This document is a summary from a U.S. National Science Foundation supported workshop held on 31 October - 1 November 2019 in Alexandria, VA. Attendees were charged to identify the scientific and community needs, opportunities, and significant challenges for quantum interconnects over the next 2-5 years.
1 aAwschalom, David1 aBerggren, Karl, K.1 aBernien, Hannes1 aBhave, Sunil1 aCarr, Lincoln, D.1 aDavids, Paul1 aEconomou, Sophia, E.1 aEnglund, Dirk1 aFaraon, Andrei1 aFejer, Marty1 aGuha, Saikat1 aGustafsson, Martin, V.1 aHu, Evelyn1 aJiang, Liang1 aKim, Jungsang1 aKorzh, Boris1 aKumar, Prem1 aKwiat, Paul, G.1 aLončar, Marko1 aLukin, Mikhail, D.1 aMiller, David, A. B.1 aMonroe, Christopher1 aNam, Sae, Woo1 aNarang, Prineha1 aOrcutt, Jason, S. uhttps://arxiv.org/abs/1912.0664201284nas a2200145 4500008004100000245004700041210004700088260001500135490000600150520088800156100002301044700002101067700001301088856003701101 2019 eng d00aFaster quantum simulation by randomization0 aFaster quantum simulation by randomization c08/28/20190 v33 aProduct formulas can be used to simulate Hamiltonian dynamics on a quantum computer by approximating the exponential of a sum of operators by a product of exponentials of the individual summands. This approach is both straightforward and surprisingly efficient. We show that by simply randomizing how the summands are ordered, one can prove stronger bounds on the quality of approximation and thereby give more efficient simulations. Indeed, we show that these bounds can be asymptotically better than previous bounds that exploit commutation between the summands, despite using much less information about the structure of the Hamiltonian. Numerical evidence suggests that our randomized algorithm may be advantageous even for near-term quantum simulation.
1 aChilds, Andrew, M.1 aOstrander, Aaron1 aSu, Yuan uhttps://arxiv.org/abs/1805.0838502376nas a2200409 4500008004100000245009100041210006900132260001500201520116700216100001801383700001701401700002201418700002001440700001901460700001901479700002301498700001901521700002101540700001901561700002201580700002001602700002201622700002201644700002101666700002201687700002301709700001901732700002001751700002701771700002201798700001801820700001901838700003001857700002401887700001801911856003701929 2019 eng d00aGround-state energy estimation of the water molecule on a trapped ion quantum computer0 aGroundstate energy estimation of the water molecule on a trapped c03/07/20193 aQuantum computing leverages the quantum resources of superposition and entanglement to efficiently solve computational problems considered intractable for classical computers. Examples include calculating molecular and nuclear structure, simulating strongly-interacting electron systems, and modeling aspects of material function. While substantial theoretical advances have been made in mapping these problems to quantum algorithms, there remains a large gap between the resource requirements for solving such problems and the capabilities of currently available quantum hardware. Bridging this gap will require a co-design approach, where the expression of algorithms is developed in conjunction with the hardware itself to optimize execution. Here, we describe a scalable co-design framework for solving chemistry problems on a trapped ion quantum computer, and apply it to compute the ground-state energy of the water molecule. The robust operation of the trapped ion quantum computer yields energy estimates with errors approaching the chemical accuracy, which is the target threshold necessary for predicting the rates of chemical reaction dynamics.
1 aNam, Yunseong1 aChen, Jwo-Sy1 aPisenti, Neal, C.1 aWright, Kenneth1 aDelaney, Conor1 aMaslov, Dmitri1 aBrown, Kenneth, R.1 aAllen, Stewart1 aAmini, Jason, M.1 aApisdorf, Joel1 aBeck, Kristin, M.1 aBlinov, Aleksey1 aChaplin, Vandiver1 aChmielewski, Mika1 aCollins, Coleman1 aDebnath, Shantanu1 aDucore, Andrew, M.1 aHudek, Kai, M.1 aKeesan, Matthew1 aKreikemeier, Sarah, M.1 aMizrahi, Jonathan1 aSolomon, Phil1 aWilliams, Mike1 aWong-Campos, Jaime, David1 aMonroe, Christopher1 aKim, Jungsang uhttps://arxiv.org/abs/1902.1017101431nas a2200133 4500008004100000245007400041210006900115260001500184520099900199100001701198700002601215700001901241856003701260 2019 eng d00aHow Low Can Vacuum Energy Go When Your Fields Are Finite-Dimensional?0 aHow Low Can Vacuum Energy Go When Your Fields Are FiniteDimensio c05/11/20193 aAccording to the holographic bound, there is only a finite density of degrees of freedom in space when gravity is taken into account. Conventional quantum field theory does not conform to this bound, since in this framework, infinitely many degrees of freedom may be localized to any given region of space. In this essay, we explore the viewpoint that quantum field theory may emerge from an underlying theory that is locally finite-dimensional, and we construct a locally finite-dimensional version of a Klein-Gordon scalar field using generalized Clifford algebras. Demanding that the finite-dimensional field operators obey a suitable version of the canonical commutation relations makes this construction essentially unique. We then find that enforcing local finite dimensionality in a holographically consistent way leads to a huge suppression of the quantum contribution to vacuum energy, to the point that the theoretical prediction becomes plausibly consistent with observations.
1 aCao, ChunJun1 aChatwin-Davies, Aidan1 aSingh, Ashmeet uhttps://arxiv.org/abs/1905.1119901741nas a2200205 4500008004100000245007000041210006900111260001500180490000600195520112800201100001901329700002001348700001301368700002401381700002201405700002301427700002301450700002501473856003701498 2019 eng d00aLocality and digital quantum simulation of power-law interactions0 aLocality and digital quantum simulation of powerlaw interactions c07/10/20190 v93 aThe propagation of information in non-relativistic quantum systems obeys a speed limit known as a Lieb-Robinson bound. We derive a new Lieb-Robinson bound for systems with interactions that decay with distance r as a power law, 1/rα. The bound implies an effective light cone tighter than all previous bounds. Our approach is based on a technique for approximating the time evolution of a system, which was first introduced as part of a quantum simulation algorithm by Haah et al. [arXiv:1801.03922]. To bound the error of the approximation, we use a known Lieb-Robinson bound that is weaker than the bound we establish. This result brings the analysis full circle, suggesting a deep connection between Lieb-Robinson bounds and digital quantum simulation. In addition to the new Lieb-Robinson bound, our analysis also gives an error bound for the Haah et al. quantum simulation algorithm when used to simulate power-law decaying interactions. In particular, we show that the gate count of the algorithm scales with the system size better than existing algorithms when α>3D (where D is the number of dimensions).
1 aTran, Minh, C.1 aGuo, Andrew, Y.1 aSu, Yuan1 aGarrison, James, R.1 aEldredge, Zachary1 aFoss-Feig, Michael1 aChilds, Andrew, M.1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/1808.0522501490nas a2200133 4500008004100000245005800041210005800099260001500157490000800172520110300180100002301283700001301306856003701319 2019 eng d00aNearly optimal lattice simulation by product formulas0 aNearly optimal lattice simulation by product formulas c12/17/20190 v1233 aProduct formulas provide a straightforward yet surprisingly efficient approach to quantum simulation. We show that this algorithm can simulate an n-qubit Hamiltonian with nearest-neighbor interactions evolving for time t using only (nt)1+o(1) gates. While it is reasonable to expect this complexity---in particular, this was claimed without rigorous justification by Jordan, Lee, and Preskill---we are not aware of a straightforward proof. Our approach is based on an analysis of the local error structure of product formulas, as introduced by Descombes and Thalhammer and significantly simplified here. We prove error bounds for canonical product formulas, which include well-known constructions such as the Lie-Trotter-Suzuki formulas. We also develop a local error representation for time-dependent Hamiltonian simulation, and we discuss generalizations to periodic boundary conditions, constant-range interactions, and higher dimensions. Combined with a previous lower bound, our result implies that product formulas can simulate lattice Hamiltonians with nearly optimal gate complexity.
1 aChilds, Andrew, M.1 aSu, Yuan uhttps://arxiv.org/abs/1901.0056401912nas a2200265 4500008004100000245007900041210006900120260001500189520117500204100001601379700001501395700001201410700001501422700002001437700001101457700001301468700001901481700002001500700001701520700001501537700001701552700002501569700001501594856003701609 2019 eng d00aObservation of Domain Wall Confinement and Dynamics in a Quantum Simulator0 aObservation of Domain Wall Confinement and Dynamics in a Quantum c12/23/20193 aConfinement is a ubiquitous mechanism in nature, whereby particles feel an attractive force that increases without bound as they separate. A prominent example is color confinement in particle physics, in which baryons and mesons are produced by quark confinement. Analogously, confinement can also occur in low-energy quantum many-body systems when elementary excitations are confined into bound quasiparticles. Here, we report the first observation of magnetic domain wall confinement in interacting spin chains with a trapped-ion quantum simulator. By measuring how correlations spread, we show that confinement can dramatically suppress information propagation and thermalization in such many-body systems. We are able to quantitatively determine the excitation energy of domain wall bound states from non-equilibrium quench dynamics. Furthermore, we study the number of domain wall excitations created for different quench parameters, in a regime that is difficult to model with classical computers. This work demonstrates the capability of quantum simulators for investigating exotic high-energy physics phenomena, such as quark collision and string breaking
1 aTan, W., L.1 aBecker, P.1 aLiu, F.1 aPagano, G.1 aCollins, K., S.1 aDe, A.1 aFeng, L.1 aKaplan, H., B.1 aKyprianidis, A.1 aLundgren, R.1 aMorong, W.1 aWhitsitt, S.1 aGorshkov, Alexey, V.1 aMonroe, C. uhttps://arxiv.org/abs/1912.1111702010nas a2200409 4500008004100000245006800041210006600109260001500175520084400190100001901034700002601053700002001079700002001099700002001119700001701139700002501156700002201181700001901203700001701222700002201239700002101261700002501282700001901307700002301326700001801349700001901367700002101386700002101407700001501428700002001443700002401463700001801487700002301505700001901528700001601547856003701563 2019 eng d00aOpportunities for Nuclear Physics & Quantum Information Science0 aOpportunities for Nuclear Physics Quantum Information Science c03/13/20193 ahis whitepaper is an outcome of the workshop Intersections between Nuclear Physics and Quantum Information held at Argonne National Laboratory on 28-30 March 2018 [www.phy.anl.gov/npqi2018/]. The workshop brought together 116 national and international experts in nuclear physics and quantum information science to explore opportunities for the two fields to collaborate on topics of interest to the U.S. Department of Energy (DOE) Office of Science, Office of Nuclear Physics, and more broadly to U.S. society and industry. The workshop consisted of 22 invited and 10 contributed talks, as well as three panel discussion sessions. Topics discussed included quantum computation, quantum simulation, quantum sensing, nuclear physics detectors, nuclear many-body problem, entanglement at collider energies, and lattice gauge theories.
1 aCloët, I., C.1 aDietrich, Matthew, R.1 aArrington, John1 aBazavov, Alexei1 aBishof, Michael1 aFreese, Adam1 aGorshkov, Alexey, V.1 aGrassellino, Anna1 aHafidi, Kawtar1 aJacob, Zubin1 aMcGuigan, Michael1 aMeurice, Yannick1 aMeziani, Zein-Eddine1 aMueller, Peter1 aMuschik, Christine1 aOsborn, James1 aOtten, Matthew1 aPetreczky, Peter1 aPolakovic, Tomas1 aPoon, Alan1 aPooser, Raphael1 aRoggero, Alessandro1 aSaffman, Mark1 aVanDevender, Brent1 aZhang, Jiehang1 aZohar, Erez uhttps://arxiv.org/abs/1903.0545301434nas a2200193 4500008004100000245005500041210005500096260001500151490000800166520090200174100001701076700001601093700001701109700001801126700002101144700001701165700002101182856003701203 2019 eng d00aPhoton pair condensation by engineered dissipation0 aPhoton pair condensation by engineered dissipation c04/02/20190 v1233 aDissipation can usually induce detrimental decoherence in a quantum system. However, engineered dissipation can be used to prepare and stabilize coherent quantum many-body states. Here, we show that by engineering dissipators containing photon pair operators, one can stabilize an exotic dark state, which is a condensate of photon pairs with a phase-nematic order. In this system, the usual superfluid order parameter, i.e. single-photon correlation, is absent, while the photon pair correlation exhibits long-range order. Although the dark state is not unique due to multiple parity sectors, we devise an additional type of dissipators to stabilize the dark state in a particular parity sector via a diffusive annihilation process which obeys Glauber dynamics in an Ising model. Furthermore, we propose an implementation of these photon-pair dissipators in circuit-QED architecture.
1 aCian, Ze-Pei1 aZhu, Guanyu1 aChu, Su-Kuan1 aSeif, Alireza1 aDeGottardi, Wade1 aJiang, Liang1 aHafezi, Mohammad uhttps://arxiv.org/abs/1904.0001601709nas a2200241 4500008004100000245007100041210006900112260001500181520103600196100001501232700002101247700001801268700001801286700002501304700001301329700001401342700001201356700001501368700001701383700001401400700001601414856003701430 2019 eng d00aProgrammable Quantum Simulations of Spin Systems with Trapped Ions0 aProgrammable Quantum Simulations of Spin Systems with Trapped Io c12/17/20193 aLaser-cooled and trapped atomic ions form an ideal standard for the simulation of interacting quantum spin models. Effective spins are represented by appropriate internal energy levels within each ion, and the spins can be measured with near-perfect efficiency using state-dependent fluorescence techniques. By applying optical fields that exert optical dipole forces on the ions, their Coulomb interaction can be modulated in ways that give rise to long-range and tunable spin-spin interactions that can be reconfigured by shaping the spectrum and pattern of the laser fields. Here we review the theoretical mapping of atomic ions to interacting spin systems, the experimental preparation of complex equilibrium states, and the study of dynamical processes of this many-body interacting quantum system. The use of such quantum simulators for studying spin models may inform our understanding of exotic quantum materials and shed light on interacting quantum systems that cannot be modeled with conventional computers.
1 aMonroe, C.1 aCampbell, W., C.1 aDuan, L., -M.1 aGong, Z., -X.1 aGorshkov, Alexey, V.1 aHess, P.1 aIslam, R.1 aKim, K.1 aPagano, G.1 aRicherme, P.1 aSenko, C.1 aYao, N., Y. uhttps://arxiv.org/abs/1912.0784501091nas a2200145 4500008004100000245005500041210005500096260001500151490000800166520066600174100002300840700002400863700002100887856003700908 2019 eng d00aQuantum Algorithm for Simulating the Wave Equation0 aQuantum Algorithm for Simulating the Wave Equation c03/24/20190 v99 3 aWe present a quantum algorithm for simulating the wave equation under Dirichlet and Neumann boundary conditions. The algorithm uses Hamiltonian simulation and quantum linear system algorithms as subroutines. It relies on factorizations of discretized Laplacian operators to allow for improved scaling in truncation errors and improved scaling for state preparation relative to general purpose linear differential equation algorithms. We also consider using Hamiltonian simulation for Klein-Gordon equations and Maxwell's equations.
1 aCosta, Pedro, C.S.1 aJordan, Stephen, P.1 aOstrander, Aaron uhttps://arxiv.org/abs/1711.0539401764nas a2200289 4500008004100000245007400041210006900115260001500184520095900199100001501158700001401173700001501187700002001202700001101222700001701233700001901250700002001269700001601289700002901305700001801334700001801352700001201370700001501382700002501397700001501422856003701437 2019 eng d00aQuantum Approximate Optimization with a Trapped-Ion Quantum Simulator0 aQuantum Approximate Optimization with a TrappedIon Quantum Simul c06/06/20193 aQuantum computers and simulators may offer significant advantages over their classical counterparts, providing insights into quantum many-body systems and possibly solving exponentially hard problems, such as optimization and satisfiability. Here we report the first implementation of a shallow-depth Quantum Approximate Optimization Algorithm (QAOA) using an analog quantum simulator to estimate the ground state energy of the transverse field Ising model with tunable long-range interactions. First, we exhaustively search the variational control parameters to approximate the ground state energy with up to 40 trapped-ion qubits. We then interface the quantum simulator with a classical algorithm to more efficiently find the optimal set of parameters that minimizes the resulting energy of the system. We finally sample from the full probability distribution of the QAOA output with single-shot and efficient measurements of every qubit.
1 aPagano, G.1 aBapat, A.1 aBecker, P.1 aCollins, K., S.1 aDe, A.1 aHess, P., W.1 aKaplan, H., B.1 aKyprianidis, A.1 aTan, W., L.1 aBaldwin, Christopher, L.1 aBrady, L., T.1 aDeshpande, A.1 aLiu, F.1 aJordan, S.1 aGorshkov, Alexey, V.1 aMonroe, C. uhttps://arxiv.org/abs/1906.0270001947nas a2200397 4500008004100000245005400041210005400095260001500149520085000164100001801014700001601032700002301048700002301071700002201094700002401116700001901140700001801159700001801177700002001195700002501215700001801240700001801258700001901276700001901295700001601314700002301330700001901353700001701372700002401389700001901413700002201432700001901454700001901473700002001492856003701512 2019 eng d00aQuantum Computer Systems for Scientific Discovery0 aQuantum Computer Systems for Scientific Discovery c12/16/20193 aThe great promise of quantum computers comes with the dual challenges of building them and finding their useful applications. We argue that these two challenges should be considered together, by co-designing full stack quantum computer systems along with their applications in order to hasten their development and potential for scientific discovery. In this context, we identify scientific and community needs, opportunities, and significant challenges for the development of quantum computers for science over the next 2-10 years. This document is written by a community of university, national laboratory, and industrial researchers in the field of Quantum Information Science and Technology, and is based on a summary from a U.S. National Science Foundation workshop on Quantum Computing held on October 21-22, 2019 in Alexandria, VA.
1 aAlexeev, Yuri1 aBacon, Dave1 aBrown, Kenneth, R.1 aCalderbank, Robert1 aCarr, Lincoln, D.1 aChong, Frederic, T.1 aDeMarco, Brian1 aEnglund, Dirk1 aFarhi, Edward1 aFefferman, Bill1 aGorshkov, Alexey, V.1 aHouck, Andrew1 aKim, Jungsang1 aKimmel, Shelby1 aLange, Michael1 aLloyd, Seth1 aLukin, Mikhail, D.1 aMaslov, Dmitri1 aMaunz, Peter1 aMonroe, Christopher1 aPreskill, John1 aRoetteler, Martin1 aSavage, Martin1 aThompson, Jeff1 aVazirani, Umesh uhttps://arxiv.org/abs/1912.0757702892nas a2200397 4500008004100000245005600041210005500097260001500152520177700167100001701944700002301961700002101984700002202005700001902027700001602046700001902062700002502081700002302106700002002129700002002149700002602169700002302195700002402218700002202242700002302264700001602287700001302303700002002316700002402336700001702360700001902377700001802396700002302414700002002437856003702457 2019 eng d00aQuantum Simulators: Architectures and Opportunities0 aQuantum Simulators Architectures and Opportunities c12/14/20193 aQuantum simulators are a promising technology on the spectrum of quantum devices from specialized quantum experiments to universal quantum computers. These quantum devices utilize entanglement and many-particle behaviors to explore and solve hard scientific, engineering, and computational problems. Rapid development over the last two decades has produced more than 300 quantum simulators in operation worldwide using a wide variety of experimental platforms. Recent advances in several physical architectures promise a golden age of quantum simulators ranging from highly optimized special purpose simulators to flexible programmable devices. These developments have enabled a convergence of ideas drawn from fundamental physics, computer science, and device engineering. They have strong potential to address problems of societal importance, ranging from understanding vital chemical processes, to enabling the design of new materials with enhanced performance, to solving complex computational problems. It is the position of the community, as represented by participants of the NSF workshop on "Programmable Quantum Simulators," that investment in a national quantum simulator program is a high priority in order to accelerate the progress in this field and to result in the first practical applications of quantum machines. Such a program should address two areas of emphasis: (1) support for creating quantum simulator prototypes usable by the broader scientific community, complementary to the present universal quantum computer effort in industry; and (2) support for fundamental research carried out by a blend of multi-investigator, multi-disciplinary collaborations with resources for quantum simulator software, hardware, and education.
1 aAltman, Ehud1 aBrown, Kenneth, R.1 aCarleo, Giuseppe1 aCarr, Lincoln, D.1 aDemler, Eugene1 aChin, Cheng1 aDeMarco, Brian1 aEconomou, Sophia, E.1 aEriksson, Mark, A.1 aFu, Kai-Mei, C.1 aGreiner, Markus1 aHazzard, Kaden, R. A.1 aHulet, Randall, G.1 aKollár, Alicia, J.1 aLev, Benjamin, L.1 aLukin, Mikhail, D.1 aMa, Ruichao1 aMi, Xiao1 aMisra, Shashank1 aMonroe, Christopher1 aMurch, Kater1 aNazario, Zaira1 aNi, Kang-Kuen1 aPotter, Andrew, C.1 aRoushan, Pedram uhttps://arxiv.org/abs/1912.0693801810nas a2200169 4500008004100000245005600041210005600097260001500153490000700168520133300175100002701508700001801535700001701553700001801570700001501588856003701603 2019 eng d00aQuantum Wasserstein Generative Adversarial Networks0 aQuantum Wasserstein Generative Adversarial Networks c2019/10/310 v323 aThe study of quantum generative models is well-motivated, not only because of its importance in quantum machine learning and quantum chemistry but also because of the perspective of its implementation on near-term quantum machines. Inspired by previous studies on the adversarial training of classical and quantum generative models, we propose the first design of quantum Wasserstein Generative Adversarial Networks (WGANs), which has been shown to improve the robustness and the scalability of the adversarial training of quantum generative models even on noisy quantum hardware. Specifically, we propose a definition of the Wasserstein semimetric between quantum data, which inherits a few key theoretical merits of its classical counterpart. We also demonstrate how to turn the quantum Wasserstein semimetric into a concrete design of quantum WGANs that can be efficiently implemented on quantum machines. Our numerical study, via classical simulation of quantum systems, shows the more robust and scalable numerical performance of our quantum WGANs over other quantum GAN proposals. As a surprising application, our quantum WGAN has been used to generate a 3-qubit quantum circuit of ~50 gates that well approximates a 3-qubit 1-d Hamiltonian simulation circuit that requires over 10k gates using standard techniques.
1 aChakrabarti, Shouvanik1 aHuang, Yiming1 aLi, Tongyang1 aFeizi, Soheil1 aWu, Xiaodi uhttps://arxiv.org/abs/1911.0011102281nas a2200133 4500008004100000245012600041210006900167520180200236100001802038700001702056700001902073700001802092856003702110 2019 eng d00aQuantum-inspired classical sublinear-time algorithm for solving low-rank semidefinite programming via sampling approaches0 aQuantuminspired classical sublineartime algorithm for solving lo3 aSemidefinite programming (SDP) is a central topic in mathematical optimization with extensive studies on its efficient solvers. Recently, quantum algorithms with superpolynomial speedups for solving SDPs have been proposed assuming access to its constraint matrices in quantum superposition. Mutually inspired by both classical and quantum SDP solvers, in this paper we present a sublinear classical algorithm for solving low-rank SDPs which is asymptotically as good as existing quantum algorithms. Specifically, given an SDP with m constraint matrices, each of dimension n and rank poly(logn), our algorithm gives a succinct description and any entry of the solution matrix in time O(m⋅poly(logn,1/ε)) given access to a sample-based low-overhead data structure of the constraint matrices, where ε is the precision of the solution. In addition, we apply our algorithm to a quantum state learning task as an application. Technically, our approach aligns with both the SDP solvers based on the matrix multiplicative weight (MMW) framework and the recent studies of quantum-inspired machine learning algorithms. The cost of solving SDPs by MMW mainly comes from the exponentiation of Hermitian matrices, and we propose two new technical ingredients (compared to previous sample-based algorithms) for this task that may be of independent interest: ∙ Weighted sampling: assuming sampling access to each individual constraint matrix A1,…,Aτ, we propose a procedure that gives a good approximation of A=A1+⋯+Aτ. ∙ Symmetric approximation: we propose a sampling procedure that gives low-rank spectral decomposition of a Hermitian matrix A. This improves upon previous sampling procedures that only give low-rank singular value decompositions, losing the signs of eigenvalues.
1 aChia, Nai-Hui1 aLi, Tongyang1 aLin, Han-Hsuan1 aWang, Chunhao uhttps://arxiv.org/abs/1901.0325401611nas a2200205 4500008004100000245008100041210006900122260001500191490000800206520098000214100001701194700001601211700002401227700002201251700002501273700002401298700002101322700002501343856003701368 2019 eng d00aScale-Invariant Continuous Entanglement Renormalization of a Chern Insulator0 aScaleInvariant Continuous Entanglement Renormalization of a Cher c03/27/20190 v1223 aThe multi-scale entanglement renormalization ansatz (MERA) postulates the existence of quantum circuits that renormalize entanglement in real space at different length scales. Chern insulators, however, cannot have scale-invariant discrete MERA circuits with finite bond dimension. In this Letter, we show that the continuous MERA (cMERA), a modified version of MERA adapted for field theories, possesses a fixed point wavefunction with nonzero Chern number. Additionally, it is well known that reversed MERA circuits can be used to prepare quantum states efficiently in time that scales logarithmically with the size of the system. However, state preparation via MERA typically requires the advent of a full-fledged universal quantum computer. In this Letter, we demonstrate that our cMERA circuit can potentially be realized in existing analog quantum computers, i.e., an ultracold atomic Fermi gas in an optical lattice with light-induced spin-orbit coupling.
1 aChu, Su-Kuan1 aZhu, Guanyu1 aGarrison, James, R.1 aEldredge, Zachary1 aCuriel, Ana, Valdés1 aBienias, Przemyslaw1 aSpielman, I., B.1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/1807.1148601664nas a2200157 4500008004100000245006600041210006200107260001500169520119400184100001801378700001901396700001701415700001901432700001801451856003701469 2019 eng d00aThe Speed of Quantum Information Spreading in Chaotic Systems0 aSpeed of Quantum Information Spreading in Chaotic Systems c08/19/20193 aWe present a general theory of quantum information propagation in chaotic quantum many-body systems. The generic expectation in such systems is that quantum information does not propagate in localized form; instead, it tends to spread out and scramble into a form that is inaccessible to local measurements. To characterize this spreading, we define an information speed via a quench-type experiment and derive a general formula for it as a function of the entanglement density of the initial state. As the entanglement density varies from zero to one, the information speed varies from the entanglement speed to the butterfly speed. We verify that the formula holds both for a quantum chaotic spin chain and in field theories with an AdS/CFT gravity dual. For the second case, we study in detail the dynamics of entanglement in two-sided Vaidya-AdS-Reissner-Nordstrom black branes. We also show that, with an appropriate decoding process, quantum information can be construed as moving at the information speed, and, in the case of AdS/CFT, we show that a locally detectable signal propagates at the information speed in a spatially local variant of the traversable wormhole setup.
1 aCouch, Josiah1 aEccles, Stefan1 aNguyen, Phuc1 aSwingle, Brian1 aXu, Shenglong uhttps://arxiv.org/abs/1908.0699301408nas a2200133 4500008004100000245008000041210006900121260001500190520097500205100001901180700001901199700001901218856003701237 2019 eng d00aStatistical Privacy in Distributed Average Consensus on Bounded Real Inputs0 aStatistical Privacy in Distributed Average Consensus on Bounded c03/20/20193 aThis paper proposes a privacy protocol for distributed average consensus algorithms on bounded real-valued inputs that guarantees statistical privacy of honest agents' inputs against colluding (passive adversarial) agents, if the set of colluding agents is not a vertex cut in the underlying communication network. This implies that privacy of agents' inputs is preserved against t number of arbitrary colluding agents if the connectivity of the communication network is at least (t+1). A similar privacy protocol has been proposed for the case of bounded integral inputs in our previous paper~\cite{gupta2018information}. However, many applications of distributed consensus concerning distributed control or state estimation deal with real-valued inputs. Thus, in this paper we propose an extension of the privacy protocol in~\cite{gupta2018information}, for bounded real-valued agents' inputs, where bounds are known apriori to all the agents.
1 aGupta, Nirupam1 aKatz, Jonathan1 aChopra, Nikhil uhttps://arxiv.org/abs/1903.0931502754nas a2200229 4500008004100000245009900041210006900140520205300209100001902262700002402281700001302305700001502318700001302333700001702346700001402363700001602377700001602393700001702409700001902426700001602445856006302461 2019 eng d00aStatus Report on the First Round of the NIST Post-Quantum Cryptography Standardization Process0 aStatus Report on the First Round of the NIST PostQuantum Cryptog3 aThe National Institute of Standards and Technology is in the process of selecting one or more
public-key cryptographic algorithms through a public competition-like process. The new publickey cryptography standards will specify one or more additional digital signature, public-key
encryption, and key-establishment algorithms to augment FIPS 186-4, Digital Signature Standard
(DSS), as well as special publications SP 800-56A Revision 2, Recommendation for Pair-Wise
Key Establishment Schemes Using Discrete Logarithm Cryptography, and SP 800-56B,
Recommendation for Pair-Wise Key-Establishment Schemes Using Integer Factorization. It is
intended that these algorithms will be capable of protecting sensitive information well into the
foreseeable future, including after the advent of quantum computers.
In November 2017, 82 candidate algorithms were submitted to NIST for consideration. Among
these, 69 met both the minimum acceptance criteria and our submission requirements, and were
accepted as First-Round Candidates on Dec. 20, 2017, marking the beginning of the First Round
of the NIST Post-Quantum Cryptography Standardization Process. This report describes the
evaluation criteria and selection process, based on public feedback and internal review of the
first-round candidates, and summarizes the 26 candidate algorithms announced on January 30,
2019 for moving forward to the second round of the competition. The 17 Second-Round
Candidate public-key encryption and key-establishment algorithms are BIKE, Classic McEliece,
CRYSTALS-KYBER, FrodoKEM, HQC, LAC, LEDAcrypt (merger of LEDAkem/LEDApkc),
NewHope, NTRU (merger of NTRUEncrypt/NTRU-HRSS-KEM), NTRU Prime, NTS-KEM,
ROLLO (merger of LAKE/LOCKER/Ouroboros-R), Round5 (merger of Hila5/Round2), RQC,
SABER, SIKE, and Three Bears. The 9 Second-Round Candidates for digital signatures are
CRYSTALS-DILITHIUM, FALCON, GeMSS, LUOV, MQDSS, Picnic, qTESLA, Rainbow,
and SPHINCS+.
We investigate quantum algorithms for classification, a fundamental problem in machine learning, with provable guarantees. Given n d-dimensional data points, the state-of-the-art (and optimal) classical algorithm for training classifiers with constant margin runs in O~(n+d) time. We design sublinear quantum algorithms for the same task running in O~(n−−√+d−−√) time, a quadratic improvement in both n and d. Moreover, our algorithms use the standard quantization of the classical input and generate the same classical output, suggesting minimal overheads when used as subroutines for end-to-end applications. We also demonstrate a tight lower bound (up to poly-log factors) and discuss the possibility of implementation on near-term quantum machines. As a side result, we also give sublinear quantum algorithms for approximating the equilibria of n-dimensional matrix zero-sum games with optimal complexity Θ~(n−−√).
1 aLi, Tongyang1 aChakrabarti, Shouvanik1 aWu, Xiaodi uhttps://arxiv.org/abs/1904.0227601465nas a2200145 4500008004100000245006900041210006900110260001300179520101400192100001401206700001701220700002501237700002001262856003701282 2019 eng d00aTowards Bulk Metric Reconstruction from Extremal Area Variations0 aTowards Bulk Metric Reconstruction from Extremal Area Variations c04/09/193 aThe Ryu-Takayanagi and Hubeny-Rangamani-Takayanagi formulae suggest that bulk geometry emerges from the entanglement structure of the boundary theory. Using these formulae, we build on a result of Alexakis, Balehowsky, and Nachman to show that in four bulk dimensions, the entanglement entropies of boundary regions of disk topology uniquely fix the bulk metric in any region foliated by the corresponding HRT surfaces. More generally, for a bulk of any dimension , knowledge of the (variations of the) areas of two-dimensional boundary-anchored extremal surfaces of disk topology uniquely fixes the bulk metric wherever these surfaces reach. This result is covariant and not reliant on any symmetry assumptions; its applicability thus includes regions of strong dynamical gravity such as the early-time interior of black holes formed from collapse. While we only show uniqueness of the metric, the approach we present provides a clear path towards an\textit {explicit} spacetime metric reconstruction.
1 aBao, Ning1 aCao, ChunJun1 aFischetti, Sebastian1 aKeeler, Cynthia uhttps://arxiv.org/abs/1904.0483401295nas a2200169 4500008004100000245008000041210006900121260001500190490000600205520078500211100001800996700001901014700001301033700002301046700001901069856003701088 2018 eng d00aAutomated optimization of large quantum circuits with continuous parameters0 aAutomated optimization of large quantum circuits with continuous c2017/10/190 v43 aWe develop and implement automated methods for optimizing quantum circuits of the size and type expected in quantum computations that outperform classical computers. We show how to handle continuous gate parameters and report a collection of fast algorithms capable of optimizing large-scale quantum circuits. For the suite of benchmarks considered, we obtain substantial reductions in gate counts. In particular, we provide better optimization in significantly less time than previous approaches, while making minimal structural changes so as to preserve the basic layout of the underlying quantum algorithms. Our results help bridge the gap between the computations that can be run on existing hardware and those that are expected to outperform classical computers.
1 aNam, Yunseong1 aRoss, Neil, J.1 aSu, Yuan1 aChilds, Andrew, M.1 aMaslov, Dmitri uhttps://arxiv.org/abs/1710.0734501804nas a2200157 4500008004100000245003600041210003600077520137400113100001701487700001801504700001901522700002401541700002501565700001901590856003701609 2018 eng d00aBlack Hole Microstate Cosmology0 aBlack Hole Microstate Cosmology3 aIn this note, we explore the possibility that certain high-energy holographic CFT states correspond to black hole microstates with a geometrical behind-the-horizon region, modelled by a portion of a second asymptotic region terminating at an end-of-the-world (ETW) brane. We study the time-dependent physics of this behind-the-horizon region, whose ETW boundary geometry takes the form of a closed FRW spacetime. We show that in many cases, this behind-the-horizon physics can be probed directly by looking at the time dependence of entanglement entropy for sufficiently large spatial CFT subsystems. We study in particular states defined via Euclidean evolution from conformal boundary states and give specific predictions for the behavior of the entanglement entropy in this case. We perform analogous calculations for the SYK model and find qualitative agreement with our expectations. A fascinating possibility is that for certain states, we might have gravity localized to the ETW brane as in the Randall-Sundrum II scenario for cosmology. In this case, the effective description of physics beyond the horizon could be a big bang/big crunch cosmology of the same dimensionality as the CFT. In this case, the d-dimensional CFT describing the black hole microstate would give a precise, microscopic description of the d-dimensional cosmological physics.
1 aCooper, Sean1 aRozali, Moshe1 aSwingle, Brian1 aVan Raamsdonk, Mark1 aWaddell, Christopher1 aWakeham, David uhttps://arxiv.org/abs/1810.1060101718nas a2200169 4500008004100000245008800041210006900129260001500198520118200213100001501395700002001410700001701430700002201447700001901469700002301488856003701511 2018 eng d00aCircuit QED-based measurement of vortex lattice order in a Josephson junction array0 aCircuit QEDbased measurement of vortex lattice order in a Joseph c2018/03/123 aSuperconductivity provides a canonical example of a quantum phase of matter. When superconducting islands are connected by Josephson junctions in a lattice, the low temperature state of the system can map to the celebrated XY model and its associated universality classes. This has been used to experimentally implement realizations of Mott insulator and Berezinskii--Kosterlitz--Thouless (BKT) transitions to vortex dynamics analogous to those in type-II superconductors. When an external magnetic field is added, the effective spins of the XY model become frustrated, leading to the formation of topological defects (vortices). Here we observe the many-body dynamics of such an array, including frustration, via its coupling to a superconducting microwave cavity. We take the design of the transmon qubit, but replace the single junction between two antenna pads with the complete array. This allows us to probe the system at 10 mK with minimal self-heating by using weak coherent states at the single (microwave) photon level to probe the resonance frequency of the cavity. We observe signatures of ordered vortex lattice at rational flux fillings of the array.
1 aCosmic, R.1 aIkegami, Hiroki1 aLin, Zhirong1 aInomata, Kunihiro1 aTaylor, J., M.1 aNakamura, Yasunobu uhttps://arxiv.org/abs/1803.0411302638nas a2200265 4500008004100000245009500041210006900136260001500205300001200220490000800232520186000240100002102100700001902121700001802140700001802158700001502176700002002191700001902211700001602230700002502246700001802271700002402289700002202313856003702335 2018 eng d00aExperimentally Generated Randomness Certified by the Impossibility of Superluminal Signals0 aExperimentally Generated Randomness Certified by the Impossibili c2018/04/11 a223-2260 v5563 aFrom dice to modern complex circuits, there have been many attempts to build increasingly better devices to generate random numbers. Today, randomness is fundamental to security and cryptographic systems, as well as safeguarding privacy. A key challenge with random number generators is that it is hard to ensure that their outputs are unpredictable. For a random number generator based on a physical process, such as a noisy classical system or an elementary quantum measurement, a detailed model describing the underlying physics is required to assert unpredictability. Such a model must make a number of assumptions that may not be valid, thereby compromising the integrity of the device. However, it is possible to exploit the phenomenon of quantum nonlocality with a loophole-free Bell test to build a random number generator that can produce output that is unpredictable to any adversary limited only by general physical principles. With recent technological developments, it is now possible to carry out such a loophole-free Bell test. Here we present certified randomness obtained from a photonic Bell experiment and extract 1024 random bits uniform to within 10−12. These random bits could not have been predicted within any physical theory that prohibits superluminal signaling and allows one to make independent measurement choices. To certify and quantify the randomness, we describe a new protocol that is optimized for apparatuses characterized by a low per-trial violation of Bell inequalities. We thus enlisted an experimental result that fundamentally challenges the notion of determinism to build a system that can increase trust in random sources. In the future, random number generators based on loophole-free Bell tests may play a role in increasing the security and trust of our cryptographic systems and infrastructure.
1 aBierhorst, Peter1 aKnill, Emanuel1 aGlancy, Scott1 aZhang, Yanbao1 aMink, Alan1 aJordan, Stephen1 aRommal, Andrea1 aLiu, Yi-Kai1 aChristensen, Bradley1 aNam, Sae, Woo1 aStevens, Martin, J.1 aShalm, Lynden, K. uhttps://arxiv.org/abs/1803.0621901552nas a2200217 4500008004100000245004800041210004800089260001500137300001100152490000700163520094200170100002001112700002301132700001601155700002101171700001601192700001201208700002401220700002101244856006901265 2018 eng d00aGeometry of the quantum set of correlations0 aGeometry of the quantum set of correlations c2018/02/07 a0221040 v973 aIt is well known that correlations predicted by quantum mechanics cannot be explained by any classical (local-realistic) theory. The relative strength of quantum and classical correlations is usually studied in the context of Bell inequalities, but this tells us little about the geometry of the quantum set of correlations. In other words, we do not have good intuition about what the quantum set actually looks like. In this paper we study the geometry of the quantum set using standard tools from convex geometry. We find explicit examples of rather counter-intuitive features in the simplest non-trivial Bell scenario (two parties, two inputs and two outputs) and illustrate them using 2-dimensional slice plots. We also show that even more complex features appear in Bell scenarios with more inputs or more parties. Finally, we discuss the limitations that the geometry of the quantum set imposes on the task of self-testing.
1 aGoh, Koon, Tong1 aKaniewski, Jedrzej1 aWolfe, Elie1 aVértesi, Tamás1 aWu, Xingyao1 aCai, Yu1 aLiang, Yeong-Cherng1 aScarani, Valerio uhttps://journals.aps.org/pra/abstract/10.1103/PhysRevA.97.02210401264nas a2200157 4500008004100000245006300041210006300104520077600167100002100943700002100964700002000985700002001005700002001025700002401045856003701069 2018 eng d00aHigh Purity Single Photons Entangled with an Atomic Memory0 aHigh Purity Single Photons Entangled with an Atomic Memory3 aTrapped atomic ions are an ideal candidate for quantum network nodes, with long-lived identical qubit memories that can be locally entangled through their Coulomb interaction and remotely entangled through photonic channels. The integrity of this photonic interface is generally reliant on purity of single photons produced by the quantum memory. Here we demonstrate a single-photon source for quantum networking based on a trapped 138Ba+ ion with a single photon purity of g2(0)=(8.1±2.3)×10−5 without background subtraction. We further optimize the tradeoff between the photonic generation rate and the memory-photon entanglement fidelity for the case of polarization photonic qubits by tailoring the spatial mode of the collected light.
1 aCrocker, Clayton1 aLichtman, Martin1 aSosnova, Ksenia1 aCarter, Allison1 aScarano, Sophia1 aMonroe, Christopher uhttps://arxiv.org/abs/1812.0174901169nas a2200133 4500008004100000245009300041210006900134260001500203520072300218100001900941700001900960700001900979856003700998 2018 eng d00aInformation-Theoretic Privacy For Distributed Average Consensus: Bounded Integral Inputs0 aInformationTheoretic Privacy For Distributed Average Consensus B c03/28/20193 aWe propose an asynchronous distributed average consensus algorithm that guarantees information-theoretic privacy of honest agents' inputs against colluding passive adversarial agents, as long as the set of colluding passive adversarial agents is not a vertex cut in the underlying communication network. This implies that a network with (t+1)-connectivity guarantees information-theoretic privacy of honest agents' inputs against any t colluding agents. The proposed protocol is formed by composing a distributed privacy mechanism we provide with any (non-private) distributed average consensus algorithm. The agent' inputs are bounded integers, where the bounds are apriori known to all the agents.
1 aGupta, Nirupam1 aKatz, Jonathan1 aChopra, Nikhil uhttps://arxiv.org/abs/1809.0179406429nas a2200121 4500008004100000245006700041210006600108520603900174100001906213700001906232700001906251856003706270 2018 eng d00aInformation-Theoretic Privacy in Distributed Average Consensus0 aInformationTheoretic Privacy in Distributed Average Consensus3 aWe propose an asynchronous distributed average consensus algorithm that guarantees information-theoretic privacy of honest agents' inputs against colluding semi-honest (passively adversarial) agents, as long as the set of colluding semi-honest agents is not a vertex cut in the underlying communication network. This implies that a network with
If a measurement is made on one half of a bipartite system then, conditioned on the outcome, the other half has a new reduced state. If these reduced states defy classical explanation — that is, if shared randomness cannot produce these reduced states for all possible measurements — the bipartite state is said to be steerable. Determining which states are steerable is a challenging problem even for low dimensions. In the case of two-qubit systems a criterion is known for T-states (that is, those with maximally mixed marginals) under projective measurements. In the current work we introduce the concept of keyring models — a special class of local hidden state model. When the measurements made correspond to real projectors, these allow us to study steerability beyond T-states. Using keyring models, we completely solve the steering problem for real projective measurements when the state arises from mixing a pure two-qubit state with uniform noise. We also give a partial solution in the case when the uniform noise is replaced by independent depolarizing channels. Our results imply that Werner states, which are a special case of the previous states, are unsteerable under real projective measurements if and only if their efficiency is at most 2/π.
1 aMiller, Carl1 aColbeck, Roger1 aShi, Yaoyun uhttp://aip.scitation.org/doi/full/10.1063/1.500619901224nas a2200145 4500008004100000245008400041210006900125520074800194100001700942700001900959700001800978700002900996700001601025856003701041 2018 eng d00aMore is Less: Perfectly Secure Oblivious Algorithms in the Multi-Server Setting0 aMore is Less Perfectly Secure Oblivious Algorithms in the MultiS3 aThe problem of Oblivious RAM (ORAM) has traditionally been studied in a single-server setting, but more recently the multi-server setting has also been considered. Yet it is still unclear whether the multi-server setting has any inherent advantages, e.g., whether the multi-server setting can be used to achieve stronger security goals or provably better efficiency than is possible in the single-server case. In this work, we construct a perfectly secure 3-server ORAM scheme that outperforms the best known single-server scheme by a logarithmic factor. In the process, we also show, for the first time, that there exist specific algorithms for which multiple servers can overcome known lower bounds in the single-server setting.
1 aChan, Hubert1 aKatz, Jonathan1 aNayak, Kartik1 aPolychroniadou, Antigoni1 aShi, Elaine uhttps://arxiv.org/abs/1809.0082501469nas a2200121 4500008004100000245007800041210006900119300000600188520108200194100001601276700001801292856003701310 2018 eng d00aMultiparty quantum data hiding with enhanced security and remote deletion0 aMultiparty quantum data hiding with enhanced security and remote a53 aOne of the applications of quantum technology is to use quantum states and measurements to communicate which offers more reliable security promises. Quantum data hiding, which gives the source party the ability of sharing data among multiple receivers and revealing it at a later time depending on his/her will, is one of the promising information sharing schemes which may address practical security issues. In this work, we propose a novel quantum data hiding protocol. By concatenating different subprotocols which apply to rather symmetric hiding scenarios, we cover a variety of more general hiding scenarios. We provide the general requirements for constructing such protocols and give explicit examples of encoding states for five parties. We also proved the security of the protocol in sense that the achievable information by unauthorized operations asymptotically goes to zero. In addition, due to the capability of the sender to manipulate his/her subsystem, the sender is able to abort the protocol remotely at any time before he/she reveals the information.
1 aWu, Xingyao1 aChen, Jianxin uhttps://arxiv.org/abs/1804.0198201248nas a2200157 4500008004100000245003400041210002700075260000900102490000800111520082700119100001900946700002300965700002300988700002101011856005801032 2018 eng d00aOn the need for soft dressing0 aneed for soft dressing c20180 v1213 aIn order to deal with IR divergences arising in QED or perturbative quantum gravity scattering processes, one can either calculate inclusive quantities or use dressed asymptotic states. We consider incoming superpositions of momentum eigenstates and show that in calculations of cross-sections these two approaches yield different answers: in the inclusive formalism no interference occurs for incoming finite superpositions and wavepackets do not scatter at all, while the dressed formalism yields the expected interference terms. This suggests that rather than Fock space states, one should use Faddeev-Kulish-type dressed states to correctly describe physical processes involving incoming superpositions. We interpret this in terms of selection rules due to large U(1) gauge symmetries and BMS supertranslations.
1 aCarney, Daniel1 aChaurette, Laurent1 aNeuenfeld, Dominik1 aSemenoff, Gordon uhttps://quics.umd.edu/publications/need-soft-dressing01444nas a2200169 4500008004100000245007500041210006900116260001500185490000600200520093200206100001701138700002201155700001901177700001901196700002201215856003701237 2018 eng d00aObservation of bound state self-interaction in a nano-eV atom collider0 aObservation of bound state selfinteraction in a nanoeV atom coll c2018/11/200 v93 aQuantum mechanical scattering resonances for colliding particles occur when a continuum scattering state couples to a discrete bound state between them. The coupling also causes the bound state to interact with itself via the continuum and leads to a shift in the bound state energy, but, lacking knowledge of the bare bound state energy, measuring this self-energy via the resonance position has remained elusive. Here, we report on the direct observation of self-interaction by using a nano-eV atom collider to track the position of a magnetically-tunable Feshbach resonance through a parameter space spanned by energy and magnetic field. Our system of potassium and rubidium atoms displays a strongly non-monotonic resonance trajectory with an exceptionally large self-interaction energy arising from an interplay between the Feshbach bound state and a different, virtual bound state at a fixed energy near threshold.
1 aThomas, Ryan1 aChilcott, Matthew1 aTiesinga, Eite1 aDeb, Amita, B.1 aKjærgaard, Niels uhttps://arxiv.org/abs/1807.0117402023nas a2200241 4500008004100000245007500041210006900116260001500185300001200200490000800212520128400220100001701504700002901521700002201550700002601572700002101598700002501619700002301644700001601667700002301683700002001706856005501726 2018 eng d00aObservation of three-photon bound states in a quantum nonlinear medium0 aObservation of threephoton bound states in a quantum nonlinear m c2018/02/16 a783-7860 v3593 aBound states of massive particles, such as nuclei, atoms or molecules, are ubiquitous in nature and constitute the bulk of the visible world around us. In contrast, photons typically only weakly influence each other due to their very weak interactions and vanishing mass. We report the observation of traveling three-photon bound states in a quantum nonlinear medium where the interactions between photons are mediated by atomic Rydberg states. In particular, photon correlation and conditional phase measurements reveal the distinct features associated with three-photon and two-photon bound states. Such photonic trimers and dimers can be viewed as quantum solitons with shape-preserving wavefunctions that depend on the constituent photon number. The observed bunching and strongly nonlinear optical phase are quantitatively described by an effective field theory (EFT) of Rydberg-induced photon-photon interactions, which demonstrates the presence of a substantial effective three-body force between the photons. These observations pave the way towards the realization, studies, and control of strongly interacting quantum many-body states of light.
1 aLiang, Qi-Yu1 aVenkatramani, Aditya, V.1 aCantu, Sergio, H.1 aNicholson, Travis, L.1 aGullans, Michael1 aGorshkov, Alexey, V.1 aThompson, Jeff, D.1 aChin, Cheng1 aLukin, Mikhail, D.1 aVuletic, Vladan uhttp://science.sciencemag.org/content/359/6377/78301686nas a2200181 4500008004100000245006900041210006900110260001500179490000700194520113900201100002001340700002401360700002201384700001801406700002501424700001801449856003701467 2018 eng d00aOptimization of photon storage fidelity in ordered atomic arrays0 aOptimization of photon storage fidelity in ordered atomic arrays c2018/08/310 v203 aA major application for atomic ensembles consists of a quantum memory for light, in which an optical state can be reversibly converted to a collective atomic excitation on demand. There exists a well-known fundamental bound on the storage error, when the ensemble is describable by a continuous medium governed by the Maxwell-Bloch equations. The validity of this model can break down, however, in systems such as dense, ordered atomic arrays, where strong interference in emission can give rise to phenomena such as subradiance and "selective" radiance. Here, we develop a general formalism that finds the maximum storage efficiency for a collection of atoms with discrete, known positions, and a given spatial mode in which an optical field is sent. As an example, we apply this technique to study a finite two-dimensional square array of atoms. We show that such a system enables a storage error that scales with atom number Na like ∼(logNa)2/N2a, and that, remarkably, an array of just 4×4 atoms in principle allows for an efficiency comparable to a disordered ensemble with optical depth of around 600.
1 aManzoni, M., T.1 aMoreno-Cardoner, M.1 aAsenjo-Garcia, A.1 aPorto, J., V.1 aGorshkov, Alexey, V.1 aChang, D., E. uhttps://arxiv.org/abs/1710.0631202076nas a2200229 4500008004100000245007800041210006900119520136400188100002401552700001901576700002401595700001701619700002301636700002101659700001801680700002101698700001901719700002701738700001901765700002501784856003701809 2018 eng d00aPhoton propagation through dissipative Rydberg media at large input rates0 aPhoton propagation through dissipative Rydberg media at large in3 aWe study the dissipative propagation of quantized light in interacting Rydberg media under the conditions of electromagnetically induced transparency (EIT). Rydberg blockade physics in optically dense atomic media leads to strong dissipative interactions between single photons. The regime of high incoming photon flux constitutes a challenging many-body dissipative problem. We experimentally study in detail for the first time the pulse shapes and the second-order correlation function of the outgoing field and compare our data with simulations based on two novel theoretical approaches well-suited to treat this many-photon limit. At low incoming flux, we report good agreement between both theories and the experiment. For higher input flux, the intensity of the outgoing light is lower than that obtained from theoretical predictions. We explain this discrepancy using a simple phenomenological model taking into account pollutants, which are nearly-stationary Rydberg excitations coming from the reabsorption of scattered probe photons. At high incoming photon rates, the blockade physics results in unconventional shapes of measured correlation functions.
1 aBienias, Przemyslaw1 aDouglas, James1 aParis-Mandoki, Asaf1 aTitum, Paraj1 aMirgorodskiy, Ivan1 aTresp, Christoph1 aZeuthen, Emil1 aGullans, Michael1 aManzoni, Marco1 aHofferberth, Sebastian1 aChang, Darrick1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/1807.0758601497nas a2200145 4500008004100000245006400041210006400105260001500169490000800184520103000192100001801222700002301240700001901263856006901282 2018 eng d00aQuantum algorithm for multivariate polynomial interpolation0 aQuantum algorithm for multivariate polynomial interpolation c2018/01/170 v4743 aHow many quantum queries are required to determine the coefficients of a degree-d polynomial in n variables? We present and analyze quantum algorithms for this multivariate polynomial interpolation problem over the fields Fq, R, and C. We show that kC and 2kC queries suffice to achieve probability 1 for C and R, respectively, where kC = ⌈ 1 n+1 ( n+d d )⌉ except for d = 2 and four other special cases. For Fq, we show that ⌈ d n+d ( n+d d )⌉ queries suffice to achieve probability approaching 1 for large field order q. The classical query complexity of this problem is ( n+d d ), so our result provides a speedup by a factor of n + 1, n+1 2 , and n+d d for C, R, and Fq, respectively. Thus we find a much larger gap between classical and quantum algorithms than the univariate case, where the speedup is by a factor of 2. For the case of Fq, we conjecture that 2kC queries also suffice to achieve probability approaching 1 for large field order q, although we leave this as an open problem.
1 aChen, Jianxin1 aChilds, Andrew, M.1 aHung, Shih-Han uhttp://rspa.royalsocietypublishing.org/content/474/2209/2017048001238nas a2200157 4500008004100000245005100041210005000092520077600142100001600918700002100934700002200955700001800977700002300995700002501018856003701043 2018 eng d00aSingle-photon bound states in atomic ensembles0 aSinglephoton bound states in atomic ensembles3 aWe illustrate the existence of single-excitation bound states for propagating photons interacting with N two-level atoms. These bound states can be calculated from an effective spin model, and their existence relies on dissipation in the system. The appearance of these bound states is in a one-to-one correspondence with zeros in the single-photon transmission and with divergent bunching in the second-order photon-photon correlation function. We also formulate a dissipative version of Levinson's theorem for this system by looking at the relation between the number of bound states and the winding number of the transmission phases. This theorem allows a direct experimental measurement of the number of bound states using the measured transmission phases.
1 aWang, Yidan1 aGullans, Michael1 aBrowaeys, Antoine1 aPorto, J., V.1 aChang, Darrick, E.1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/1809.0114701204nas a2200181 4500008004100000245007100041210006900112260001500181490000800196520064500204100002700849700001900876700001900895700002700914700002000941700002500961856003600986 2018 eng d00aSpectrum estimation of density operators with alkaline-earth atoms0 aSpectrum estimation of density operators with alkalineearth atom c2018/01/090 v1203 aWe show that Ramsey spectroscopy of fermionic alkaline-earth atoms in a square-well trap provides an efficient and accurate estimate for the eigenspectrum of a density matrix whose n copies are stored in the nuclear spins of n such atoms. This spectrum estimation is enabled by the high symmetry of the interaction Hamiltonian, dictated, in turn, by the decoupling of the nuclear spin from the electrons and by the shape of the square-well trap. Practical performance of this procedure and its potential applications to quantum computing, quantum simulation, and time-keeping with alkalineearth atoms are discussed.
1 aBeverland, Michael, E.1 aHaah, Jeongwan1 aAlagic, Gorjan1 aCampbell, Gretchen, K.1 aRey, Ana, Maria1 aGorshkov, Alexey, V. uhttp://arxiv.org/abs/1608.0204501396nas a2200157 4500008004100000245006600041210006600107260001500173300001100188490000600199520092600205100002601131700001901157700002501176856003701201 2018 eng d00aStructure of Correlated Worldline Theories of Quantum Gravity0 aStructure of Correlated Worldline Theories of Quantum Gravity c2018/06/21 a0840520 vD3 aWe consider the general form of "Correlated Worldline" (CWL) theories of quantum gravity. We show that one can have 2 different kinds of CWL theory, in which the generating functional is written as either a sum or a product over multiple copies of the coupled matter and gravitational fields. In both versions, the paths in a functional formulation are correlated via gravity itself, causing a breakdown of the superposition principle; however, the product form survives consistency tests not satisfied by the summed form. To better understand the structure of these two theories, we show how to perform diagrammatic expansions in the gravitational coupling for each version of CWL theory, using particle propagation and scalar fields as examples. We explicitly calculate contributions to 2-point and 4-point functions, again for each version of the theory, up to 2nd-order in the gravitational coupling.
1 aBarvinsky, Andrei, O.1 aCarney, Daniel1 aStamp, Philip, C. E. uhttps://arxiv.org/abs/1806.0804301154nas a2200121 4500008004100000245006200041210006000103520076900163100001900932700002500951700001900976856003700995 2018 eng d00aTabletop experiments for quantum gravity: a user's manual0 aTabletop experiments for quantum gravity a users manual3 aRecent advances in cooling, control, and measurement of mechanical systems in the quantum regime have opened the possibility of the first direct observation of quantum gravity, at scales achievable in experiments. This paper gives a broad overview of this idea, using some matter-wave and optomechanical systems to illustrate the predictions of a variety of models of low-energy quantum gravity. We first review the treatment of perturbatively quantized general relativity as an effective quantum field theory, and consider the particular challenges of observing quantum effects in this framework. We then move on to a variety of alternative models, such as those in which gravity is classical, emergent, or responsible for a breakdown of quantum mechanics.
1 aCarney, Daniel1 aStamp, Philip, C. E.1 aTaylor, J., M. uhttps://arxiv.org/abs/1807.1149401154nas a2200121 4500008004100000245006200041210006000103520076900163100001900932700002500951700001900976856003700995 2018 eng d00aTabletop experiments for quantum gravity: a user's manual0 aTabletop experiments for quantum gravity a users manual3 aRecent advances in cooling, control, and measurement of mechanical systems in the quantum regime have opened the possibility of the first direct observation of quantum gravity, at scales achievable in experiments. This paper gives a broad overview of this idea, using some matter-wave and optomechanical systems to illustrate the predictions of a variety of models of low-energy quantum gravity. We first review the treatment of perturbatively quantized general relativity as an effective quantum field theory, and consider the particular challenges of observing quantum effects in this framework. We then move on to a variety of alternative models, such as those in which gravity is classical, emergent, or responsible for a breakdown of quantum mechanics.
1 aCarney, Daniel1 aStamp, Philip, C. E.1 aTaylor, J., M. uhttps://arxiv.org/abs/1807.1149401648nas a2200169 4500008004100000245006100041210006100102300001400163490000900177520116300186100002301349700001901372700001801391700001901409700001301428856003701441 2018 eng d00aToward the first quantum simulation with quantum speedup0 aToward the first quantum simulation with quantum speedup a9456-94610 v115 3 aWith quantum computers of significant size now on the horizon, we should understand how to best exploit their initially limited abilities. To this end, we aim to identify a practical problem that is beyond the reach of current classical computers, but that requires the fewest resources for a quantum computer. We consider quantum simulation of spin systems, which could be applied to understand condensed matter phenomena. We synthesize explicit circuits for three leading quantum simulation algorithms, using diverse techniques to tighten error bounds and optimize circuit implementations. Quantum signal processing appears to be preferred among algorithms with rigorous performance guarantees, whereas higher-order product formulas prevail if empirical error estimates suffice. Our circuits are orders of magnitude smaller than those for the simplest classically infeasible instances of factoring and quantum chemistry, bringing practical quantum computation closer to reality.
1 aChilds, Andrew, M.1 aMaslov, Dmitri1 aNam, Yunseong1 aRoss, Neil, J.1 aSu, Yuan uhttps://arxiv.org/abs/1711.1098001463nas a2200121 4500008004100000245007300041210006900114520107000183100001701253700001601270700001801286856003701304 2018 eng d00aTwo-Dimensional Dilaton Gravity Theory and Lattice Schwarzian Theory0 aTwoDimensional Dilaton Gravity Theory and Lattice Schwarzian The3 aThe construction of large-scale quantum computers will require modular architectures that allow physical resources to be localized in easy-to-manage packages. In this work, we examine the impact of different graph structures on the preparation of entangled states. We begin by explaining a formal framework, the hierarchical product, in which modular graphs can be easily constructed. This framework naturally leads us to suggest a class of graphs, which we dub hierarchies. We argue that such graphs have favorable properties for quantum information processing, such as a small diameter and small total edge weight, and use the concept of Pareto efficiency to identify promising quantum graph architectures. We present numerical and analytical results on the speed at which large entangled states can be created on nearest-neighbor grids and hierarchy graphs. We also present a scheme for performing circuit placement--the translation from circuit diagrams to machine qubits--on quantum systems whose connectivity is described by hierarchies.
1 aBapat, Aniruddha1 aEldredge, Zachary1 aGarrison, James, R.1 aDesphande, Abhinav1 aChong, Frederic, T.1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/1808.0787601895nas a2200157 4500008004100000245004900041210004800090260001500138520145500153100001801608700001901626700001801645700002201663700001501685856003701700 2017 eng d00aComputational Notions of Quantum Min-Entropy0 aComputational Notions of Quantum MinEntropy c2017/09/093 aWe initiate the study of computational entropy in the quantum setting. We investigate to what extent the classical notions of computational entropy generalize to the quantum setting, and whether quantum analogues of classical theorems hold. Our main results are as follows. (1) The classical Leakage Chain Rule for pseudoentropy can be extended to the case that the leakage information is quantum (while the source remains classical). Specifically, if the source has pseudoentropy at least k, then it has pseudoentropy at least k − ℓ conditioned on an ℓ- qubit leakage. (2) As an application of the Leakage Chain Rule, we construct the first quantum leakage-resilient stream-cipher in the bounded-quantum-storage model, assuming the existence of a quantum-secure pseudorandom generator. (3) We show that the general form of the classical Dense Model Theorem (interpreted as the equivalence between two definitions of pseudo-relativemin-entropy) does not extend to quantum states. Along the way, we develop quantum analogues of some classical techniques (e.g., the Leakage Simulation Lemma, which is proven by a Nonuniform Min-Max Theorem or Boosting). On the other hand, we also identify some classical techniques (e.g., Gap Amplification) that do not work in the quantum setting. Moreover, we introduce a variety of notions that combine quantum information and quantum complexity, and this raises several directions for future work.
1 aChen, Yi-Hsiu1 aChung, Kai-Min1 aLai, Ching-Yi1 aVadhan, Salil, P.1 aWu, Xiaodi uhttps://arxiv.org/abs/1704.0730901082nas a2200181 4500008004100000022001400041245007000055210006900125260001500194300001400209490000700223520042300230100001800653700002100671700002100692700001600713856017100729 2017 eng d a1944-417600aDomination with decay in triangular matchstick arrangement graphs0 aDomination with decay in triangular matchstick arrangement graph c2017/05/14 a749 - 7660 v103 aWe provide results for the exponential dominating numbers and total exponential dominating numbers of a family of triangular grid graphs. We then prove inequalities for these numbers and compare them with inequalities that hold more generally for exponential dominating numbers of graphs.
1 aCochran, Jill1 aHenderson, Terry1 aOstrander, Aaron1 aTaylor, Ron uhttp://msp.org/involve/http://msp.org/involve/2017/10-5/index.xhtmlhttp://msp.org/involve/2017/10-5/p03.xhtmlhttp://msp.org/involve/2017/10-5/involve-v10-n5-p03-s.pdf01386nas a2200145 4500008004100000245006200041210006200103260001500165300001200180490000700192520096400199100002301163700001701186856003701203 2017 eng d00aEfficient simulation of sparse Markovian quantum dynamics0 aEfficient simulation of sparse Markovian quantum dynamics c2017/09/01 a901-9470 v173 aQuantum algorithms for simulating Hamiltonian dynamics have been extensively developed, but there has been much less work on quantum algorithms for simulating the dynamics of open quantum systems. We give the first efficient quantum algorithms for simulating Markovian quantum dynamics generated by Lindbladians that are not necessarily local. We introduce two approaches to simulating sparse Lindbladians. First, we show how to simulate Lindbladians that act within small invariant subspaces using a quantum algorithm to implement sparse Stinespring isometries. Second, we develop a method for simulating sparse Lindblad operators by concatenating a sequence of short-time evolutions. We also show limitations on Lindbladian simulation by proving a no-fast-forwarding theorem for simulating sparse Lindbladians in a black-box model.
1 aChilds, Andrew, M.1 aLi, Tongyang uhttps://arxiv.org/abs/1611.0554302354nas a2200157 4500008004100000245007000041210006900111520185900180100001902039700002002058700002402078700001802102700001902120700002002139856003702159 2017 eng d00aEntanglement Wedge Reconstruction via Universal Recovery Channels0 aEntanglement Wedge Reconstruction via Universal Recovery Channel3 aWe apply and extend the theory of universal recovery channels from quantum information theory to address the problem of entanglement wedge reconstruction in AdS/CFT. It has recently been proposed that any low-energy local bulk operators in a CFT boundary region's entanglement wedge can be reconstructed on that boundary region itself. Existing work arguing for this proposal relies on algebraic consequences of the exact equivalence between bulk and boundary relative entropies, namely the theory of operator algebra quantum error correction. However, bulk and boundary relative entropies are only approximately equal in bulk effective field theory, and in similar situations it is known that predictions from exact entropic equalities can be qualitatively incorrect. The framework of universal recovery channels provides a robust demonstration of the entanglement wedge reconstruction conjecture in addition to new physical insights. Most notably, we find that a bulk operator acting in a given boundary region's entanglement wedge can be expressed as the response of the boundary region's modular Hamiltonian to a perturbation of the bulk state in the direction of the bulk operator. This formula can be interpreted as a noncommutative version of Bayes' rule that attempts to undo the noise induced by restricting to only a portion of the boundary, and has an integral representation in terms of modular flows. To reach these conclusions, we extend the theory of universal recovery channels to finite-dimensional operator algebras and demonstrate that recovery channels approximately preserve the multiplicative structure of the operator algebra
1 aCotler, Jordan1 aHayden, Patrick1 aPenington, Geoffrey1 aSalton, Grant1 aSwingle, Brian1 aWalter, Michael uhttps://arxiv.org/abs/1704.0583901575nas a2200217 4500008004100000245010100041210006900142260001500211520089600226100002101122700001901143700001801162700001501180700002401195700001901219700001601238700002501254700001801279700002201297856003801319 2017 eng d00aExperimentally Generated Random Numbers Certified by the Impossibility of Superluminal Signaling0 aExperimentally Generated Random Numbers Certified by the Impossi c2017/02/163 aRandom numbers are an important resource for applications such as numerical simulation and secure communication. However, it is difficult to certify whether a physical random number generator is truly unpredictable. Here, we exploit the phenomenon of quantum nonlocality in a loophole-free photonic Bell test experiment for the generation of randomness that cannot be predicted within any physical theory that allows one to make independent measurement choices and prohibits superluminal signaling. To certify and quantify the randomness, we describe a new protocol that performs well in an experimental regime characterized by low violation of Bell inequalities. Applying an extractor function to our data, we obtained 256 new random bits, uniform to within 0.001.
1 aBierhorst, Peter1 aKnill, Emanuel1 aGlancy, Scott1 aMink, Alan1 aJordan, Stephen, P.1 aRommal, Andrea1 aLiu, Yi-Kai1 aChristensen, Bradley1 aNam, Sae, Woo1 aShalm, Lynden, K. uhttps://arxiv.org/abs/1702.05178#01398nas a2200169 4500008004100000245006100041210006000102260001500162520088000177100002701057700001601084700001801100700002601118700002701144700002001171856003701191 2017 eng d00aProvable quantum state tomography via non-convex methods0 aProvable quantum state tomography via nonconvex methods c2017/11/193 aWith nowadays steadily growing quantum processors, it is required to develop new quantum tomography tools that are tailored for high-dimensional systems. In this work, we describe such a computational tool, based on recent ideas from non-convex optimization. The algorithm excels in the compressed-sensing-like setting, where only a few data points are measured from a lowrank or highly-pure quantum state of a high-dimensional system. We show that the algorithm can practically be used in quantum tomography problems that are beyond the reach of convex solvers, and, moreover, is faster than other state-of-the-art non-convex approaches. Crucially, we prove that, despite being a non-convex program, under mild conditions, the algorithm is guaranteed to converge to the global minimum of the problem; thus, it constitutes a provable quantum state tomography protocol.
1 aKyrillidis, Anastasios1 aKalev, Amir1 aPark, Dohuyng1 aBhojanapalli, Srinadh1 aCaramanis, Constantine1 aSanghavi, Sujay uhttps://arxiv.org/abs/1711.0252401429nas a2200169 4500008004100000245010800041210006900149260001500218300001400233490000800247520088200255100002301137700002301160700002101183700001801204856003701222 2017 eng d00aQuantum algorithm for linear differential equations with exponentially improved dependence on precision0 aQuantum algorithm for linear differential equations with exponen c2017/12/01 a1057-10810 v3563 aWe present a quantum algorithm for systems of (possibly inhomogeneous) linear ordinary differential equations with constant coefficients. The algorithm produces a quantum state that is proportional to the solution at a desired final time. The complexity of the algorithm is polynomial in the logarithm of the inverse error, an exponential improvement over previous quantum algorithms for this problem. Our result builds upon recent advances in quantum linear systems algorithms by encoding the simulation into a sparse, well-conditioned linear system that approximates evolution according to the propagator using a Taylor series. Unlike with finite difference methods, our approach does not require additional hypotheses to ensure numerical stability.
1 aBerry, Dominic, W.1 aChilds, Andrew, M.1 aOstrander, Aaron1 aWang, Guoming uhttps://arxiv.org/abs/1701.0368401362nas a2200157 4500008004100000245010600041210006900147260001500216300001400231490000700245520083800252100002301090700001901113700002301132856004901155 2017 eng d00aQuantum algorithm for systems of linear equations with exponentially improved dependence on precision0 aQuantum algorithm for systems of linear equations with exponenti c2017/12/21 a1920-19500 v463 aHarrow, Hassidim, and Lloyd showed that for a suitably specified N×N matrix A and N-dimensional vector b⃗ , there is a quantum algorithm that outputs a quantum state proportional to the solution of the linear system of equations Ax⃗ =b⃗ . If A is sparse and well-conditioned, their algorithm runs in time poly(logN,1/ϵ), where ϵ is the desired precision in the output state. We improve this to an algorithm whose running time is polynomial in log(1/ϵ), exponentially improving the dependence on precision while keeping essentially the same dependence on other parameters. Our algorithm is based on a general technique for implementing any operator with a suitable Fourier or Chebyshev series representation. This allows us to bypass the quantum phase estimation algorithm, whose dependence on ϵ is prohibitive.
1 aChilds, Andrew, M.1 aKothari, Robin1 aSomma, Rolando, D. uhttp://epubs.siam.org/doi/10.1137/16M108707201598nas a2200241 4500008004100000245005800041210005800099260001500157300001100172490000800183520093100191100001301122700001401135700001801149700001601167700001801183700001801201700001301219700001601232700001401248700002201262856007201284 2017 eng d00aQuantum state tomography via reduced density matrices0 aQuantum state tomography via reduced density matrices c2017/01/09 a0204010 v1183 aQuantum state tomography via local measurements is an efficient tool for characterizing quantum states. However it requires that the original global state be uniquely determined (UD) by its local reduced density matrices (RDMs). In this work we demonstrate for the first time a class of states that are UD by their RDMs under the assumption that the global state is pure, but fail to be UD in the absence of that assumption. This discovery allows us to classify quantum states according to their UD properties, with the requirement that each class be treated distinctly in the practice of simplifying quantum state tomography. Additionally we experimentally test the feasibility and stability of performing quantum state tomography via the measurement of local RDMs for each class. These theoretical and experimental results advance the project of performing efficient and accurate quantum state tomography in practice.
1 aXin, Tao1 aLu, Dawei1 aKlassen, Joel1 aYu, Nengkun1 aJi, Zhengfeng1 aChen, Jianxin1 aMa, Xian1 aLong, Guilu1 aZeng, Bei1 aLaflamme, Raymond uhttp://journals.aps.org/prl/abstract/10.1103/PhysRevLett.118.02040100953nas a2200157 4500008004100000245006400041210006400105260001500169300000900184490000700193520050200200100002300702700001800725700001400743856003800757 2016 eng d00aComplexity of the XY antiferromagnet at fixed magnetization0 aComplexity of the XY antiferromagnet at fixed magnetization c2016/01/01 a1-180 v163 a We prove that approximating the ground energy of the antiferromagnetic XY model on a simple graph at fixed magnetization (given as part of the instance specification) is QMA-complete. To show this, we strengthen a previous result by establishing QMA-completeness for approximating the ground energy of the Bose-Hubbard model on simple graphs. Using a connection between the XY and Bose-Hubbard models that we exploited in previous work, this establishes QMA-completeness of the XY model. 1 aChilds, Andrew, M.1 aGosset, David1 aWebb, Zak uhttp://arxiv.org/abs/1503.07083v101164nas a2200169 4500008004100000245007500041210006900116260001500185300001100200490000700211520067400218100001800892700001800910700001600928700001400944856003600958 2016 eng d00aDetecting Consistency of Overlapping Quantum Marginals by Separability0 aDetecting Consistency of Overlapping Quantum Marginals by Separa c2016/03/03 a0321050 v933 a The quantum marginal problem asks whether a set of given density matrices are consistent, i.e., whether they can be the reduced density matrices of a global quantum state. Not many non-trivial analytic necessary (or sufficient) conditions are known for the problem in general. We propose a method to detect consistency of overlapping quantum marginals by considering the separability of some derived states. Our method works well for the $k$-symmetric extension problem in general, and for the general overlapping marginal problems in some cases. Our work is, in some sense, the converse to the well-known $k$-symmetric extension criterion for separability. 1 aChen, Jianxin1 aJi, Zhengfeng1 aYu, Nengkun1 aZeng, Bei uhttp://arxiv.org/abs/1509.0659101507nas a2200145 4500008004100000245007200041210006900113260001500182520103700197100002301234700001901257700002501276700002301301856003701324 2016 eng d00aEntanglement and spin-squeezing without infinite-range interactions0 aEntanglement and spinsqueezing without infiniterange interaction c2016/12/223 aInfinite-range interactions are known to facilitate the production of highly entangled states with applications in quantum information and metrology. However, many experimental systems have interactions that decay with distance, and the achievable benefits in this context are much less clear. Combining recent exact solutions with a controlled expansion in the system size, we analyze quench dynamics in Ising models with power-law (1/r α ) interactions in D dimensions, thereby expanding the understanding of spin squeezing into a broad and experimentally relevant context. In spatially homogeneous systems, we show that for small α the scaling of squeezing with system size is identical to the infinite-range (α = 0) case. This indifference to the interaction range persists up to a critical value α = 2D/3, above which squeezing degrades continuously. Boundaryinduced inhomogeneities present in most experimental systems modify this picture, but it nevertheless remains qualitatively correct for finite-sized systems.
1 aFoss-Feig, Michael1 aGong, Zhe-Xuan1 aGorshkov, Alexey, V.1 aClark, Charles, W. uhttps://arxiv.org/abs/1612.0780501044nas a2200133 4500008004100000245005300041210005000094260001500144520066000159100001700819700001800836700001900854856003700873 2016 eng d00aA finite presentation of CNOT-dihedral operators0 afinite presentation of CNOTdihedral operators c2016/12/313 aWe give a finite presentation by generators and relations of unitary operators expressible over the {CNOT, T, X} gate set, also known as CNOT-dihedral operators. To this end, we introduce a notion of normal form for CNOT-dihedral circuits and prove that every CNOT-dihedral operator admits a unique normal form. Moreover, we show that in the presence of certain structural rules only finitely many circuit identities are required to reduce an arbitrary CNOT-dihedral circuit to its normal form. By appropriately restricting our relations, we obtain a finite presentation of unitary operators expressible over the {CNOT, T } gate set as a corollary.
1 aAmy, Matthew1 aChen, Jianxin1 aRoss, Neil, J. uhttps://arxiv.org/abs/1701.0014001692nas a2200181 4500008004100000245007500041210006900116260001500185520116000200100001801360700001501378700001801393700001901411700001601430700001401446700001401460856003601474 2016 eng d00aJoint product numerical range and geometry of reduced density matrices0 aJoint product numerical range and geometry of reduced density ma c2016/06/233 aThe reduced density matrices of a many-body quantum system form a convex set, whose three-dimensional projection Θ is convex in R3. The boundary ∂Θ of Θ may exhibit nontrivial geometry, in particular ruled surfaces. Two physical mechanisms are known for the origins of ruled surfaces: symmetry breaking and gapless. In this work, we study the emergence of ruled surfaces for systems with local Hamiltonians in infinite spatial dimension, where the reduced density matrices are known to be separable as a consequence of the quantum de Finetti's theorem. This allows us to identify the reduced density matrix geometry with joint product numerical range Π of the Hamiltonian interaction terms. We focus on the case where the interaction terms have certain structures, such that ruled surface emerge naturally when taking a convex hull of Π. We show that, a ruled surface on ∂Θ sitting in Π has a gapless origin, otherwise it has a symmetry breaking origin. As an example, we demonstrate that a famous ruled surface, known as the oloid, is a possible shape of Θ, with two boundary pieces of symmetry breaking origin separated by two gapless lines.1 aChen, Jianxin1 aGuo, Cheng1 aJi, Zhengfeng1 aPoon, Yiu-Tung1 aYu, Nengkun1 aZeng, Bei1 aZhou, Jie uhttp://arxiv.org/abs/1606.0742202179nas a2200157 4500008004100000245010300041210006900144520165700213100002001870700001901890700001901909700001701928700002501945700001501970856003601985 2016 eng d00aMapping constrained optimization problems to quantum annealing with application to fault diagnosis0 aMapping constrained optimization problems to quantum annealing w3 aCurrent quantum annealing (QA) hardware suffers from practical limitations such as finite temperature, sparse connectivity, small qubit numbers, and control error. We propose new algorithms for mapping boolean constraint satisfaction problems (CSPs) onto QA hardware mitigating these limitations. In particular we develop a new embedding algorithm for mapping a CSP onto a hardware Ising model with a fixed sparse set of interactions, and propose two new decomposition algorithms for solving problems too large to map directly into hardware. The mapping technique is locally-structured, as hardware compatible Ising models are generated for each problem constraint, and variables appearing in different constraints are chained together using ferromagnetic couplings. In contrast, global embedding techniques generate a hardware independent Ising model for all the constraints, and then use a minor-embedding algorithm to generate a hardware compatible Ising model. We give an example of a class of CSPs for which the scaling performance of D-Wave's QA hardware using the local mapping technique is significantly better than global embedding. We validate the approach by applying D-Wave's hardware to circuit-based fault-diagnosis. For circuits that embed directly, we find that the hardware is typically able to find all solutions from a min-fault diagnosis set of size N using 1000N samples, using an annealing rate that is 25 times faster than a leading SAT-based sampling method. Further, we apply decomposition algorithms to find min-cardinality faults for circuits that are up to 5 times larger than can be solved directly on current hardware.1 aBian, Zhengbing1 aChudak, Fabian1 aIsrael, Robert1 aLackey, Brad1 aMacready, William, G1 aRoy, Aidan uhttp://arxiv.org/abs/1603.0311103037nas a2200193 4500008004100000245010200041210006900143260001500212300000700227490000600234520240900240100002002649700001902669700002602688700001702714700002502731700001502756856007202771 2016 eng d00aMapping contrained optimization problems to quantum annealing with application to fault diagnosis0 aMapping contrained optimization problems to quantum annealing wi c2016/07/28 a140 v33 aCurrent quantum annealing (QA) hardware suffers from practical limitations such as finite temperature, sparse connectivity, small qubit numbers, and control error. We propose new algorithms for mapping Boolean constraint satisfaction problems (CSPs) onto QA hardware mitigating these limitations. In particular, we develop a new embedding algorithm for mapping a CSP onto a hardware Ising model with a fixed sparse set of interactions and propose two new decomposition algorithms for solving problems too large to map directly into hardware. The mapping technique is locally structured, as hardware compatible Ising models are generated for each problem constraint, and variables appearing in different constraints are chained together using ferromagnetic couplings. By contrast, global embedding techniques generate a hardware-independent Ising model for all the constraints, and then use a minor-embedding algorithm to generate a hardware compatible Ising model. We give an example of a class of CSPs for which the scaling performance of the D-Wave hardware using the local mapping technique is significantly better than global embedding. We validate the approach by applying D- Wave’s QA hardware to circuit-based fault diagnosis. For circuits that embed directly, we find that the hardware is typically able to find all solutions from a min-fault diagnosis set of size N using 1000 N samples, using an annealing rate that is 25 times faster than a leading SAT-based sampling method. Furthermore, we apply decomposition algorithms to find min-cardinality faults for circuits that are up to 5 times larger than can be solved directly on current hardware.
1 aBian, Zhengbing1 aChudak, Fabian1 aIsrael, Robert, Brian1 aLackey, Brad1 aMacready, William, G1 aRoy, Aiden uhttp://journal.frontiersin.org/article/10.3389/fict.2016.00014/full01532nas a2200193 4500008004100000020002200041022001400063245005900077210005900136260001500195300001600210490000700226520098400233100002301217700001701240700001901257700002601276856003601302 2016 eng d a978-3-95977-013-2 a1868-896900aOptimal quantum algorithm for polynomial interpolation0 aOptimal quantum algorithm for polynomial interpolation c2016/03/01 a16:1--16:130 v553 aWe consider the number of quantum queries required to determine the coefficients of a degree-d polynomial over GF(q). A lower bound shown independently by Kane and Kutin and by Meyer and Pommersheim shows that d/2+1/2 quantum queries are needed to solve this problem with bounded error, whereas an algorithm of Boneh and Zhandry shows that d quantum queries are sufficient. We show that the lower bound is achievable: d/2+1/2 quantum queries suffice to determine the polynomial with bounded error. Furthermore, we show that d/2+1 queries suffice to achieve probability approaching 1 for large q. These upper bounds improve results of Boneh and Zhandry on the insecurity of cryptographic protocols against quantum attacks. We also show that our algorithm's success probability as a function of the number of queries is precisely optimal. Furthermore, the algorithm can be implemented with gate complexity poly(log q) with negligible decrease in the success probability.
1 aChilds, Andrew, M.1 avan Dam, Wim1 aHung, Shih-Han1 aShparlinski, Igor, E. uhttp://arxiv.org/abs/1509.0927101395nas a2200145 4500008004100000245008900041210006900130260001500199300001100214490000700225520094000232100002301172700001801195856003601213 2016 eng d00aOptimal state discrimination and unstructured search in nonlinear quantum mechanics0 aOptimal state discrimination and unstructured search in nonlinea c2016/02/11 a0223140 v933 a Nonlinear variants of quantum mechanics can solve tasks that are impossible in standard quantum theory, such as perfectly distinguishing nonorthogonal states. Here we derive the optimal protocol for distinguishing two states of a qubit using the Gross-Pitaevskii equation, a model of nonlinear quantum mechanics that arises as an effective description of Bose-Einstein condensates. Using this protocol, we present an algorithm for unstructured search in the Gross-Pitaevskii model, obtaining an exponential improvement over a previous algorithm of Meyer and Wong. This result establishes a limitation on the effectiveness of the Gross-Pitaevskii approximation. More generally, we demonstrate similar behavior under a family of related nonlinearities, giving evidence that the ability to quickly discriminate nonorthogonal states and thereby solve unstructured search is a generic feature of nonlinear quantum mechanics. 1 aChilds, Andrew, M.1 aYoung, Joshua uhttp://arxiv.org/abs/1507.0633401933nas a2200277 4500008004100000245007200041210006900113260001500182300001100197490000700208520116900215100001301384700001901397700001401416700001801430700001401448700002501462700002301487700001701510700001701527700002101544700001801565700001401583700002201597856003601619 2016 eng d00aPure-state tomography with the expectation value of Pauli operators0 aPurestate tomography with the expectation value of Pauli operato c2016/03/31 a0321400 v933 aWe examine the problem of finding the minimum number of Pauli measurements needed to uniquely determine an arbitrary n-qubit pure state among all quantum states. We show that only 11 Pauli measurements are needed to determine an arbitrary two-qubit pure state compared to the full quantum state tomography with 16 measurements, and only 31 Pauli measurements are needed to determine an arbitrary three-qubit pure state compared to the full quantum state tomography with 64 measurements. We demonstrate that our protocol is robust under depolarizing error with simulated random pure states. We experimentally test the protocol on two- and three-qubit systems with nuclear magnetic resonance techniques. We show that the pure state tomography protocol saves us a number of measurements without considerable loss of fidelity. We compare our protocol with same-size sets of randomly selected Pauli operators and find that our selected set of Pauli measurements significantly outperforms those random sampling sets. As a direct application, our scheme can also be used to reduce the number of settings needed for pure-state tomography in quantum optical systems.
1 aMa, Xian1 aJackson, Tyler1 aZhou, Hui1 aChen, Jianxin1 aLu, Dawei1 aMazurek, Michael, D.1 aFisher, Kent, A.G.1 aPeng, Xinhua1 aKribs, David1 aResch, Kevin, J.1 aJi, Zhengfeng1 aZeng, Bei1 aLaflamme, Raymond uhttp://arxiv.org/abs/1601.0537901224nas a2200169 4500008004100000245005300041210005300094260001500147300001100162490000700173520074800180100001800928700002400946700001800970700001900988856004701007 2016 eng d00aQuantifying the coherence of pure quantum states0 aQuantifying the coherence of pure quantum states c2016/10/07 a0423130 v943 aIn recent years, several measures have been proposed for characterizing the coherence of a given quantum state. We derive several results that illuminate how these measures behave when restricted to pure states. Notably, we present an explicit characterization of the closest incoherent state to a given pure state under the trace distance measure of coherence, and we affirm a recent conjecture that the ℓ1 measure of coherence of a pure state is never smaller than its relative entropy of coherence. We then use our result to show that the states maximizing the trace distance of coherence are exactly the maximally coherent states, and we derive a new inequality relating the negativity and distillable entanglement of pure states.
1 aChen, Jianxin1 aJohnston, Nathaniel1 aLi, Chi-Kwong1 aPlosker, Sarah uhttps://doi.org/10.1103/PhysRevA.94.04231301444nas a2200169 4500008004100000245006100041210006000102260001500162300001100177490000700188520092700195100002201122700001801144700001901162700002501181856006801206 2016 eng d00aSelf-organization of atoms coupled to a chiral reservoir0 aSelforganization of atoms coupled to a chiral reservoir c2016/11/29 a0538550 v943 aTightly confined modes of light, as in optical nanofibers or photonic crystal waveguides, can lead to large optical coupling in atomic systems, which mediates long-range interactions between atoms. These one-dimensional systems can naturally possess couplings that are asymmetric between modes propagating in different directions. Strong long-range interaction among atoms via these modes can drive them to a self-organized periodic distribution. In this paper, we examine the self-organizing behavior of atoms in one dimension coupled to a chiral reservoir. We determine the solution to the equations of motion in different parameter regimes, relative to both the detuning of the pump laser that initializes the atomic dipole-dipole interactions and the degree of reservoir chirality. In addition, we calculate possible experimental signatures such as reflectivity from self-organized atoms and motional sidebands.
1 aEldredge, Zachary1 aSolano, Pablo1 aChang, Darrick1 aGorshkov, Alexey, V. uhttp://journals.aps.org/pra/abstract/10.1103/PhysRevA.94.05385501465nas a2200205 4500008004100000245006900041210006800110260001500178300001100193490000700204520085500211100002201066700001401088700001901102700002001121700002101141700001701162700002501179856005501204 2016 eng d00aSubwavelength-width optical tunnel junctions for ultracold atoms0 aSubwavelengthwidth optical tunnel junctions for ultracold atoms c2016/12/27 a0634220 v943 aWe propose a method for creating far-field optical barrier potentials for ultracold atoms with widths that are narrower than the diffraction limit and can approach tens of nanometers. The reduced widths stem from the nonlinear atomic response to control fields that create spatially varying dark resonances. The subwavelength barrier is the result of the geometric scalar potential experienced by an atom prepared in such a spatially varying dark state. The performance of this technique, as well as its applications to the study of many-body physics and to the implementation of quantum-information protocols with ultracold atoms, are discussed, with a focus on the implementation of tunnel junctions.
1 aJendrzejewski, F.1 aEckel, S.1 aTiecke, T., G.1 aJuzeliūnas, G.1 aCampbell, G., K.1 aJiang, Liang1 aGorshkov, Alexey, V. uhttp://link.aps.org/doi/10.1103/PhysRevA.94.06342201747nas a2200241 4500008004100000245009400041210006900135260001500204300001100219490000800230520106300238100001401301700001301315700001601328700001801344700001801362700001601380700002001396700001701416700001401433700002201447856003601469 2016 eng d00aTomography is necessary for universal entanglement detection with single-copy observables0 aTomography is necessary for universal entanglement detection wit c2016/06/07 a2305010 v1163 aEntanglement, one of the central mysteries of quantum mechanics, plays an essential role in numerous applications of quantum information theory. A natural question of both theoretical and experimental importance is whether universal entanglement detection is possible without full state tomography. In this work, we prove a no-go theorem that rules out this possibility for any non-adaptive schemes that employ single-copy measurements only. We also examine in detail a previously implemented experiment, which claimed to detect entanglement of two-qubit states via adaptive single-copy measurements without full state tomography. By performing the experiment and analyzing the data, we demonstrate that the information gathered is indeed sufficient to reconstruct the state. These results reveal a fundamental limit for single-copy measurements in entanglement detection, and provides a general framework to study the detection of other interesting properties of quantum states, such as the positivity of partial transpose and the k-symmetric extendibility.1 aLu, Dawei1 aXin, Tao1 aYu, Nengkun1 aJi, Zhengfeng1 aChen, Jianxin1 aLong, Guilu1 aBaugh, Jonathan1 aPeng, Xinhua1 aZeng, Bei1 aLaflamme, Raymond uhttp://arxiv.org/abs/1511.0058101548nas a2200157 4500008004100000245010700041210006900148260001500217520099200232100001801224700001601242700002501258700001701283700001601300856007401316 2015 eng d00aAtom induced cavities and tunable long-range interactions between atoms trapped near photonic crystals0 aAtom induced cavities and tunable longrange interactions between c2015/03/033 aUsing cold atoms to simulate strongly interacting quantum systems represents an exciting frontier of physics. However, achieving tunable, coherent long-range interactions between atoms is an outstanding challenge, which currently leaves a large class of models inaccessible to quantum simulation. Here, we propose a solution exploiting the powerful new platform of cold atoms trapped near nano-photonic systems. We show that the dielectric contrast of an atom trapped near a photonic crystal can seed a localized cavity mode around the atomic position. In a dynamic form of “all-atomic” cavity QED, the length of these cavity modes can be tuned, and atoms separated by the order of the e↵ective cavity length can interact coherently with each other. Considering realistic conditions such as fabrication disorder and photon losses, coherent long-range potentials or spin interactions can be dominant in the system over length scales up to hundreds of wavelengths.
1 aDouglas, J, S1 aHabibian, H1 aGorshkov, Alexey, V.1 aKimble, H, J1 aChang, D, E uhttp://www.nature.com/nphoton/journal/v9/n5/full/nphoton.2015.57.html01507nas a2200229 4500008004100000245005700041210005700098260001500155300001100170490000800181520087400189100002701063700002101090700001601111700001301127700001501140700002001155700001801175700002101193700002501214856003801239 2015 eng d00aCoulomb bound states of strongly interacting photons0 aCoulomb bound states of strongly interacting photons c2015/09/16 a1236010 v1153 a We show that two photons coupled to Rydberg states via electromagnetically induced transparency can interact via an effective Coulomb potential. This interaction gives rise to a continuum of two-body bound states. Within the continuum, metastable bound states are distinguished in analogy with quasi-bound states tunneling through a potential barrier. We find multiple branches of metastable bound states whose energy spectrum is governed by the Coulomb potential, thus obtaining a photonic analogue of the hydrogen atom. Under certain conditions, the wavefunction resembles that of a diatomic molecule in which the two polaritons are separated by a finite "bond length." These states propagate with a negative group velocity in the medium, allowing for a simple preparation and detection scheme, before they slowly decay to pairs of bound Rydberg atoms. 1 aMaghrebi, Mohammad, F.1 aGullans, Michael1 aBienias, P.1 aChoi, S.1 aMartin, I.1 aFirstenberg, O.1 aLukin, M., D.1 aBüchler, H., P.1 aGorshkov, Alexey, V. uhttp://arxiv.org/abs/1505.03859v101589nas a2200193 4500008004100000245008100041210006900122260001500191300001100206490000700217520100800224100002301232700002501255700001901280700001901299700002001318700002101338856003601359 2015 eng d00aDemonstration of Robust Quantum Gate Tomography via Randomized Benchmarking0 aDemonstration of Robust Quantum Gate Tomography via Randomized B c2015/11/05 a1130190 v173 a Typical quantum gate tomography protocols struggle with a self-consistency problem: the gate operation cannot be reconstructed without knowledge of the initial state and final measurement, but such knowledge cannot be obtained without well-characterized gates. A recently proposed technique, known as randomized benchmarking tomography (RBT), sidesteps this self-consistency problem by designing experiments to be insensitive to preparation and measurement imperfections. We implement this proposal in a superconducting qubit system, using a number of experimental improvements including implementing each of the elements of the Clifford group in single `atomic' pulses and custom control hardware to enable large overhead protocols. We show a robust reconstruction of several single-qubit quantum gates, including a unitary outside the Clifford group. We demonstrate that RBT yields physical gate reconstructions that are consistent with fidelities obtained by randomized benchmarking. 1 aJohnson, Blake, R.1 ada Silva, Marcus, P.1 aRyan, Colm, A.1 aKimmel, Shelby1 aChow, Jerry, M.1 aOhki, Thomas, A. uhttp://arxiv.org/abs/1505.0668601250nas a2200217 4500008004100000245007700041210006900118260001500187300001100202490000700213520064200220100001800862700001800880700001800898700001900916700001300935700001600948700001400964700001700978856003700995 2015 eng d00aDiscontinuity of Maximum Entropy Inference and Quantum Phase Transitions0 aDiscontinuity of Maximum Entropy Inference and Quantum Phase Tra c2015/08/10 a0830190 v173 a In this paper, we discuss the connection between two genuinely quantum phenomena --- the discontinuity of quantum maximum entropy inference and quantum phase transitions at zero temperature. It is shown that the discontinuity of the maximum entropy inference of local observable measurements signals the non-local type of transitions, where local density matrices of the ground state change smoothly at the transition point. We then propose to use the quantum conditional mutual information of the ground state as an indicator to detect the discontinuity and the non-local type of quantum phase transitions in the thermodynamic limit. 1 aChen, Jianxin1 aJi, Zhengfeng1 aLi, Chi-Kwong1 aPoon, Yiu-Tung1 aShen, Yi1 aYu, Nengkun1 aZeng, Bei1 aZhou, Duanlu uhttp://arxiv.org/abs/1406.5046v201453nas a2200145 4500008004100000245007600041210006900117260001500186300001200201520099300213100002301206700002301229700001901252856003601271 2015 eng d00aHamiltonian simulation with nearly optimal dependence on all parameters0 aHamiltonian simulation with nearly optimal dependence on all par c2015/01/08 a792-8093 a We present an algorithm for sparse Hamiltonian simulation that has optimal dependence on all parameters of interest (up to log factors). Previous algorithms had optimal or near-optimal scaling in some parameters at the cost of poor scaling in others. Hamiltonian simulation via a quantum walk has optimal dependence on the sparsity $d$ at the expense of poor scaling in the allowed error $\epsilon$. In contrast, an approach based on fractional-query simulation provides optimal scaling in $\epsilon$ at the expense of poor scaling in $d$. Here we combine the two approaches, achieving the best features of both. By implementing a linear combination of quantum walk steps with coefficients given by Bessel functions, our algorithm achieves near-linear scaling in $\tau := d \|H\|_{\max} t$ and sublogarithmic scaling in $1/\epsilon$. Our dependence on $\epsilon$ is optimal, and we prove a new lower bound showing that no algorithm can have sublinear dependence on $\tau$. 1 aBerry, Dominic, W.1 aChilds, Andrew, M.1 aKothari, Robin uhttp://arxiv.org/abs/1501.0171500853nas a2200145 4500008004100000245010600041210006900147260001500216300001400231490000800245520037500253100001800628700002400646856003700670 2015 eng d00aThe Minimum Size of Unextendible Product Bases in the Bipartite Case (and Some Multipartite Cases) 0 aMinimum Size of Unextendible Product Bases in the Bipartite Case c2014/10/10 a351 - 3650 v3333 a A long-standing open question asks for the minimum number of vectors needed to form an unextendible product basis in a given bipartite or multipartite Hilbert space. A partial solution was found by Alon and Lovasz in 2001, but since then only a few other cases have been solved. We solve all remaining bipartite cases, as well as a large family of multipartite cases. 1 aChen, Jianxin1 aJohnston, Nathaniel uhttp://arxiv.org/abs/1301.1406v100877nas a2200181 4500008004100000245002200041210002200063260001500085300001200100490000700112520044800119100002300567700001800590700001800608700001800626700001400644856003700658 2015 eng d00aMomentum switches0 aMomentum switches c2015/05/01 a601-6210 v153 a Certain continuous-time quantum walks can be viewed as scattering processes. These processes can perform quantum computations, but it is challenging to design graphs with desired scattering behavior. In this paper, we study and construct momentum switches, graphs that route particles depending on their momenta. We also give an example where there is no exact momentum switch, although we construct an arbitrarily good approximation. 1 aChilds, Andrew, M.1 aGosset, David1 aNagaj, Daniel1 aRaha, Mouktik1 aWebb, Zak uhttp://arxiv.org/abs/1406.4510v101522nas a2200169 4500008004100000245007200041210006900113260001500182300001100197490000800208520100900216100002301225700001901248700002301267700002501290856003701315 2015 eng d00aNearly-linear light cones in long-range interacting quantum systems0 aNearlylinear light cones in longrange interacting quantum system c2015/04/13 a1572010 v1143 a In non-relativistic quantum theories with short-range Hamiltonians, a velocity $v$ can be chosen such that the influence of any local perturbation is approximately confined to within a distance $r$ until a time $t \sim r/v$, thereby defining a linear light cone and giving rise to an emergent notion of locality. In systems with power-law ($1/r^{\alpha}$) interactions, when $\alpha$ exceeds the dimension $D$, an analogous bound confines influences to within a distance $r$ only until a time $t\sim(\alpha/v)\log r$, suggesting that the velocity, as calculated from the slope of the light cone, may grow exponentially in time. We rule out this possibility; light cones of power-law interacting systems are algebraic for $\alpha>2D$, becoming linear as $\alpha\rightarrow\infty$. Our results impose strong new constraints on the growth of correlations and the production of entangled states in a variety of rapidly emerging, long-range interacting atomic, molecular, and optical systems. 1 aFoss-Feig, Michael1 aGong, Zhe-Xuan1 aClark, Charles, W.1 aGorshkov, Alexey, V. uhttp://arxiv.org/abs/1410.3466v101186nas a2200181 4500008004100000245004300041210004300084260001500127300000800142490000700150520060900157100002300766700003000789700001800819700001900837700001900856856012900875 2015 eng d00aOptomechanical reference accelerometer0 aOptomechanical reference accelerometer c2015/09/08 a6540 v523 aWe present an optomechanical accelerometer with high dynamic range, high bandwidth and read-out noise levels below 8 ${\mu}$g/$\sqrt{\mathrm{Hz}}$. The straightforward assembly and low cost of our device make it a prime candidate for on-site reference calibrations and autonomous navigation. We present experimental data taken with a vacuum sealed, portable prototype and deduce the achieved bias stability and scale factor accuracy. Additionally, we present a comprehensive model of the device physics that we use to analyze the fundamental noise sources and accuracy limitations of such devices.
1 aGerberding, Oliver1 aCervantes, Felipe, Guzman1 aMelcher, John1 aPratt, Jon, R.1 aTaylor, J., M. uhttp://iopscience.iop.org/article/10.1088/0026-1394/52/5/654/meta;jsessionid=C2B417A5CD50B9B57EE14C78E1783802.ip-10-40-1-10501362nas a2200181 4500008004100000245005800041210005800099260001500157300001100172490000800183520083900191100002701030700002101057700002201078700002501100700001701125856003801142 2015 eng d00aParafermionic zero modes in ultracold bosonic systems0 aParafermionic zero modes in ultracold bosonic systems c2015/08/06 a0653010 v1153 a Exotic topologically protected zero modes with parafermionic statistics (also called fractionalized Majorana modes) have been proposed to emerge in devices fabricated from a fractional quantum Hall system and a superconductor. The fractionalized statistics of these modes takes them an important step beyond the simplest non-Abelian anyons, Majorana fermions. Building on recent advances towards the realization of fractional quantum Hall states of bosonic ultracold atoms, we propose a realization of parafermions in a system consisting of Bose-Einstein-condensate trenches within a bosonic fractional quantum Hall state. We show that parafermionic zero modes emerge at the endpoints of the trenches and give rise to a topologically protected degeneracy. We also discuss methods for preparing and detecting these modes. 1 aMaghrebi, Mohammad, F.1 aGaneshan, Sriram1 aClarke, David, J.1 aGorshkov, Alexey, V.1 aSau, Jay, D. uhttp://arxiv.org/abs/1504.04012v200602nas a2200193 4500008004100000022001400041245007400055210006900129260001500198300001400213490000600227100002000233700001700253700001600270700002500286700001900311700001800330856006000348 2015 eng d a1749-488500aQuantum many-body models with cold atoms coupled to photonic crystals0 aQuantum manybody models with cold atoms coupled to photonic crys c2015/04/04 a326 - 3310 v91 aDouglas, J., S.1 aHabibian, H.1 aHung, C.-L.1 aGorshkov, Alexey, V.1 aKimble, H., J.1 aChang, D., E. uhttp://www.nature.com/doifinder/10.1038/nphoton.2015.5701945nas a2200205 4500008004100000245007600041210006900117260001500186300001100201490000700212520133700219100001901556700001901575700001901594700002401613700002701637700001801664700001901682856003801701 2015 eng d00aSelf-heterodyne detection of the {\it in-situ} phase of an atomic-SQUID0 aSelfheterodyne detection of the it insitu phase of an atomicSQUI c2015/09/03 a0336020 v923 a We present theoretical and experimental analysis of an interferometric measurement of the {\it in-situ} phase drop across and current flow through a rotating barrier in a toroidal Bose-Einstein condensate (BEC). This experiment is the atomic analog of the rf-superconducting quantum interference device (SQUID). The phase drop is extracted from a spiral-shaped density profile created by the spatial interference of the expanding toroidal BEC and a reference BEC after release from all trapping potentials. We characterize the interferometer when it contains a single particle, which is initially in a coherent superposition of a torus and reference state, as well as when it contains a many-body state in the mean-field approximation. The single-particle picture is sufficient to explain the origin of the spirals, to relate the phase-drop across the barrier to the geometry of a spiral, and to bound the expansion times for which the {\it in-situ} phase can be accurately determined. Mean-field estimates and numerical simulations show that the inter-atomic interactions shorten the expansion time scales compared to the single-particle case. Finally, we compare the mean-field simulations with our experimental data and confirm that the interferometer indeed accurately measures the {\it in-situ} phase drop. 1 aMathew, Ranchu1 aKumar, Avinash1 aEckel, Stephen1 aJendrzejewski, Fred1 aCampbell, Gretchen, K.1 aEdwards, Mark1 aTiesinga, Eite uhttp://arxiv.org/abs/1506.09149v201120nas a2200181 4500008004100000245006700041210006700108260001500175300001100190490000800201520058500209100002300794700002300817700001900840700001900859700002300878856003700901 2015 eng d00aSimulating Hamiltonian dynamics with a truncated Taylor series0 aSimulating Hamiltonian dynamics with a truncated Taylor series c2015/03/03 a0905020 v1143 a We describe a simple, efficient method for simulating Hamiltonian dynamics on a quantum computer by approximating the truncated Taylor series of the evolution operator. Our method can simulate the time evolution of a wide variety of physical systems. As in another recent algorithm, the cost of our method depends only logarithmically on the inverse of the desired precision, which is optimal. However, we simplify the algorithm and its analysis by using a method for implementing linear combinations of unitary operations to directly apply the truncated Taylor series. 1 aBerry, Dominic, W.1 aChilds, Andrew, M.1 aCleve, Richard1 aKothari, Robin1 aSomma, Rolando, D. uhttp://arxiv.org/abs/1412.4687v101602nas a2200169 4500008004100000245007000041210006900111260001500180300001400195490000800209520110500217100001401322700001801336700002701354700001401381856003701395 2015 eng d00aUniversal Subspaces for Local Unitary Groups of Fermionic Systems0 aUniversal Subspaces for Local Unitary Groups of Fermionic System c2014/10/10 a541 - 5630 v3333 a Let $\mathcal{V}=\wedge^N V$ be the $N$-fermion Hilbert space with $M$-dimensional single particle space $V$ and $2N\le M$. We refer to the unitary group $G$ of $V$ as the local unitary (LU) group. We fix an orthonormal (o.n.) basis $\ket{v_1},...,\ket{v_M}$ of $V$. Then the Slater determinants $e_{i_1,...,i_N}:= \ket{v_{i_1}\we v_{i_2}\we...\we v_{i_N}}$ with $i_1<...In this brief report, we consider the equivalence between two sets of m + 1 bipartite quantum states under local unitary transformations. For pure states, this problem corresponds to the matrix algebra question of whether two degree m matrix polynomials are unitarily equivalent; i.e. UA
Quantum entanglement plays a central role in quantum information processing. A main objective of the theory is to classify different types of entanglement according to their interconvertibility through manipulations that do not require additional entanglement to perform. While bipartite entanglement is well understood in this framework, the classification of entanglements among three or more subsystems is inherently much more difficult. In this paper, we study pure state entanglement in systems of dimension 2⊗m⊗n. Two states are considered equivalent if they can be reversibly converted from one to the other with a nonzero probability using only local quantum resources and classical communication (SLOCC). We introduce a connection between entanglement manipulations in these systems and the well-studied theory of matrix pencils. All previous attempts to study general SLOCC equivalence in such systems have relied on somewhat contrived techniques which fail to reveal the elegant structure of the problem that can be seen from the matrix pencil approach. Based on this method, we report the first polynomial-time algorithm for deciding when two2⊗m⊗n states are SLOCC equivalent. We then proceed to present a canonical form for all 2⊗m⊗n states based on the matrix pencil construction such that two states are equivalent if and only if they have the same canonical form. Besides recovering the previously known 26 distinct SLOCC equivalence classes in 2⊗3⊗n systems, we also determine the hierarchy between these classes.
1 aChitambar, Eric1 aMiller, Carl1 aShi, Yaoyun uhttp://scitation.aip.org/content/aip/journal/jmp/51/7/10.1063/1.345906901378nas a2200157 4500008004100000245007600041210006900117260001300186490000700199520090300206100001301109700001501122700002301137700002301160856003701183 2010 eng d00aNoise correlations of one-dimensional Bose mixtures in optical lattices0 aNoise correlations of onedimensional Bose mixtures in optical la c2010/6/20 v813 a We study the noise correlations of one-dimensional binary Bose mixtures, as a probe of their quantum phases. In previous work, we found a rich structure of many-body phases in such mixtures, such as paired and counterflow superfluidity. Here we investigate the signature of these phases in the noise correlations of the atomic cloud after time-of-flight expansion, using both Luttinger liquid theory and the time-evolving block decimation (TEBD) method. We find that paired and counterflow superfluidity exhibit distinctive features in the noise spectra. We treat both extended and inhomogeneous systems, and our numerical work shows that the essential physics of the extended systems is present in the trapped-atom systems of current experimental interest. For paired and counterflow superfluid phases, we suggest methods for extracting Luttinger parameters from noise correlation spectroscopy. 1 aHu, Anzi1 aMathey, L.1 aWilliams, Carl, J.1 aClark, Charles, W. uhttp://arxiv.org/abs/1002.4918v201374nas a2200133 4500008004100000245008300041210006900124260001500193520094600208100001401154700001801168700001701186856003701203 2010 eng d00aOptimal Perfect Distinguishability between Unitaries and Quantum Operations 0 aOptimal Perfect Distinguishability between Unitaries and Quantum c2010/10/123 a We study optimal perfect distinguishability between a unitary and a general quantum operation. In 2-dimensional case we provide a simple sufficient and necessary condition for sequential perfect distinguishability and an analytical formula of optimal query time. We extend the sequential condition to general d-dimensional case. Meanwhile, we provide an upper bound and a lower bound for optimal sequential query time. In the process a new iterative method is given, the most notable innovation of which is its independence to auxiliary systems or entanglement. Following the idea, we further obtain an upper bound and a lower bound of (entanglement-assisted) q-maximal fidelities between a unitary and a quantum operation. Thus by the recursion in [1] an upper bound and a lower bound for optimal general perfect discrimination are achieved. Finally our lower bound result can be extended to the case of arbitrary two quantum operations. 1 aLu, Cheng1 aChen, Jianxin1 aDuan, Runyao uhttp://arxiv.org/abs/1010.2298v101132nas a2200157 4500008004100000245007300041210006900114260001500183520064900198100001800847700001800865700002300883700001400906700001700920856003700937 2010 eng d00aPrinciple of Maximum Entropy and Ground Spaces of Local Hamiltonians0 aPrinciple of Maximum Entropy and Ground Spaces of Local Hamilton c2010/10/133 a The structure of the ground spaces of quantum systems consisting of local interactions is of fundamental importance to different areas of physics. In this Letter, we present a necessary and sufficient condition for a subspace to be the ground space of a k-local Hamiltonian. Our analysis are motivated by the concept of irreducible correlations studied by [Linden et al., PRL 89, 277906] and [Zhou, PRL 101, 180505], which is in turn based on the principle of maximum entropy. It establishes a better understanding of the ground spaces of local Hamiltonians and builds an intimate link of ground spaces to the correlations of quantum states. 1 aChen, Jianxin1 aJi, Zhengfeng1 aRuskai, Mary, Beth1 aZeng, Bei1 aZhou, Duanlu uhttp://arxiv.org/abs/1010.2739v401122nas a2200145 4500008004100000245004600041210004600087260001400133300001100147490000700158520073400165100002300899700001700922856003700939 2010 eng d00aQuantum algorithms for algebraic problems0 aQuantum algorithms for algebraic problems c2010/1/15 a1 - 520 v823 a Quantum computers can execute algorithms that dramatically outperform classical computation. As the best-known example, Shor discovered an efficient quantum algorithm for factoring integers, whereas factoring appears to be difficult for classical computers. Understanding what other computational problems can be solved significantly faster using quantum algorithms is one of the major challenges in the theory of quantum computation, and such algorithms motivate the formidable task of building a large-scale quantum computer. This article reviews the current state of quantum algorithms, focusing on algorithms with superpolynomial speedup over classical computation, and in particular, on problems with an algebraic flavor. 1 aChilds, Andrew, M.1 avan Dam, Wim uhttp://arxiv.org/abs/0812.0380v101146nas a2200145 4500008004100000245005500041210005400096260001500150300001200165520072600177100002100903700002300924700001600947856003700963 2010 eng d00aQuantum property testing for bounded-degree graphs0 aQuantum property testing for boundeddegree graphs c2010/12/14 a365-3763 a We study quantum algorithms for testing bipartiteness and expansion of bounded-degree graphs. We give quantum algorithms that solve these problems in time O(N^(1/3)), beating the Omega(sqrt(N)) classical lower bound. For testing expansion, we also prove an Omega(N^(1/4)) quantum query lower bound, thus ruling out the possibility of an exponential quantum speedup. Our quantum algorithms follow from a combination of classical property testing techniques due to Goldreich and Ron, derandomization, and the quantum algorithm for element distinctness. The quantum lower bound is obtained by the polynomial method, using novel algebraic techniques and combinatorial analysis to accommodate the graph structure. 1 aAmbainis, Andris1 aChilds, Andrew, M.1 aLiu, Yi-Kai uhttp://arxiv.org/abs/1012.3174v301937nas a2200133 4500008004100000245007500041210006600116260001500182300001400197490000800211520152400219100002301743856003701766 2010 eng d00aOn the relationship between continuous- and discrete-time quantum walk0 arelationship between continuous and discretetime quantum walk c2009/10/10 a581 - 6030 v2943 a Quantum walk is one of the main tools for quantum algorithms. Defined by analogy to classical random walk, a quantum walk is a time-homogeneous quantum process on a graph. Both random and quantum walks can be defined either in continuous or discrete time. But whereas a continuous-time random walk can be obtained as the limit of a sequence of discrete-time random walks, the two types of quantum walk appear fundamentally different, owing to the need for extra degrees of freedom in the discrete-time case. In this article, I describe a precise correspondence between continuous- and discrete-time quantum walks on arbitrary graphs. Using this correspondence, I show that continuous-time quantum walk can be obtained as an appropriate limit of discrete-time quantum walks. The correspondence also leads to a new technique for simulating Hamiltonian dynamics, giving efficient simulations even in cases where the Hamiltonian is not sparse. The complexity of the simulation is linear in the total evolution time, an improvement over simulations based on high-order approximations of the Lie product formula. As applications, I describe a continuous-time quantum walk algorithm for element distinctness and show how to optimally simulate continuous-time query algorithms of a certain form in the conventional quantum query model. Finally, I discuss limitations of the method for simulating Hamiltonians with negative matrix elements, and present two problems that motivate attempting to circumvent these limitations. 1 aChilds, Andrew, M. uhttp://arxiv.org/abs/0810.0312v301041nas a2200121 4500008004100000245006000041210006000101260001500161520066400176100002300840700001900863856003700882 2010 eng d00aSimulating sparse Hamiltonians with star decompositions0 aSimulating sparse Hamiltonians with star decompositions c2010/03/183 a We present an efficient algorithm for simulating the time evolution due to a sparse Hamiltonian. In terms of the maximum degree d and dimension N of the space on which the Hamiltonian H acts for time t, this algorithm uses (d^2(d+log* N)||Ht||)^{1+o(1)} queries. This improves the complexity of the sparse Hamiltonian simulation algorithm of Berry, Ahokas, Cleve, and Sanders, which scales like (d^4(log* N)||Ht||)^{1+o(1)}. To achieve this, we decompose a general sparse Hamiltonian into a small sum of Hamiltonians whose graphs of non-zero entries have the property that every connected component is a star, and efficiently simulate each of these pieces. 1 aChilds, Andrew, M.1 aKothari, Robin uhttp://arxiv.org/abs/1003.3683v201436nas a2200121 4500008004100000245006400041210006300105260001500168520104800183100002301231700002301254856003701277 2009 eng d00aBlack-box Hamiltonian simulation and unitary implementation0 aBlackbox Hamiltonian simulation and unitary implementation c2009/10/223 a We present general methods for simulating black-box Hamiltonians using quantum walks. These techniques have two main applications: simulating sparse Hamiltonians and implementing black-box unitary operations. In particular, we give the best known simulation of sparse Hamiltonians with constant precision. Our method has complexity linear in both the sparseness D (the maximum number of nonzero elements in a column) and the evolution time t, whereas previous methods had complexity scaling as D^4 and were superlinear in t. We also consider the task of implementing an arbitrary unitary operation given a black-box description of its matrix elements. Whereas standard methods for performing an explicitly specified N x N unitary operation use O(N^2) elementary gates, we show that a black-box unitary can be performed with bounded error using O(N^{2/3} (log log N)^{4/3}) queries to its matrix elements. In fact, except for pathological cases, it appears that most unitaries can be performed with only O(sqrt{N}) queries, which is optimal. 1 aBerry, Dominic, W.1 aChilds, Andrew, M. uhttp://arxiv.org/abs/0910.4157v401137nas a2200157 4500008004100000245008200041210006900123260001300192490000700205520065000212100001500862700001900877700002300896700002300919856003700942 2009 eng d00aCollisional cooling of ultra-cold atom ensembles using Feshbach resonances 0 aCollisional cooling of ultracold atom ensembles using Feshbach r c2009/9/80 v803 a We propose a new type of cooling mechanism for ultra-cold fermionic atom ensembles, which capitalizes on the energy dependence of inelastic collisions in the presence of a Feshbach resonance. We first discuss the case of a single magnetic resonance, and find that the final temperature and the cooling rate is limited by the width of the resonance. A concrete example, based on a p-wave resonance of $^{40}$K, is given. We then improve upon this setup by using both a very sharp optical or radio-frequency induced resonance and a very broad magnetic resonance and show that one can improve upon temperatures reached with current technologies. 1 aMathey, L.1 aTiesinga, Eite1 aJulienne, Paul, S.1 aClark, Charles, W. uhttp://arxiv.org/abs/0903.2568v101819nas a2200181 4500008004100000245009700041210006900138260001400207490000700221520125900228100001301487700001501500700002001515700001901535700002301554700002301577856003701600 2009 eng d00aCounterflow and paired superfluidity in one-dimensional Bose mixtures in optical lattices 0 aCounterflow and paired superfluidity in onedimensional Bose mixt c2009/8/240 v803 a We study the quantum phases of mixtures of ultra-cold bosonic atoms held in an optical lattice that confines motion or hopping to one spatial dimension. The phases are found by using Tomonaga-Luttinger liquid theory as well as the numerical method of time evolving block decimation (TEBD). We consider a binary mixture with repulsive intra-species interactions, and either repulsive or attractive inter-species interaction. For a homogeneous system, we find paired- and counterflow-superfluid phases at different filling and hopping energies. We also predict parameter regions in which these types of superfluid order coexist with charge density wave order. We show that the Tomonaga-Luttinger liquid theory and TEBD qualitatively agree on the location of the phase boundary to superfluidity. We then describe how these phases are modified and can be detected when an additional harmonic trap is present. In particular, we show how experimentally measurable quantities, such as time-of-flight images and the structure factor, can be used to distinguish the quantum phases. Finally, we suggest applying a Feshbach ramp to detect the paired superfluid state, and a $\pi/2$ pulse followed by Bragg spectroscopy to detect the counterflow superfluid phase. 1 aHu, Anzi1 aMathey, L.1 aDanshita, Ippei1 aTiesinga, Eite1 aWilliams, Carl, J.1 aClark, Charles, W. uhttp://arxiv.org/abs/0906.2150v100832nas a2200169 4500008004100000245005200041210005100093260001500144300001400159490000600173520035600179100002300535700001900558700002400577700001700601856004400618 2009 eng d00aDiscrete-query quantum algorithm for NAND trees0 aDiscretequery quantum algorithm for NAND trees c2009/07/01 a119 - 1230 v53 a Recently, Farhi, Goldstone, and Gutmann gave a quantum algorithm for evaluating NAND trees that runs in time O(sqrt(N log N)) in the Hamiltonian query model. In this note, we point out that their algorithm can be converted into an algorithm using O(N^{1/2 + epsilon}) queries in the conventional quantum query model, for any fixed epsilon > 0. 1 aChilds, Andrew, M.1 aCleve, Richard1 aJordan, Stephen, P.1 aYeung, David uhttp://arxiv.org/abs/quant-ph/0702160v101322nas a2200121 4500008004100000245006100041210006000102260001500162520094400177100002301121700001901144856003701163 2009 eng d00aLimitations on the simulation of non-sparse Hamiltonians0 aLimitations on the simulation of nonsparse Hamiltonians c2009/08/313 a The problem of simulating sparse Hamiltonians on quantum computers is well studied. The evolution of a sparse N x N Hamiltonian H for time t can be simulated using O(||Ht||poly(log N)) operations, which is essentially optimal due to a no--fast-forwarding theorem. Here, we consider non-sparse Hamiltonians and show significant limitations on their simulation. We generalize the no--fast-forwarding theorem to dense Hamiltonians, ruling out generic simulations taking time o(||Ht||), even though ||H|| is not a unique measure of the size of a dense Hamiltonian $H$. We also present a stronger limitation ruling out the possibility of generic simulations taking time poly(||Ht||,log N), showing that known simulations based on discrete-time quantum walk cannot be dramatically improved in general. On the positive side, we show that some non-sparse Hamiltonians can be simulated efficiently, such as those with graphs of small arboricity. 1 aChilds, Andrew, M.1 aKothari, Robin uhttp://arxiv.org/abs/0908.4398v200937nas a2200145 4500008004100000245005000041210004600091260001500137520051500152100002100667700002300688700002300711700002000734856003700754 2009 eng d00aThe quantum query complexity of certification0 aquantum query complexity of certification c2009/03/063 a We study the quantum query complexity of finding a certificate for a d-regular, k-level balanced NAND formula. Up to logarithmic factors, we show that the query complexity is Theta(d^{(k+1)/2}) for 0-certificates, and Theta(d^{k/2}) for 1-certificates. In particular, this shows that the zero-error quantum query complexity of evaluating such formulas is O(d^{(k+1)/2}) (again neglecting a logarithmic factor). Our lower bound relies on the fact that the quantum adversary method obeys a direct sum theorem. 1 aAmbainis, Andris1 aChilds, Andrew, M.1 aLe Gall, François1 aTani, Seiichiro uhttp://arxiv.org/abs/0903.1291v200931nas a2200121 4500008004100000245004200041210004200083260001300125490000800138520060300146100002300749856003700772 2009 eng d00aUniversal computation by quantum walk0 aUniversal computation by quantum walk c2009/5/40 v1023 a In some of the earliest work on quantum mechanical computers, Feynman showed how to implement universal quantum computation by the dynamics of a time-independent Hamiltonian. I show that this remains possible even if the Hamiltonian is restricted to be a sparse matrix with all entries equal to 0 or 1, i.e., the adjacency matrix of a low-degree graph. Thus quantum walk can be regarded as a universal computational primitive, with any desired quantum computation encoded entirely in some underlying graph. The main idea of the construction is to implement quantum gates by scattering processes. 1 aChilds, Andrew, M. uhttp://arxiv.org/abs/0806.1972v101927nas a2200121 4500008004100000245005300041210005200094260001500146520156900161100001801730700002001748856003701768 2008 eng d00aAncilla-Assisted Discrimination of Quantum Gates0 aAncillaAssisted Discrimination of Quantum Gates c2008/09/023 a The intrinsic idea of superdense coding is to find as many gates as possible such that they can be perfectly discriminated. In this paper, we consider a new scheme of discrimination of quantum gates, called ancilla-assisted discrimination, in which a set of quantum gates on a $d-$dimensional system are perfectly discriminated with assistance from an $r-$dimensional ancilla system. The main contribution of the present paper is two-fold: (1) The number of quantum gates that can be discriminated in this scheme is evaluated. We prove that any $rd+1$ quantum gates cannot be perfectly discriminated with assistance from the ancilla, and there exist $rd$ quantum gates which can be perfectly discriminated with assistance from the ancilla. (2) The dimensionality of the minimal ancilla system is estimated. We prove that there exists a constant positive number $c$ such that for any $k\leq cr$ quantum gates, if they are $d$-assisted discriminable, then they are also $r$-assisted discriminable, and there are $c^{\prime}r\textrm{}(c^{\prime}>c)$ different quantum gates which can be discriminated with a $d-$dimensional ancilla, but they cannot be discriminated if the ancilla is reduced to an $r-$dimensional system. Thus, the order $O(r)$ of the number of quantum gates that can be discriminated with assistance from an $r-$dimensional ancilla is optimal. The results reported in this paper represent a preliminary step toward understanding the role ancilla system plays in discrimination of quantum gates as well as the power and limit of superdense coding. 1 aChen, Jianxin1 aYing, Mingsheng uhttp://arxiv.org/abs/0809.0336v101409nas a2200193 4500008004100000245006800041210006800109260001400177490000800191520083700199100001701036700002501053700001601078700002001094700002201114700001901136700002301155856003701178 2008 eng d00aCoherence of an optically illuminated single nuclear spin qubit0 aCoherence of an optically illuminated single nuclear spin qubit c2008/2/190 v1003 aWe investigate the coherence properties of individual nuclear spin quantum bits in diamond [Dutt et al., Science, 316, 1312 (2007)] when a proximal electronic spin associated with a nitrogen-vacancy (NV) center is being interrogated by optical radiation. The resulting nuclear spin dynamics are governed by time-dependent hyperfine interaction associated with rapid electronic transitions, which can be described by a spin-fluctuator model. We show that due to a process analogous to motional averaging in nuclear magnetic resonance, the nuclear spin coherence can be preserved after a large number of optical excitation cycles. Our theoretical analysis is in good agreement with experimental results. It indicates a novel approach that could potentially isolate the nuclear spin system completely from the electronic environment. 1 aJiang, Liang1 aDutt, M., V. Gurudev1 aTogan, Emre1 aChildress, Lily1 aCappellaro, Paola1 aTaylor, J., M.1 aLukin, Mikhail, D. uhttp://arxiv.org/abs/0707.1341v201032nas a2200181 4500008004100000245003700041210003700078260001500115300001100130490000700141520058000148100001800728700001700746700001800763700002000781700001200801856003700813 2008 eng d00aExistence of Universal Entangler0 aExistence of Universal Entangler c2008/01/01 a0121030 v493 a A gate is called entangler if it transforms some (pure) product states to entangled states. A universal entangler is a gate which transforms all product states to entangled states. In practice, a universal entangler is a very powerful device for generating entanglements, and thus provides important physical resources for accomplishing many tasks in quantum computing and quantum information. This Letter demonstrates that a universal entangler always exists except for a degenerated case. Nevertheless, the problem how to find a universal entangler remains open. 1 aChen, Jianxin1 aDuan, Runyao1 aJi, Zhengfeng1 aYing, Mingsheng1 aYu, Jun uhttp://arxiv.org/abs/0704.1473v201250nas a2200229 4500008004100000245006800041210006700109260001400176300001400190490000600204520061800210100001900828700001900847700001800866700001400884700001500898700001900913700001500932700001800947700001800965856003700983 2008 eng d00aHigh-sensitivity diamond magnetometer with nanoscale resolution0 aHighsensitivity diamond magnetometer with nanoscale resolution c2008/9/14 a810 - 8160 v43 aWe present a novel approach to the detection of weak magnetic fields that takes advantage of recently developed techniques for the coherent control of solid-state electron spin quantum bits. Specifically, we investigate a magnetic sensor based on Nitrogen-Vacancy centers in room-temperature diamond. We discuss two important applications of this technique: a nanoscale magnetometer that could potentially detect precession of single nuclear spins and an optical magnetic field imager combining spatial resolution ranging from micrometers to millimeters with a sensitivity approaching few femtotesla/Hz$^{1/2}$. 1 aTaylor, J., M.1 aCappellaro, P.1 aChildress, L.1 aJiang, L.1 aBudker, D.1 aHemmer, P., R.1 aYacoby, A.1 aWalsworth, R.1 aLukin, M., D. uhttp://arxiv.org/abs/0805.1367v101383nas a2200157 4500008004100000245010900041210006900150260001300219490000700232520085500239100002501094700002101119700002301140700002501163856003701188 2008 eng d00aPhoton storage in Lambda-type optically dense atomic media. IV. Optimal control using gradient ascent 0 aPhoton storage in Lambdatype optically dense atomic media IV Opt c2008/4/40 v773 a We use the numerical gradient ascent method from optimal control theory to extend efficient photon storage in Lambda-type media to previously inaccessible regimes and to provide simple intuitive explanations for our optimization techniques. In particular, by using gradient ascent to shape classical control pulses used to mediate photon storage, we open up the possibility of high efficiency photon storage in the non-adiabatic limit, in which analytical solutions to the equations of motion do not exist. This control shaping technique enables an order-of-magnitude increase in the bandwidth of the memory. We also demonstrate that the often discussed connection between time reversal and optimality in photon storage follows naturally from gradient ascent. Finally, we discuss the optimization of controlled reversible inhomogeneous broadening. 1 aGorshkov, Alexey, V.1 aCalarco, Tommaso1 aLukin, Mikhail, D.1 aSorensen, Anders, S. uhttp://arxiv.org/abs/0710.2698v201425nas a2200169 4500008004100000245006800041210006700109260001400176490000700190520091100197100002701108700001801135700001901153700002301172700002301195856003701218 2008 eng d00aTunneling phase gate for neutral atoms in a double-well lattice0 aTunneling phase gate for neutral atoms in a doublewell lattice c2008/5/120 v773 a We propose a new two--qubit phase gate for ultra--cold atoms confined in an experimentally realized tilted double--well optical lattice [Sebby--Strabley et al., Phys. Rev. A {\bf 73} 033605 (2006)]. Such a lattice is capable of confining pairs of atoms in a two--dimensional array of double--well potentials where control can be exercised over the barrier height and the energy difference of the minima of the two wells (known as the ``tilt''). The four lowest single--particle motional states consist of two pairs of motional states in which each pair is localized on one side of the central barrier, allowing for two atoms confined in such a lattice to be spatially separated qubits. We present a time--dependent scheme to manipulate the tilt to induce tunneling oscillations which produce a collisional phase gate. Numerical simulations demonstrate that this gate can be performed with high fidelity. 1 aStrauch, Frederick, W.1 aEdwards, Mark1 aTiesinga, Eite1 aWilliams, Carl, J.1 aClark, Charles, W. uhttp://arxiv.org/abs/0712.1856v100962nas a2200133 4500008004100000245005100041210005100092260001500143490000700158520059100165100001900756700001600775856003700791 2008 eng d00aWigner crystals of ions as quantum hard drives0 aWigner crystals of ions as quantum hard drives c2008/12/180 v783 aAtomic systems in regular lattices are intriguing systems for implementing ideas in quantum simulation and information processing. Focusing on laser cooled ions forming Wigner crystals in Penning traps, we find a robust and simple approach to engineering non-trivial 2-body interactions sufficient for universal quantum computation. We then consider extensions of our approach to the fast generation of large cluster states, and a non-local architecture using an asymmetric entanglement generation procedure between a Penning trap system and well-established linear Paul trap designs. 1 aTaylor, J., M.1 aCalarco, T. uhttp://arxiv.org/abs/0706.1951v100984nas a2200145 4500008004100000245009600041210006900137260001500206520048900221100002300710700002300733700001900756700001900775856004400794 2007 eng d00aEvery NAND formula of size N can be evaluated in time N^{1/2+o(1)} on a quantum computer 0 aEvery NAND formula of size N can be evaluated in time N 12o1 on c2007/03/023 a For every NAND formula of size N, there is a bounded-error N^{1/2+o(1)}-time quantum algorithm, based on a coined quantum walk, that evaluates this formula on a black-box input. Balanced, or ``approximately balanced,'' NAND formulas can be evaluated in O(sqrt{N}) queries, which is optimal. It follows that the (2-o(1))-th power of the quantum query complexity is a lower bound on the formula size, almost solving in the positive an open problem posed by Laplante, Lee and Szegedy. 1 aChilds, Andrew, M.1 aReichardt, Ben, W.1 aSpalek, Robert1 aZhang, Shengyu uhttp://arxiv.org/abs/quant-ph/0703015v301273nas a2200145 4500008004100000245009500041210006900136260001400205490000700219520078700226100002301013700002401036700002301060856004401083 2007 eng d00aImproved quantum algorithms for the ordered search problem via semidefinite programming 0 aImproved quantum algorithms for the ordered search problem via s c2007/3/260 v753 a One of the most basic computational problems is the task of finding a desired item in an ordered list of N items. While the best classical algorithm for this problem uses log_2 N queries to the list, a quantum computer can solve the problem using a constant factor fewer queries. However, the precise value of this constant is unknown. By characterizing a class of quantum query algorithms for ordered search in terms of a semidefinite program, we find new quantum algorithms for small instances of the ordered search problem. Extending these algorithms to arbitrarily large instances using recursion, we show that there is an exact quantum ordered search algorithm using 4 log_{605} N \approx 0.433 log_2 N queries, which improves upon the previously best known exact algorithm. 1 aChilds, Andrew, M.1 aLandahl, Andrew, J.1 aParrilo, Pablo, A. uhttp://arxiv.org/abs/quant-ph/0608161v101144nas a2200157 4500008004100000245005200041210004800093260001400141300001400155490000700169520070100176100002400877700002300901700001800924856004400942 2007 eng d00aThe limitations of nice mutually unbiased bases0 alimitations of nice mutually unbiased bases c2006/7/11 a111 - 1230 v253 a Mutually unbiased bases of a Hilbert space can be constructed by partitioning a unitary error basis. We consider this construction when the unitary error basis is a nice error basis. We show that the number of resulting mutually unbiased bases can be at most one plus the smallest prime power contained in the dimension, and therefore that this construction cannot improve upon previous approaches. We prove this by establishing a correspondence between nice mutually unbiased bases and abelian subgroups of the index group of a nice error basis and then bounding the number of such subgroups. This bound also has implications for the construction of certain combinatorial objects called nets. 1 aAschbacher, Michael1 aChilds, Andrew, M.1 aWocjan, Pawel uhttp://arxiv.org/abs/quant-ph/0412066v100857nas a2200145 4500008004100000245003400041210002900075260001500104520048200119100001800601700001800619700001700637700002000654856003700674 2007 eng d00aThe LU-LC conjecture is false0 aLULC conjecture is false c2007/09/093 a The LU-LC conjecture is an important open problem concerning the structure of entanglement of states described in the stabilizer formalism. It states that two local unitary equivalent stabilizer states are also local Clifford equivalent. If this conjecture were true, the local equivalence of stabilizer states would be extremely easy to characterize. Unfortunately, however, based on the recent progress made by Gross and Van den Nest, we find that the conjecture is false. 1 aJi, Zhengfeng1 aChen, Jianxin1 aWei, Zhaohui1 aYing, Mingsheng uhttp://arxiv.org/abs/0709.1266v200845nas a2200145 4500008004100000245003900041210003700080260001500117490000700132520042900139100001600568700002500584700001900609856007100628 2007 eng d00aN-representability is QMA-complete0 aNrepresentability is QMAcomplete c2007/03/160 v983 aWe study the computational complexity of the N-representability problem in quantum chemistry. We show that this problem is quantum Merlin-Arthur complete, which is the quantum generalization of nondeterministic polynomial time complete. Our proof uses a simple mapping from spin systems to fermionic systems, as well as a convex optimization technique that reduces the problem of finding ground states to N representability.1 aLiu, Yi-Kai1 aChristandl, Matthias1 aVerstraete, F. uhttp://journals.aps.org/prl/abstract/10.1103/PhysRevLett.98.11050301045nas a2200121 4500008004100000245006200041210006200103260001500165520066900180100002300849700001400872856003700886 2007 eng d00aOptimal quantum adversary lower bounds for ordered search0 aOptimal quantum adversary lower bounds for ordered search c2007/08/243 a The goal of the ordered search problem is to find a particular item in an ordered list of n items. Using the adversary method, Hoyer, Neerbek, and Shi proved a quantum lower bound for this problem of (1/pi) ln n + Theta(1). Here, we find the exact value of the best possible quantum adversary lower bound for a symmetrized version of ordered search (whose query complexity differs from that of the original problem by at most 1). Thus we show that the best lower bound for ordered search that can be proved by the adversary method is (1/pi) ln n + O(1). Furthermore, we show that this remains true for the generalized adversary method allowing negative weights. 1 aChilds, Andrew, M.1 aLee, Troy uhttp://arxiv.org/abs/0708.3396v100989nas a2200133 4500008004100000245005500041210005500096260001500151520057900166100002300745700002600768700002400794856003700818 2007 eng d00aQuantum algorithms for hidden nonlinear structures0 aQuantum algorithms for hidden nonlinear structures c2007/05/213 a Attempts to find new quantum algorithms that outperform classical computation have focused primarily on the nonabelian hidden subgroup problem, which generalizes the central problem solved by Shor's factoring algorithm. We suggest an alternative generalization, namely to problems of finding hidden nonlinear structures over finite fields. We give examples of two such problems that can be solved efficiently by a quantum computer, but not by a classical computer. We also give some positive results on the quantum query complexity of finding hidden nonlinear structures. 1 aChilds, Andrew, M.1 aSchulman, Leonard, J.1 aVazirani, Umesh, V. uhttp://arxiv.org/abs/0705.2784v101734nas a2200229 4500008004100000245006500041210006500106260001500171520102700186100002301213700002501236700002601261700002201287700002001309700002101329700002501350700003001375700002301405700001901428700002001447856003701467 2007 eng d00aSignatures of incoherence in a quantum information processor0 aSignatures of incoherence in a quantum information processor c2007/05/243 a Incoherent noise is manifest in measurements of expectation values when the underlying ensemble evolves under a classical distribution of unitary processes. While many incoherent processes appear decoherent, there are important differences. The distribution functions underlying incoherent processes are either static or slowly varying with respect to control operations and so the errors introduced by these distributions are refocusable. The observation and control of incoherence in small Hilbert spaces is well known. Here we explore incoherence during an entangling operation, such as is relevant in quantum information processing. As expected, it is more difficult to separate incoherence and decoherence over such processes. However, by studying the fidelity decay under a cyclic entangling map we are able to identify distinctive experimental signatures of incoherence. This result is demonstrated both through numerical simulations and experimentally in a three qubit nuclear magnetic resonance implementation. 1 aHenry, Michael, K.1 aGorshkov, Alexey, V.1 aWeinstein, Yaakov, S.1 aCappellaro, Paola1 aEmerson, Joseph1 aBoulant, Nicolas1 aHodges, Jonathan, S.1 aRamanathan, Chandrasekhar1 aHavel, Timothy, F.1 aMartinez, Rudy1 aCory, David, G. uhttp://arxiv.org/abs/0705.3666v201138nas a2200157 4500008004100000245007600041210006900117260001400186490000700200520065300207100001800860700001900878700002100897700001800918856004400936 2006 eng d00aFault-tolerant Quantum Communication with Minimal Physical Requirements0 aFaulttolerant Quantum Communication with Minimal Physical Requir c2006/2/230 v963 aWe describe a novel protocol for a quantum repeater which enables long distance quantum communication through realistic, lossy photonic channels. Contrary to previous proposals, our protocol incorporates active purification of arbitrary errors at each step of the protocol using only two qubits at each repeater station. Because of these minimal physical requirements, the present protocol can be realized in simple physical systems such as solid-state single photon emitters. As an example, we show how nitrogen vacancy color centers in diamond can be used to implement the protocol, using the nuclear and electronic spin to form the two qubits. 1 aChildress, L.1 aTaylor, J., M.1 aSorensen, A., S.1 aLukin, M., D. uhttp://arxiv.org/abs/quant-ph/0410123v301812nas a2200169 4500008004100000245010200041210006900143260001300212490000700225520125500232100002601487700002001513700001901533700002301552700002301575856004401598 2006 eng d00aMean-field treatment of the damping of the oscillations of a 1D Bose gas in an optical lattice 0 aMeanfield treatment of the damping of the oscillations of a 1D B c2006/1/90 v733 a We present a theoretical treatment of the surprisingly large damping observed recently in one-dimensional Bose-Einstein atomic condensates in optical lattices. We show that time-dependent Hartree-Fock-Bogoliubov (HFB) calculations can describe qualitatively the main features of the damping observed over a range of lattice depths. We also derive a formula of the fluctuation-dissipation type for the damping, based on a picture in which the coherent motion of the condensate atoms is disrupted as they try to flow through the random local potential created by the irregular motion of noncondensate atoms. We expect this irregular motion to result from the well-known dynamical instability exhibited by the mean-field theory for these systems. When parameters for the characteristic strength and correlation times of the fluctuations, obtained from the HFB calculations, are substituted in the damping formula, we find very good agreement with the experimentally-observed damping, as long as the lattice is shallow enough for the fraction of atoms in the Mott insulator phase to be negligible. We also include, for completeness, the results of other calculations based on the Gutzwiller ansatz, which appear to work better for the deeper lattices. 1 aGea-Banacloche, Julio1 aRey, Ana, Maria1 aPupillo, Guido1 aWilliams, Carl, J.1 aClark, Charles, W. uhttp://arxiv.org/abs/cond-mat/0410677v401217nas a2200169 4500008004100000245006000041210005800101260001500159300001400174490000600188520072400194100001900918700002000937700002300957700002300980856004401003 2006 eng d00aPseudo-fermionization of 1-D bosons in optical lattices0 aPseudofermionization of 1D bosons in optical lattices c2006/08/30 a161 - 1610 v83 a We present a model that generalizes the Bose-Fermi mapping for strongly correlated 1D bosons in an optical lattice, to cases in which the average number of atoms per site is larger than one. This model gives an accurate account of equilibrium properties of such systems, in parameter regimes relevant to current experiments. The application of this model to non-equilibrium phenomena is explored by a study of the dynamics of an atom cloud subject to a sudden displacement of the confining potential. Good agreement is found with results of recent experiments. The simplicity and intuitive appeal of this model make it attractive as a general tool for understanding bosonic systems in the strongly correlated regime. 1 aPupillo, Guido1 aRey, Ana, Maria1 aWilliams, Carl, J.1 aClark, Charles, W. uhttp://arxiv.org/abs/cond-mat/0505325v201338nas a2200157 4500008004100000245004300041210004200084260001500126300001200141490000700153520091300160100002301073700002201096700001801118856004401136 2006 eng d00aTwo-way quantum communication channels0 aTwoway quantum communication channels c2006/02/01 a63 - 830 v043 a We consider communication between two parties using a bipartite quantum operation, which constitutes the most general quantum mechanical model of two-party communication. We primarily focus on the simultaneous forward and backward communication of classical messages. For the case in which the two parties share unlimited prior entanglement, we give inner and outer bounds on the achievable rate region that generalize classical results due to Shannon. In particular, using a protocol of Bennett, Harrow, Leung, and Smolin, we give a one-shot expression in terms of the Holevo information for the entanglement-assisted one-way capacity of a two-way quantum channel. As applications, we rederive two known additivity results for one-way channel capacities: the entanglement-assisted capacity of a general one-way channel, and the unassisted capacity of an entanglement-breaking one-way channel. 1 aChilds, Andrew, M.1 aLeung, Debbie, W.1 aLo, Hoi-Kwong uhttp://arxiv.org/abs/quant-ph/0506039v101297nas a2200133 4500008004100000245009900041210006900140260001500209520083300224100002301057700002101080700001801101856004401119 2006 eng d00aWeak Fourier-Schur sampling, the hidden subgroup problem, and the quantum collision problem 0 aWeak FourierSchur sampling the hidden subgroup problem and the q c2006/09/143 a Schur duality decomposes many copies of a quantum state into subspaces labeled by partitions, a decomposition with applications throughout quantum information theory. Here we consider applying Schur duality to the problem of distinguishing coset states in the standard approach to the hidden subgroup problem. We observe that simply measuring the partition (a procedure we call weak Schur sampling) provides very little information about the hidden subgroup. Furthermore, we show that under quite general assumptions, even a combination of weak Fourier sampling and weak Schur sampling fails to identify the hidden subgroup. We also prove tight bounds on how many coset states are required to solve the hidden subgroup problem by weak Schur sampling, and we relate this question to a quantum version of the collision problem. 1 aChilds, Andrew, M.1 aHarrow, Aram, W.1 aWocjan, Pawel uhttp://arxiv.org/abs/quant-ph/0609110v101431nas a2200169 4500008004100000245007100041210006900112260001400181490000700195520091200202100002001114700001801134700001901152700002301171700002301194856004401217 2005 eng d00aBragg Spectroscopy of ultracold atoms loaded in an optical lattice0 aBragg Spectroscopy of ultracold atoms loaded in an optical latti c2005/8/120 v723 a We study Bragg spectroscopy of ultra-cold atoms in one-dimensional optical lattices as a method for probing the excitation spectrum in the Mott insulator phase, in particular the one particle-hole excitation band. Within the framework of perturbation theory we obtain an analytical expression for the dynamic structure factor $S(q,\omega)$ and use it to calculate the imparted energy which has shown to be a relevant observable in recent experiments. We test the accuracy of our approximations by comparing them with numerically exact solutions of the Bose-Hubbard model in restricted cases and establish the limits of validity of our linear response analysis. Finally we show that when the system is deep in the Mott insulator regime, its response to the Bragg perturbation is temperature dependent. We suggest that this dependence might be used as a tool to probe temperatures of order of the Mott gap. 1 aRey, Ana, Maria1 aBlakie, Blair1 aPupillo, Guido1 aWilliams, Carl, J.1 aClark, Charles, W. uhttp://arxiv.org/abs/cond-mat/0406552v201771nas a2200157 4500008004100000245012200041210006900163260001500232490000700247520123500254100002201489700001901511700002101530700001801551856004401569 2005 eng d00aFault-tolerant quantum repeaters with minimal physical resources, and implementations based on single photon emitters0 aFaulttolerant quantum repeaters with minimal physical resources c2005/11/280 v723 aWe analyze a novel method that uses fixed, minimal physical resources to achieve generation and nested purification of quantum entanglement for quantum communication over arbitrarily long distances, and discuss its implementation using realistic photon emitters and photonic channels. In this method, we use single photon emitters with two internal degrees of freedom formed by an electron spin and a nuclear spin to build intermediate nodes in a quantum channel. State-selective fluorescence is used for probabilistic entanglement generation between electron spins in adjacent nodes. We analyze in detail several approaches which are applicable to realistic, homogeneously broadened single photon emitters. Furthermore, the coupled electron and nuclear spins can be used to efficiently implement entanglement swapping and purification. We show that these techniques can be combined to generate high-fidelity entanglement over arbitrarily long distances. We present a specific protocol that functions in polynomial time and tolerates percent-level errors in entanglement fidelity and local operations. The scheme has the lowest requirements on physical resources of any current scheme for fully fault-tolerant quantum repeaters. 1 aChildress, L., I.1 aTaylor, J., M.1 aSorensen, A., S.1 aLukin, M., D. uhttp://arxiv.org/abs/quant-ph/0502112v101370nas a2200133 4500008004100000245012700041210006900168260001500237520088400252100001601136700002301152700001701175856004401192 2005 eng d00aFrom optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups 0 aFrom optimal measurement to efficient quantum algorithms for the c2005/04/113 a We approach the hidden subgroup problem by performing the so-called pretty good measurement on hidden subgroup states. For various groups that can be expressed as the semidirect product of an abelian group and a cyclic group, we show that the pretty good measurement is optimal and that its probability of success and unitary implementation are closely related to an average-case algebraic problem. By solving this problem, we find efficient quantum algorithms for a number of nonabelian hidden subgroup problems, including some for which no efficient algorithm was previously known: certain metacyclic groups as well as all groups of the form (Z_p)^r X| Z_p for fixed r (including the Heisenberg group, r=2). In particular, our results show that entangled measurements across multiple copies of hidden subgroup states can be useful for efficiently solving the nonabelian HSP. 1 aBacon, Dave1 aChilds, Andrew, M.1 avan Dam, Wim uhttp://arxiv.org/abs/quant-ph/0504083v201943nas a2200133 4500008004100000245006600041210006600107260001500173520152100188100001601709700002301725700001701748856004401765 2005 eng d00aOptimal measurements for the dihedral hidden subgroup problem0 aOptimal measurements for the dihedral hidden subgroup problem c2005/01/103 a We consider the dihedral hidden subgroup problem as the problem of distinguishing hidden subgroup states. We show that the optimal measurement for solving this problem is the so-called pretty good measurement. We then prove that the success probability of this measurement exhibits a sharp threshold as a function of the density nu=k/log N, where k is the number of copies of the hidden subgroup state and 2N is the order of the dihedral group. In particular, for nu<1 the optimal measurement (and hence any measurement) identifies the hidden subgroup with a probability that is exponentially small in log N, while for nu>1 the optimal measurement identifies the hidden subgroup with a probability of order unity. Thus the dihedral group provides an example of a group G for which Omega(log|G|) hidden subgroup states are necessary to solve the hidden subgroup problem. We also consider the optimal measurement for determining a single bit of the answer, and show that it exhibits the same threshold. Finally, we consider implementing the optimal measurement by a quantum circuit, and thereby establish further connections between the dihedral hidden subgroup problem and average case subset sum problems. In particular, we show that an efficient quantum algorithm for a restricted version of the optimal measurement would imply an efficient quantum algorithm for the subset sum problem, and conversely, that the ability to quantum sample from subset sum solutions allows one to implement the optimal measurement. 1 aBacon, Dave1 aChilds, Andrew, M.1 avan Dam, Wim uhttp://arxiv.org/abs/quant-ph/0501044v201092nas a2200121 4500008004100000245006100041210006100102260001500163520070800178100002300886700001700909856004400926 2005 eng d00aQuantum algorithm for a generalized hidden shift problem0 aQuantum algorithm for a generalized hidden shift problem c2005/07/193 a Consider the following generalized hidden shift problem: given a function f on {0,...,M-1} x Z_N satisfying f(b,x)=f(b+1,x+s) for b=0,1,...,M-2, find the unknown shift s in Z_N. For M=N, this problem is an instance of the abelian hidden subgroup problem, which can be solved efficiently on a quantum computer, whereas for M=2, it is equivalent to the dihedral hidden subgroup problem, for which no efficient algorithm is known. For any fixed positive epsilon, we give an efficient (i.e., poly(log N)) quantum algorithm for this problem provided M > N^epsilon. The algorithm is based on the "pretty good measurement" and uses H. Lenstra's (classical) algorithm for integer programming as a subroutine. 1 aChilds, Andrew, M.1 avan Dam, Wim uhttp://arxiv.org/abs/quant-ph/0507190v101105nas a2200121 4500008004100000245009900041210006900140260001500209520067400224100002300898700001800921856004400939 2005 eng d00aOn the quantum hardness of solving isomorphism problems as nonabelian hidden shift problems 0 aquantum hardness of solving isomorphism problems as nonabelian h c2005/10/253 a We consider an approach to deciding isomorphism of rigid n-vertex graphs (and related isomorphism problems) by solving a nonabelian hidden shift problem on a quantum computer using the standard method. Such an approach is arguably more natural than viewing the problem as a hidden subgroup problem. We prove that the hidden shift approach to rigid graph isomorphism is hard in two senses. First, we prove that Omega(n) copies of the hidden shift states are necessary to solve the problem (whereas O(n log n) copies are sufficient). Second, we prove that if one is restricted to single-register measurements, an exponential number of hidden shift states are required. 1 aChilds, Andrew, M.1 aWocjan, Pawel uhttp://arxiv.org/abs/quant-ph/0510185v101428nas a2200181 4500008004100000245008400041210006900125260001500194300001600209490000700225520086200232100002301094700001901117700002001136700002301156700002301179856004401202 2005 eng d00aScalable register initialization for quantum computing in an optical lattice 0 aScalable register initialization for quantum computing in an opt c2005/06/14 a1687 - 16940 v383 a The Mott insulator state created by loading an atomic Bose-Einstein condensate (BEC) into an optical lattice may be used as a means to prepare a register of atomic qubits in a quantum computer. Such architecture requires a lattice commensurately filled with atoms, which corresponds to the insulator state only in the limit of zero inter-well tunneling. We show that a lattice with spatial inhomogeneity created by a quadratic magnetic trapping potential can be used to isolate a subspace in the center which is impervious to hole-hoping. Components of the wavefunction with more than one atom in any well can be projected out by selective measurement on a molecular photo-associative transition. Maintaining the molecular coupling induces a quantum Zeno effect that can sustain a commensurately filled register for the duration of a quantum computation. 1 aBrennen, Gavin, K.1 aPupillo, Guido1 aRey, Ana, Maria1 aClark, Charles, W.1 aWilliams, Carl, J. uhttp://arxiv.org/abs/quant-ph/0312069v101196nas a2200217 4500008004100000245005900041210005800100260001500158490000700173520059700180100001100777700001200788700002300800700001800823700001700841700001900858700001700877700002100894700001900915856004400934 2005 eng d00aSodium Bose-Einstein Condensates in an Optical Lattice0 aSodium BoseEinstein Condensates in an Optical Lattice c2005/10/100 v723 a The phase transition from a superfluid to a Mott insulator has been observed in a $^{23}$Na Bose-Einstein condensate. A dye laser detuned $\approx 5$nm red of the Na $3^2$S$ \to 3^2$P$_{1/2}$ transition was used to form the three dimensional optical lattice. The heating effects of the small detuning as well as the three-body decay processes constrained the timescale of the experiment. Certain lattice detunings were found to induce a large loss of atoms. These loss features were shown to be due to photoassociation of atoms to vibrational levels in the Na$_2$ $(1) ^3\Sigma_g^+$ state. 1 aXu, K.1 aLiu, Y.1 aAbo-Shaeer, J., R.1 aMukaiyama, T.1 aChin, J., K.1 aMiller, D., E.1 aKetterle, W.1 aJones, Kevin, M.1 aTiesinga, Eite uhttp://arxiv.org/abs/cond-mat/0507288v101494nas a2200157 4500008004100000245010300041210006900144260001400213490000700227520097300234100002001207700001901227700002301246700002301269856004401292 2005 eng d00aUltracold atoms confined in an optical lattice plus parabolic potential: a closed-form approach 0 aUltracold atoms confined in an optical lattice plus parabolic po c2005/9/220 v723 a We discuss interacting and non-interacting one dimensional atomic systems trapped in an optical lattice plus a parabolic potential. We show that, in the tight-binding approximation, the non-interacting problem is exactly solvable in terms of Mathieu functions. We use the analytic solutions to study the collective oscillations of ideal bosonic and fermionic ensembles induced by small displacements of the parabolic potential. We treat the interacting boson problem by numerical diagonalization of the Bose-Hubbard Hamiltonian. From analysis of the dependence upon lattice depth of the low-energy excitation spectrum of the interacting system, we consider the problems of "fermionization" of a Bose gas, and the superfluid-Mott insulator transition. The spectrum of the noninteracting system turns out to provide a useful guide to understanding the collective oscillations of the interacting system, throughout a large and experimentally relevant parameter regime. 1 aRey, Ana, Maria1 aPupillo, Guido1 aClark, Charles, W.1 aWilliams, Carl, J. uhttp://arxiv.org/abs/cond-mat/0503477v201341nas a2200145 4500008004100000245007700041210006900118260001400187490000700201520087300208100002301081700002201104700002501126856004401151 2005 eng d00aUnified derivations of measurement-based schemes for quantum computation0 aUnified derivations of measurementbased schemes for quantum comp c2005/3/170 v713 a We present unified, systematic derivations of schemes in the two known measurement-based models of quantum computation. The first model (introduced by Raussendorf and Briegel [Phys. Rev. Lett., 86, 5188 (2001)]) uses a fixed entangled state, adaptive measurements on single qubits, and feedforward of the measurement results. The second model (proposed by Nielsen [Phys. Lett. A, 308, 96 (2003)] and further simplified by Leung [Int. J. Quant. Inf., 2, 33 (2004)]) uses adaptive two-qubit measurements that can be applied to arbitrary pairs of qubits, and feedforward of the measurement results. The underlying principle of our derivations is a variant of teleportation introduced by Zhou, Leung, and Chuang [Phys. Rev. A, 62, 052316 (2000)]. Our derivations unify these two measurement-based models of quantum computation and provide significantly simpler schemes. 1 aChilds, Andrew, M.1 aLeung, Debbie, W.1 aNielsen, Michael, A. uhttp://arxiv.org/abs/quant-ph/0404132v200922nas a2200157 4500008004100000245009800041210006900139260001500208520039600223100002100619700002300640700002300663700001900686700001500705856004400720 2004 eng d00aAdvantages of high-speed technique for quantum key distribution; reply to quant-ph/0407050 0 aAdvantages of highspeed technique for quantum key distribution r c2004/07/183 a We respond to a comment on our high-speed technique for the implementation of free-space quantum key distribution (QKD). The model used in the comment assigns inappropriately high link losses to the technique in question. We show that the use of reasonable loss parameters in the model invalidates the comment's main conclusion and highlights the benefits of increased transmission rates. 1 aBienfang, J., C.1 aClark, Charles, W.1 aWilliams, Carl, J.1 aHagley, E., W.1 aWen, Jesse uhttp://arxiv.org/abs/quant-ph/0407139v101230nas a2200193 4500008004100000245007800041210006900119260001500188520065600203100001900859700001500878700001500893700001600908700001800924700001500942700001800957700001700975856004400992 2004 eng d00aQuantum information processing using localized ensembles of nuclear spins0 aQuantum information processing using localized ensembles of nucl c2004/07/233 aWe describe a technique for quantum information processing based on localized en sembles of nuclear spins. A qubit is identified as the presence or absence of a collective excitation of a mesoscopic ensemble of nuclear spins surrounding a single quantum dot. All single and two-qubit operations can be effected using hyperfine interactions and single-electron spin rotations, hence the proposed scheme avoids gate errors arising from entanglement between spin and orbital degrees of freedom. Ultra-long coherence times of nuclear spins suggest that this scheme could be particularly well suited for applications where long lived memory is essential. 1 aTaylor, J., M.1 aGiedke, G.1 aChrist, H.1 aParedes, B.1 aCirac, J., I.1 aZoller, P.1 aLukin, M., D.1 aImamoglu, A. uhttp://arxiv.org/abs/cond-mat/0407640v201386nas a2200265 4500008004100000245006600041210006500107260001500172300000900187490000700196520066500203100002100868700001800889700001300907700002100920700001700941700001300958700001100971700001500982700002200997700002301019700001901042700001501061856004401076 2004 eng d00aQuantum key distribution with 1.25 Gbps clock synchronization0 aQuantum key distribution with 125 Gbps clock synchronization c2004/05/17 a20110 v123 a We have demonstrated the exchange of sifted quantum cryptographic key over a 730 meter free-space link at rates of up to 1.0 Mbps, two orders of magnitude faster than previously reported results. A classical channel at 1550 nm operates in parallel with a quantum channel at 845 nm. Clock recovery techniques on the classical channel at 1.25 Gbps enable quantum transmission at up to the clock rate. System performance is currently limited by the timing resolution of our silicon avalanche photodiode detectors. With improved detector resolution, our technique will yield another order of magnitude increase in performance, with existing technology. 1 aBienfang, J., C.1 aGross, A., J.1 aMink, A.1 aHershman, B., J.1 aNakassis, A.1 aTang, X.1 aLu, R.1 aSu, D., H.1 aClark, Charles, W1 aWilliams, Carl, J.1 aHagley, E., W.1 aWen, Jesse uhttp://arxiv.org/abs/quant-ph/0405097v101193nas a2200145 4500008004100000245012200041210006900163260001400232490000700246520068300253100002200936700002300958700002300981856004301004 2004 eng d00aRelativistic many-body calculations of electric-dipole matrix elements, lifetimes and polarizabilities in rubidium 0 aRelativistic manybody calculations of electricdipole matrix elem c2004/2/270 v693 a Electric-dipole matrix elements for ns-n'p, nd-n'p, and 6d-4f transitions in Rb are calculated using a relativistic all-order method. A third-order calculation is also carried out for these matrix elements to evaluate the importance of the high-order many-body perturbation theory contributions. The all-order matrix elements are used to evaluate lifetimes of ns and np levels with n=6, 7, 8 and nd levels with n=4, 5, 6 for comparison with experiment and to provide benchmark values for these lifetimes. The dynamic polarizabilities are calculated for ns states of rubidium. The resulting lifetime and polarizability values are compared with available theory and experiment. 1 aSafronova, M., S.1 aWilliams, Carl, J.1 aClark, Charles, W. uhttp://arxiv.org/abs/physics/0307057v101270nas a2200157 4500008004100000245006000041210006000101260001500161300001600176490000700192520080600199100002301005700002201028700001801050856004401068 2004 eng d00aReversible simulation of bipartite product Hamiltonians0 aReversible simulation of bipartite product Hamiltonians c2004/06/01 a1189 - 11970 v503 a Consider two quantum systems A and B interacting according to a product Hamiltonian H = H_A x H_B. We show that any two such Hamiltonians can be used to simulate each other reversibly (i.e., without efficiency losses) with the help of local unitary operations and local ancillas. Accordingly, all non-local features of a product Hamiltonian -- including the rate at which it can be used to produce entanglement, transmit classical or quantum information, or simulate other Hamiltonians -- depend only upon a single parameter. We identify this parameter and use it to obtain an explicit expression for the entanglement capacity of all product Hamiltonians. Finally, we show how the notion of simulation leads to a natural formulation of measures of the strength of a nonlocal Hamiltonian. 1 aChilds, Andrew, M.1 aLeung, Debbie, W.1 aVidal, Guifre uhttp://arxiv.org/abs/quant-ph/0303097v101546nas a2200181 4500008004100000245007100041210006900112260001500181300001600196490000700212520099700219100001901216700002001235700001901255700002301274700002301297856004401320 2004 eng d00aScalable quantum computation in systems with Bose-Hubbard dynamics0 aScalable quantum computation in systems with BoseHubbard dynamic c2004/02/15 a2395 - 24040 v513 a Several proposals for quantum computation utilize a lattice type architecture with qubits trapped by a periodic potential. For systems undergoing many body interactions described by the Bose-Hubbard Hamiltonian, the ground state of the system carries number fluctuations that scale with the number of qubits. This process degrades the initialization of the quantum computer register and can introduce errors during error correction. In an earlier manuscript we proposed a solution to this problem tailored to the loading of cold atoms into an optical lattice via the Mott Insulator phase transition. It was shown that by adding an inhomogeneity to the lattice and performing a continuous measurement, the unit filled state suitable for a quantum computer register can be maintained. Here, we give a more rigorous derivation of the register fidelity in homogeneous and inhomogeneous lattices and provide evidence that the protocol is effective in the finite temperature regime. 1 aPupillo, Guido1 aRey, Ana, Maria1 aBrennen, Gavin1 aWilliams, Carl, J.1 aClark, Charles, W. uhttp://arxiv.org/abs/quant-ph/0403052v200967nas a2200133 4500008004100000245004200041210004200083260001500125490000700140520059600147100002300743700002300766856004400789 2004 eng d00aSpatial search and the Dirac equation0 aSpatial search and the Dirac equation c2004/10/190 v703 a We consider the problem of searching a d-dimensional lattice of N sites for a single marked location. We present a Hamiltonian that solves this problem in time of order sqrt(N) for d>2 and of order sqrt(N) log(N) in the critical dimension d=2. This improves upon the performance of our previous quantum walk search algorithm (which has a critical dimension of d=4), and matches the performance of a corresponding discrete-time quantum walk algorithm. The improvement uses a lattice version of the Dirac Hamiltonian, and thus requires the introduction of spin (or coin) degrees of freedom. 1 aChilds, Andrew, M.1 aGoldstone, Jeffrey uhttp://arxiv.org/abs/quant-ph/0405120v101263nas a2200133 4500008004100000245003500041210003500076260001400111490000700125520090700132100002301039700002301062856004401085 2004 eng d00aSpatial search by quantum walk0 aSpatial search by quantum walk c2004/8/230 v703 a Grover's quantum search algorithm provides a way to speed up combinatorial search, but is not directly applicable to searching a physical database. Nevertheless, Aaronson and Ambainis showed that a database of N items laid out in d spatial dimensions can be searched in time of order sqrt(N) for d>2, and in time of order sqrt(N) poly(log N) for d=2. We consider an alternative search algorithm based on a continuous time quantum walk on a graph. The case of the complete graph gives the continuous time search algorithm of Farhi and Gutmann, and other previously known results can be used to show that sqrt(N) speedup can also be achieved on the hypercube. We show that full sqrt(N) speedup can be achieved on a d-dimensional periodic lattice for d>4. In d=4, the quantum walk search algorithm takes time of order sqrt(N) poly(log N), and in d<4, the algorithm does not provide substantial speedup. 1 aChilds, Andrew, M.1 aGoldstone, Jeffrey uhttp://arxiv.org/abs/quant-ph/0306054v201370nas a2200193 4500008004100000245007200041210006900113260001500182300001400197490000700211520079400218100002001012700001901032700001701051700001801068700002301086700002301109856004401132 2003 eng d00aBogoliubov approach to superfluidity of atoms in an optical lattice0 aBogoliubov approach to superfluidity of atoms in an optical latt c2003/03/14 a825 - 8410 v363 a We use the Bogoliubov theory of atoms in an optical lattice to study the approach to the Mott-insulator transition. We derive an explicit expression for the superfluid density based on the rigidity of the system under phase variations. This enables us to explore the connection between the quantum depletion of the condensate and the quasi-momentum distribution on the one hand and the superfluid fraction on the other. The approach to the insulator phase may be characterized through the filling of the band by quantum depletion, which should be directly observable via the matter wave interference patterns. We complement these findings by self-consistent Hartree-Fock-Bogoliubov-Popov calculations for one-dimensional lattices including the effects of a parabolic trapping potential. 1 aRey, Ana, Maria1 aBurnett, Keith1 aRoth, Robert1 aEdwards, Mark1 aWilliams, Carl, J.1 aClark, Charles, W. uhttp://arxiv.org/abs/cond-mat/0210550v200715nas a2200145 4500008004100000245006300041210006300104260001500167490000700182520026200189100002300451700002600474700002500500856004400525 2003 eng d00aLower bounds on the complexity of simulating quantum gates0 aLower bounds on the complexity of simulating quantum gates c2003/11/180 v683 a We give a simple proof of a formula for the minimal time required to simulate a two-qubit unitary operation using a fixed two-qubit Hamiltonian together with fast local unitaries. We also note that a related lower bound holds for arbitrary n-qubit gates. 1 aChilds, Andrew, M.1 aHaselgrove, Henry, L.1 aNielsen, Michael, A. uhttp://arxiv.org/abs/quant-ph/0307190v101061nas a2200145 4500008004100000245004500041210004500086260001400131490000700145520065100152100002200803700002300825700002300848856004400871 2003 eng d00aOptimizing the fast Rydberg quantum gate0 aOptimizing the fast Rydberg quantum gate c2003/4/170 v673 a The fast phase gate scheme, in which the qubits are atoms confined in sites of an optical lattice, and gate operations are mediated by excitation of Rydberg states, was proposed by Jaksch et al. Phys. Rev. Lett. 85, 2208 (2000). A potential source of decoherence in this system derives from motional heating, which occurs if the ground and Rydberg states of the atom move in different optical lattice potentials. We propose to minimize this effect by choosing the lattice photon frequency \omega so that the ground and Rydberg states have the same frequency-dependent polarizability \alpha(omega). The results are presented for the case of Rb. 1 aSafronova, M., S.1 aWilliams, Carl, J.1 aClark, Charles, W. uhttp://arxiv.org/abs/quant-ph/0212081v101268nas a2200121 4500008004100000245004200041210004200083260001500125520091400140100002301054700002501077856004401102 2003 eng d00aQuantum algorithms for subset finding0 aQuantum algorithms for subset finding c2003/11/063 a Recently, Ambainis gave an O(N^(2/3))-query quantum walk algorithm for element distinctness, and more generally, an O(N^(L/(L+1)))-query algorithm for finding L equal numbers. We point out that this algorithm actually solves a much more general problem, the problem of finding a subset of size L that satisfies any given property. We review the algorithm and give a considerably simplified analysis of its query complexity. We present several applications, including two algorithms for the problem of finding an L-clique in an N-vertex graph. One of these algorithms uses O(N^(2L/(L+1))) edge queries, and the other uses \tilde{O}(N^((5L-2)/(2L+4))), which is an improvement for L <= 5. The latter algorithm generalizes a recent result of Magniez, Santha, and Szegedy, who considered the case L=3 (finding a triangle). We also pose two open problems regarding continuous time quantum walk and lower bounds. 1 aChilds, Andrew, M.1 aEisenberg, Jason, M. uhttp://arxiv.org/abs/quant-ph/0311038v201384nas a2200181 4500008004100000245004300041210004000084260001500124520088400139100001601023700002001039700002301059700001601082700001901098700001801117700002301135856004401158 2003 eng d00aUltracold Cs$_2$ Feshbach Spectroscopy0 aUltracold Cs2 Feshbach Spectroscopy c2003/12/233 a We have observed and located more than 60 magnetic field-induced Feshbach resonances in ultracold collisions of ground-state $^{133}$Cs atoms. These resonances are associated with molecular states with up to four units of rotational angular momentum, and are detected through variations in the elastic, inelastic, and radiative collision cross sections. These observations allow us to greatly improve upon the interaction potentials between two cesium atoms and to reproduce the positions of most resonances to accuracies better than 0.5%. Based on the relevant coupling scheme between the electron spin, nuclear spin, and orbital angular momenta of the nuclei, quantum numbers and energy structure of the molecular states beneath the dissociation continuum are revealed. Finally, we predict the relevant collision properties for cesium Bose-Einstein condensation experiments. 1 aChin, Cheng1 aVuletic, Vladan1 aKerman, Andrew, J.1 aChu, Steven1 aTiesinga, Eite1 aLeo, Paul, J.1 aWilliams, Carl, J. uhttp://arxiv.org/abs/cond-mat/0312613v200853nas a2200145 4500008004100000245009300041210006900134260001500203520037100218100002300589700001800612700001900630700001400649856004400663 2002 eng d00aAsymptotic entanglement capacity of the Ising and anisotropic Heisenberg interactions 0 aAsymptotic entanglement capacity of the Ising and anisotropic He c2002/07/103 a We compute the asymptotic entanglement capacity of the Ising interaction ZZ, the anisotropic Heisenberg interaction XX + YY, and more generally, any two-qubit Hamiltonian with canonical form K = a XX + b YY. We also describe an entanglement assisted classical communication protocol using the Hamiltonian K with rate equal to the asymptotic entanglement capacity. 1 aChilds, Andrew, M.1 aLeung, D., W.1 aVerstraete, F.1 aVidal, G. uhttp://arxiv.org/abs/quant-ph/0207052v201116nas a2200157 4500008004100000245008100041210006900122260001500191300001600206490000700222520063100229100001700860700001700877700002000894856004400914 2002 eng d00aCharacterizing quantum theory in terms of information-theoretic constraints0 aCharacterizing quantum theory in terms of informationtheoretic c c2003/11/01 a1561 - 15910 v333 a We show that three fundamental information-theoretic constraints--the impossibility of superluminal information transfer between two physical systems by performing measurements on one of them, the impossibility of broadcasting the information contained in an unknown physical state, and the impossibility of unconditionally secure bit commitment--suffice to entail that the observables and state space of a physical theory are quantum-mechanical. We demonstrate the converse derivation in part, and consider the implications of alternative answers to a remaining open question about nonlocality and bit commitment. 1 aClifton, Rob1 aBub, Jeffrey1 aHalvorson, Hans uhttp://arxiv.org/abs/quant-ph/0211089v201113nas a2200169 4500008004100000245005200041210005200093260001500145520061800160100002300778700001900801700001900820700001800839700001700857700002500874856004400899 2002 eng d00aExponential algorithmic speedup by quantum walk0 aExponential algorithmic speedup by quantum walk c2002/09/243 a We construct an oracular (i.e., black box) problem that can be solved exponentially faster on a quantum computer than on a classical computer. The quantum algorithm is based on a continuous time quantum walk, and thus employs a different technique from previous quantum algorithms based on quantum Fourier transforms. We show how to implement the quantum walk efficiently in our oracular setting. We then show how this quantum walk can be used to solve our problem by rapidly traversing a graph. Finally, we prove that no classical algorithm can solve this problem with high probability in subexponential time. 1 aChilds, Andrew, M.1 aCleve, Richard1 aDeotto, Enrico1 aFarhi, Edward1 aGutmann, Sam1 aSpielman, Daniel, A. uhttp://arxiv.org/abs/quant-ph/0209131v201071nas a2200181 4500008004100000245003400041210003400075260001400109490000700123520059100130100002300721700001900744700001800763700002300781700001700804700002400821856004400845 2002 eng d00aQuantum search by measurement0 aQuantum search by measurement c2002/9/230 v663 a We propose a quantum algorithm for solving combinatorial search problems that uses only a sequence of measurements. The algorithm is similar in spirit to quantum computation by adiabatic evolution, in that the goal is to remain in the ground state of a time-varying Hamiltonian. Indeed, we show that the running times of the two algorithms are closely related. We also show how to achieve the quadratic speedup for Grover's unstructured search problem with only two measurements. Finally, we discuss some similarities and differences between the adiabatic and measurement algorithms. 1 aChilds, Andrew, M.1 aDeotto, Enrico1 aFarhi, Edward1 aGoldstone, Jeffrey1 aGutmann, Sam1 aLandahl, Andrew, J. uhttp://arxiv.org/abs/quant-ph/0204013v101113nas a2200169 4500008004100000245006000041210006000101260001400161490000700175520059300182100002500775700002500800700002300825700002300848700002800871856004400899 2002 eng d00aUniversal simulation of Hamiltonian dynamics for qudits0 aUniversal simulation of Hamiltonian dynamics for qudits c2002/8/300 v663 a What interactions are sufficient to simulate arbitrary quantum dynamics in a composite quantum system? Dodd et al. (quant-ph/0106064) provided a partial solution to this problem in the form of an efficient algorithm to simulate any desired two-body Hamiltonian evolution using any fixed two-body entangling N-qubit Hamiltonian, and local unitaries. We extend this result to the case where the component systems have D dimensions. As a consequence we explain how universal quantum computation can be performed with any fixed two-body entangling N-qudit Hamiltonian, and local unitaries. 1 aNielsen, Michael, A.1 aBremner, Michael, J.1 aDodd, Jennifer, L.1 aChilds, Andrew, M.1 aDawson, Christopher, M. uhttp://arxiv.org/abs/quant-ph/0109064v201212nas a2200145 4500008004100000245007400041210006900115260001400184490000700198520074500205100002300950700002400973700002500997856004401022 2001 eng d00aExact sampling from non-attractive distributions using summary states0 aExact sampling from nonattractive distributions using summary st c2001/2/220 v633 a Propp and Wilson's method of coupling from the past allows one to efficiently generate exact samples from attractive statistical distributions (e.g., the ferromagnetic Ising model). This method may be generalized to non-attractive distributions by the use of summary states, as first described by Huber. Using this method, we present exact samples from a frustrated antiferromagnetic triangular Ising model and the antiferromagnetic q=3 Potts model. We discuss the advantages and limitations of the method of summary states for practical sampling, paying particular attention to the slowing down of the algorithm at low temperature. In particular, we show that such a slowing down can occur in the absence of a physical phase transition. 1 aChilds, Andrew, M.1 aPatterson, Ryan, B.1 aMacKay, David, J. C. uhttp://arxiv.org/abs/cond-mat/0005132v100814nas a2200157 4500008004100000245007600041210006900117260001500186300001200201490000600213520033500219100002300554700001800577700001700595856004400612 2001 eng d00aAn example of the difference between quantum and classical random walks0 aexample of the difference between quantum and classical random w c2002/04/01 a35 - 430 v13 a In this note, we discuss a general definition of quantum random walks on graphs and illustrate with a simple graph the possibility of very different behavior between a classical random walk and its quantum analogue. In this graph, propagation between a particular pair of nodes is exponentially faster in the quantum case. 1 aChilds, Andrew, M.1 aFarhi, Edward1 aGutmann, Sam uhttp://arxiv.org/abs/quant-ph/0103020v101006nas a2200145 4500008004100000245005300041210005300094260001400147490000700161520058100168100002300749700002200772700002200794856004400816 2001 eng d00aRealization of quantum process tomography in NMR0 aRealization of quantum process tomography in NMR c2001/6/130 v643 a Quantum process tomography is a procedure by which the unknown dynamical evolution of an open quantum system can be fully experimentally characterized. We demonstrate explicitly how this procedure can be implemented with a nuclear magnetic resonance quantum computer. This allows us to measure the fidelity of a controlled-not logic gate and to experimentally investigate the error model for our computer. Based on the latter analysis, we test an important assumption underlying nearly all models of quantum error correction, the independence of errors on different qubits. 1 aChilds, Andrew, M.1 aChuang, Isaac, L.1 aLeung, Debbie, W. uhttp://arxiv.org/abs/quant-ph/0012032v100767nas a2200145 4500008004100000245004800041210004800089260001500137490000700152520035800159100002300517700001800540700001900558856004400577 2001 eng d00aRobustness of adiabatic quantum computation0 aRobustness of adiabatic quantum computation c2001/12/140 v653 a We study the fault tolerance of quantum computation by adiabatic evolution, a quantum algorithm for solving various combinatorial search problems. We describe an inherent robustness of adiabatic computation against two kinds of errors, unitary control errors and decoherence, and we study this robustness using numerical simulations of the algorithm. 1 aChilds, Andrew, M.1 aFarhi, Edward1 aPreskill, John uhttp://arxiv.org/abs/quant-ph/0108048v100953nas a2200109 4500008004100000245004000041210004000081260001500121520064000136100002300776856004400799 2001 eng d00aSecure assisted quantum computation0 aSecure assisted quantum computation c2001/11/073 a Suppose Alice wants to perform some computation that could be done quickly on a quantum computer, but she cannot do universal quantum computation. Bob can do universal quantum computation and claims he is willing to help, but Alice wants to be sure that Bob cannot learn her input, the result of her calculation, or perhaps even the function she is trying to compute. We describe a simple, efficient protocol by which Bob can help Alice perform the computation, but there is no way for him to learn anything about it. We also discuss techniques for Alice to detect whether Bob is honestly helping her or if he is introducing errors. 1 aChilds, Andrew, M. uhttp://arxiv.org/abs/quant-ph/0111046v201258nas a2200181 4500008004100000245005500041210005500096260001400151490000700165520074300172100001600915700002300931700002200954700001700976700002200993700001701015856004401032 2001 eng d00aUniversal simulation of Markovian quantum dynamics0 aUniversal simulation of Markovian quantum dynamics c2001/11/90 v643 a Although the conditions for performing arbitrary unitary operations to simulate the dynamics of a closed quantum system are well understood, the same is not true of the more general class of quantum operations (also known as superoperators) corresponding to the dynamics of open quantum systems. We propose a framework for the generation of Markovian quantum dynamics and study the resources needed for universality. For the case of a single qubit, we show that a single nonunitary process is necessary and sufficient to generate all unital Markovian quantum dynamics, whereas a set of processes parametrized by one continuous parameter is needed in general. We also obtain preliminary results for the unital case in higher dimensions. 1 aBacon, Dave1 aChilds, Andrew, M.1 aChuang, Isaac, L.1 aKempe, Julia1 aLeung, Debbie, W.1 aZhou, Xinlan uhttp://arxiv.org/abs/quant-ph/0008070v201120nas a2200145 4500008004100000245005100041210005100092260001500143520069100158100002300849700001800872700002300890700001700913856004400930 2000 eng d00aFinding cliques by quantum adiabatic evolution0 aFinding cliques by quantum adiabatic evolution c2000/12/193 a Quantum adiabatic evolution provides a general technique for the solution of combinatorial search problems on quantum computers. We present the results of a numerical study of a particular application of quantum adiabatic evolution, the problem of finding the largest clique in a random graph. An n-vertex random graph has each edge included with probability 1/2, and a clique is a completely connected subgraph. There is no known classical algorithm that finds the largest clique in a random graph with high probability and runs in a time polynomial in n. For the small graphs we are able to investigate (n <= 18), the quantum algorithm appears to require only a quadratic run time. 1 aChilds, Andrew, M.1 aFarhi, Edward1 aGoldstone, Jeffrey1 aGutmann, Sam uhttp://arxiv.org/abs/quant-ph/0012104v101129nas a2200157 4500008004100000245005000041210005000091260001500141300001400156490000700170520069000177100002300867700001900890700001800909856004400927 2000 eng d00aQuantum information and precision measurement0 aQuantum information and precision measurement c1999/04/07 a155 - 1760 v473 a We describe some applications of quantum information theory to the analysis of quantum limits on measurement sensitivity. A measurement of a weak force acting on a quantum system is a determination of a classical parameter appearing in the master equation that governs the evolution of the system; limitations on measurement accuracy arise because it is not possible to distinguish perfectly among the different possible values of this parameter. Tools developed in the study of quantum information and computation can be exploited to improve the precision of physics experiments; examples include superdense coding, fast database search, and the quantum Fourier transform. 1 aChilds, Andrew, M.1 aPreskill, John1 aRenes, Joseph uhttp://arxiv.org/abs/quant-ph/9904021v200976nas a2200133 4500008004100000245006200041210006100103260001500164490000700179520056700186100002300753700002200776856004400798 2000 eng d00aUniversal quantum computation with two-level trapped ions0 aUniversal quantum computation with twolevel trapped ions c2000/12/110 v633 a Although the initial proposal for ion trap quantum computation made use of an auxiliary internal level to perform logic between ions, this resource is not necessary in principle. Instead, one may perform such operations directly using sideband laser pulses, operating with an arbitrary (sufficiently small) Lamb-Dicke parameter. We explore the potential of this technique, showing how to perform logical operations between the internal state of an ion and the collective motional state and giving explicit constructions for a controlled-not gate between ions. 1 aChilds, Andrew, M.1 aChuang, Isaac, L. uhttp://arxiv.org/abs/quant-ph/0008065v100707nas a2200133 4500008004100000245010200041210006900143260001500212520024500227100001700472700001700489700002300506856004400529 1999 eng d00aRevised Proof of the Uniqueness Theorem for 'No Collapse' Interpretations of Quantum Mechanics 0 aRevised Proof of the Uniqueness Theorem for No Collapse Interpre c1999/10/223 a We show that the Bub-Clifton uniqueness theorem for 'no collapse' interpretations of quantum mechanics (Studies in the History and Philosophy of Modern Physics 27, 181-219 (1996)) can be proved without the 'weak separability' assumption. 1 aBub, Jeffrey1 aClifton, Rob1 aGoldstein, Sheldon uhttp://arxiv.org/abs/quant-ph/9910097v1