01948nas a2200169 4500008004100000245007300041210006900114260001400183520141700197100002401614700001901638700001801657700001901675700002501694700002201719856003701741 2024 eng d00aUltrastrong light-matter interaction in a multimode photonic crystal0 aUltrastrong lightmatter interaction in a multimode photonic crys c2/21/20243 a

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

1 aVrajitoarea, Andrei1 aBelyansky, Ron1 aLundgren, Rex1 aWhitsitt, Seth1 aGorshkov, Alexey, V.1 aHouck, Andrew, A. uhttps://arxiv.org/abs/2209.1497201629nas a2200109 4500008004100000245013500041210006900176260001400245520120700259100001601466856003701482 2023 eng d00aAn Uncertainty Principle for the Curvelet Transform, and the Infeasibility of Quantum Algorithms for Finding Short Lattice Vectors0 aUncertainty Principle for the Curvelet Transform and the Infeasi c11/7/20233 a

The curvelet transform is a special type of wavelet transform, which is useful for estimating the locations and orientations of waves propagating in Euclidean space. We prove an uncertainty principle that lower-bounds the variance of these estimates, for radial wave functions in n dimensions.  As an application of this uncertainty principle, we show the infeasibility of one approach to constructing quantum algorithms for solving lattice problems, such as the approximate shortest vector problem (approximate-SVP), and bounded distance decoding (BDD). This gives insight into the computational intractability of approximate-SVP, which plays an important role in algorithms for integer programming, and in post-quantum cryptosystems.
In this approach to solving lattice problems, one prepares quantum superpositions of Gaussian-like wave functions centered at lattice points. A key step in this procedure requires finding the center of each Gaussian-like wave function, using the quantum curvelet transform. We show that, for any choice of the Gaussian-like wave function, the error in this step will be above the threshold required to solve BDD and approximate-SVP.  

1 aLiu, Yi-Kai uhttps://arxiv.org/abs/2310.0373501611nas a2200109 4500008004100000245013500041210006900176260001400245520118900259100001601448856003701464 2023 eng d00aAn Uncertainty Principle for the Curvelet Transform, and the Infeasibility of Quantum Algorithms for Finding Short Lattice Vectors0 aUncertainty Principle for the Curvelet Transform and the Infeasi c10/5/20233 a

The curvelet transform is a special type of wavelet transform, which is useful for estimating the locations and orientations of waves propagating in Euclidean space. We prove an uncertainty principle that lower-bounds the variance of these estimates, for radial wave functions in n dimensions.
As an application of this uncertainty principle, we show the infeasibility of one approach to constructing quantum algorithms for solving lattice problems, such as the approximate shortest vector problem (approximate-SVP), and bounded distance decoding (BDD). This gives insight into the computational intractability of approximate-SVP, which plays an important role in algorithms for integer programming, and in post-quantum cryptosystems.
In this approach to solving lattice problems, one prepares quantum superpositions of Gaussian-like wave functions centered at lattice points. A key step in this procedure requires finding the center of each Gaussian-like wave function, using the quantum curvelet transform. We show that, for any choice of the Gaussian-like wave function, the error in this step will be above the threshold required to solve BDD and approximate-SVP.

1 aLiu, Yi-Kai uhttps://arxiv.org/abs/2310.0373501963nas a2200205 4500008004100000245006300041210006200104260001400166520131600180653002701496653003901523653003101562100002401593700001901617700001801636700001901654700002501673700002201698856003701720 2022 eng d00aUltrastrong light-matter interaction in a photonic crystal0 aUltrastrong lightmatter interaction in a photonic crystal c9/29/20223 a

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

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

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

10aFOS: Physical sciences10aMathematical Physics (math-ph)10aQuantum Physics (quant-ph)1 aWang, Yidan1 aGullans, Michael1 aNa, Xuesen1 aWhitsitt, Seth1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/2103.0983001418nas a2200157 4500008004100000245008100041210006900122260001400191490000600205520093500211100001601146700002101162700001501183700002501198856003701223 2022 eng d00aUniversality in one-dimensional scattering with general dispersion relations0 aUniversality in onedimensional scattering with general dispersio c3/17/20210 v43 a

Many synthetic quantum systems allow particles to have dispersion relations that are neither linear nor quadratic functions. Here, we explore single-particle scattering in one dimension when the dispersion relation is ϵ(k)=±|d|km, where m≥2 is an integer. We study impurity scattering problems in which a single-particle in a one-dimensional waveguide scatters off of an inhomogeneous, discrete set of sites locally coupled to the waveguide. For a large class of these problems, we rigorously prove that when there are no bright zero-energy eigenstates, the S-matrix evaluated at an energy E→0 converges to a universal limit that is only dependent on m. We also give a generalization of a key index theorem in quantum scattering theory known as Levinson's theorem -- which relates the scattering phases to the number of bound states -- to impurity scattering for these more general dispersion relations.

1 aWang, Yidan1 aGullans, Michael1 aNa, Xuesen1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/2103.0983001309nas a2200157 4500008004100000245007300041210006900114260001400183300000800197490000600205520083900211100002001050700002501070700001901095856003701114 2022 eng d00aUnlimited non-causal correlations and their relation to non-locality0 aUnlimited noncausal correlations and their relation to nonlocali c3/22/2022 a6730 v63 a

Non-causal correlations certify the lack of a definite causal order among localized space-time regions. In stark contrast to scenarios where a single region influences its own causal past, some processes that distribute non-causal correlations satisfy a series of natural desiderata: logical consistency, linear and reversible dynamics, and computational tameness. Here, we present such processes among arbitrary many regions where each region influences every other but itself, and show that the above desiderata are altogether insufficient to limit the amount of "acausality" of non-causal correlations. This leaves open the identification of a principle that forbids non-causal correlations. Our results exhibit qualitative and quantitative parallels with the non-local correlations due to Ardehali and Svetlichny.

1 aBaumeler, Ämin1 aGilani, Amin, Shiraz1 aRashid, Jibran uhttps://arxiv.org/abs/2104.0623401048nas 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 a

We 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.0479701577nas a2200157 4500008004100000245006300041210006300104260001300167520107800180100003201258700002401290700002101314700002201335700002501357856003701382 2021 eng d00aUnifying Quantum and Classical Speed Limits on Observables0 aUnifying Quantum and Classical Speed Limits on Observables c8/9/20213 a

The presence of noise or the interaction with an environment can radically change the dynamics of observables of an otherwise isolated quantum system. We derive a bound on the speed with which observables of open quantum systems evolve. This speed limit divides into Mandalestam and Tamm's original time-energy uncertainty relation and a time-information uncertainty relation recently derived for classical systems, generalizing both to open quantum systems. By isolating the coherent and incoherent contributions to the system dynamics, we derive both lower and upper bounds to the speed of evolution. We prove that the latter provide tighter limits on the speed of observables than previously known quantum speed limits, and that a preferred basis of \emph{speed operators} serves to completely characterize the observables that saturate the speed limits. We use this construction to bound the effect of incoherent dynamics on the evolution of an observable and to find the Hamiltonian that gives the maximum coherent speedup to the evolution of an observable.

1 aGarcía-Pintos, Luis, Pedro1 aNicholson, Schuyler1 aGreen, Jason, R.1 adel Campo, Adolfo1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/2108.0426101487nas 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 a

If 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.03033000692nas a2200109 4500008004100000245004900041210004800090260001300138520037700151100001700528856003700545 2020 eng d00aUnderstanding the Frauchiger-Renner Argument0 aUnderstanding the FrauchigerRenner Argument c9/4/20203 a

In 2018, Daniela Frauchiger and Renato Renner published an article in Nature Communications entitled `Quantum theory cannot consistently describe the use of itself.' I clarify the significance of the result and point out a common and persistent misunderstanding of the argument, which has been attacked as flawed from a variety of interpretational perspectives.

1 aBub, Jeffrey uhttps://arxiv.org/abs/2008.0853801282nas a2200133 4500008004100000245006000041210006000101260001500161490000800176520088800184100001801072700002101090856003701111 2020 eng d00aUnitary Subharmonic Response and Floquet Majorana Modes0 aUnitary Subharmonic Response and Floquet Majorana Modes c10/13/20200 v1253 a

Detection and manipulation of excitations with non-Abelian statistics, such as Majorana fermions, are essential for creating topological quantum computers. To this end, we show the connection between the existence of such localized particles and the phenomenon of unitary subharmonic response (SR) in periodically driven systems. In particular, starting from highly non-equilibrium initial states, the unpaired Majorana modes exhibit spin oscillations with twice the driving period, are localized, and can have exponentially long lifetimes in clean systems. While the lifetime of SR is limited in translationally invariant systems, we show that disorder can be engineered to stabilize the subharmonic response of Majorana modes. A viable observation of this phenomenon can be achieved using modern multi-qubit hardware, such as superconducting circuits and cold atomic systems

1 aShtanko, Oles1 aMovassagh, Ramis uhttps://arxiv.org/abs/1911.0579501306nas 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 a

Quantum 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.1119700403nas a2200121 4500008004100000245006400041210006400105260001500169100002000184700002100204700001900225856003700244 2019 eng d00aUniversal Constraints on Energy Flow and SYK Thermalization0 aUniversal Constraints on Energy Flow and SYK Thermalization c12/10/20191 aAlmheiri, Ahmed1 aMilekhin, Alexey1 aSwingle, Brian uhttps://arxiv.org/abs/1912.0491201724nas a2200133 4500008004100000245003500041210003500076490001000111520132700121100001901448700002501467700002201492856007601514 2018 eng d00aUnforgeable Quantum Encryption0 aUnforgeable Quantum Encryption0 v108223 a

We study the problem of encrypting and authenticating quantum data in the presence of adversaries making adaptive chosen plaintext and chosen ciphertext queries. Classically, security games use string copying and comparison to detect adversarial cheating in such scenarios. Quantumly, this approach would violate no-cloning. We develop new techniques to overcome this problem: we use entanglement to detect cheating, and rely on recent results for characterizing quantum encryption schemes. We give definitions for (i) ciphertext unforgeability, (ii) indistinguishability under adaptive chosen-ciphertext attack, and (iii) authenticated encryption. The restriction of each definition to the classical setting is at least as strong as the corresponding classical notion: (i) implies   INT-CTXT , (ii) implies   IND-CCA2 , and (iii) implies   AE . All of our new notions also imply   QIND-CPA  privacy. Combining one-time authentication and classical pseudorandomness, we construct symmetric-key quantum encryption schemes for each of these new security notions, and provide several separation examples. Along the way, we also give a new definition of one-time quantum authentication which, unlike all previous approaches, authenticates ciphertexts rather than plaintexts.

1 aAlagic, Gorjan1 aGagliardoni, Tommaso1 aMajenz, Christian uhttps://www.quics.umd.edu/publications/unforgeable-quantum-encryption-001556nas a2200157 4500008004100000245006300041210006300104520105500167100002101222700002201243700002401265700002301289700002401312700002501336856003701361 2018 eng d00aUnitary Entanglement Construction in Hierarchical Networks0 aUnitary Entanglement Construction in Hierarchical Networks3 a

The 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.0787601731nas a2200133 4500008004100000245003500041210003500076260001500111520136800126100001901494700002501513700002201538856003701560 2017 eng d00aUnforgeable Quantum Encryption0 aUnforgeable Quantum Encryption c2017/09/193 a

We study the problem of encrypting and authenticating quantum data in the presence of adversaries making adaptive chosen plaintext and chosen ciphertext queries. Classically, security games use string copying and comparison to detect adversarial cheating in such scenarios. Quantumly, this approach would violate no-cloning. We develop new techniques to overcome this problem: we use entanglement to detect cheating, and rely on recent results for characterizing quantum encryption schemes. We give definitions for (i.) ciphertext unforgeability , (ii.) indistinguishability under adaptive chosen-ciphertext attack, and (iii.) authenticated encryption. The restriction of each definition to the classical setting is at least as strong as the corresponding classical notion: (i) implies INT-CTXT, (ii) implies IND-CCA2, and (iii) implies AE. All of our new notions also imply QIND-CPA privacy. Combining one-time authentication and classical pseudorandomness, we construct schemes for each of these new quantum security notions, and provide several separation examples. Along the way, we also give a new definition of one-time quantum authentication which, unlike all previous approaches, authenticates ciphertexts rather than plaintexts.

1 aAlagic, Gorjan1 aGagliardoni, Tommaso1 aMajenz, Christian uhttps://arxiv.org/abs/1709.0653901611nas a2200133 4500008004100000245008000041210006900121260001500190490000700205520118300212100001701395700001601412856004901428 2017 eng d00aUniversal Security for Randomness Expansion from the Spot-Checking Protocol0 aUniversal Security for Randomness Expansion from the SpotCheckin c2017/08/010 v463 a

Colbeck (Thesis, 2006) proposed using Bell inequality violations to generate certified random numbers. While full quantum-security proofs have been given, it remains a major open problem to identify the broadest class of Bell inequalities and lowest performance requirements to achieve such security. In this paper, working within the broad class of spot-checking protocols, we prove exactly which Bell inequality violations can be used to achieve full security. Our result greatly improves the known noise tolerance for secure randomness expansion: for the commonly used CHSH game, full security was only known with a noise tolerance of 1.5%, and we improve this to 10.3%. We also generalize our results beyond Bell inequalities and give the first security proof for randomness expansion based on Kochen-Specker inequalities. The central technical contribution of the paper is a new uncertainty principle for the Schatten norm, which is based on the uniform convexity inequality of Ball, Carlen, and Lieb (Inventiones mathematicae, 115:463-482, 1994).

1 aMiller, Carl1 aShi, Yaoyun uhttp://epubs.siam.org/doi/10.1137/15M104433300962nas a2200121 4500008004100000245007400041210006900115260001500184520054100199100001900740700001800759856006300777 2017 eng d00aUse of global interactions in efficient quantum circuit constructions0 aUse of global interactions in efficient quantum circuit construc c2017/12/213 a

In this paper we study the ways to use a global entangling operator to efficiently implement circuitry common to a selection of important quantum algorithms. In particular, we focus on the circuits composed with global Ising entangling gates and arbitrary addressable single-qubit gates. We show that under certain circumstances the use of global operations can substantially improve the entangling gate count.

1 aMaslov, Dmitri1 aNam, Yunseong uhttp://iopscience.iop.org/article/10.1088/1367-2630/aaa39801487nas a2200145 4500008004100000245009000041210006900131260001500200300000900215490000700224520101500231100002401246700001901270856005201289 2016 eng d00aUpper bounds on quantum query complexity inspired by the Elitzur-Vaidman bomb tester0 aUpper bounds on quantum query complexity inspired by the Elitzur c2016/11/28 a1-350 v123 a

Inspired by the Elitzur-Vaidman bomb testing problem [arXiv:hep-th/9305002], we introduce a new query complexity model, which we call bomb query complexity $B(f)$. We investigate its relationship with the usual quantum query complexity $Q(f)$, and show that $B(f)=\Theta(Q(f)^2)$. This result gives a new method to upper bound the quantum query complexity: we give a method of finding bomb query algorithms from classical algorithms, which then provide nonconstructive upper bounds on $Q(f)=\Theta(\sqrt{B(f)})$. We subsequently were able to give explicit quantum algorithms matching our upper bound method. We apply this method on the single-source shortest paths problem on unweighted graphs, obtaining an algorithm with $O(n^{1.5})$ quantum query complexity, improving the best known algorithm of $O(n^{1.5}\sqrt{\log n})$ [arXiv:quant-ph/0606127]. Applying this method to the maximum bipartite matching problem gives an $O(n^{1.75})$ algorithm, improving the best known trivial $O(n^2)$ upper bound.

1 aLin, Cedric, Yen-Yu1 aLin, Han-Hsuan uhttp://theoryofcomputing.org/articles/v012a018/01602nas 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<...3. If $M$ is even, the well known BCS states are not LU-equivalent to any single occupancy state. Our main result is that for N=3 and $M$ even there is a universal subspace $\cW\subseteq\cS$ spanned by $M(M-1)(M-5)/6$ states $e_{i_1,...,i_N}$. Moreover the number $M(M-1)(M-5)/6$ is minimal. 1 aChen, Lin1 aChen, Jianxin1 aDjokovic, Dragomir, Z.1 aZeng, Bei uhttp://arxiv.org/abs/1301.3421v201286nas a2200157 4500008004100000245005300041210005300094260001500147300001100162490000700173520086500180100001801045700001401063700001401077856003701091 2014 eng d00aUnextendible Product Basis for Fermionic Systems0 aUnextendible Product Basis for Fermionic Systems c2014/01/01 a0822070 v553 a We discuss the concept of unextendible product basis (UPB) and generalized UPB for fermionic systems, using Slater determinants as an analogue of product states, in the antisymmetric subspace $\wedge^ N \bC^M$. We construct an explicit example of generalized fermionic unextendible product basis (FUPB) of minimum cardinality $N(M-N)+1$ for any $N\ge2,M\ge4$. We also show that any bipartite antisymmetric space $\wedge^ 2 \bC^M$ of codimension two is spanned by Slater determinants, and the spaces of higher codimension may not be spanned by Slater determinants. Furthermore, we construct an example of complex FUPB of $N=2,M=4$ with minimum cardinality $5$. In contrast, we show that a real FUPB does not exist for $N=2,M=4$ . Finally we provide a systematic construction for FUPBs of higher dimensions using FUPBs and UPBs of lower dimensions. 1 aChen, Jianxin1 aChen, Lin1 aZeng, Bei uhttp://arxiv.org/abs/1312.4218v102008nas a2200193 4500008004100000245007500041210006900116260001400185490000700199520143800206100001801644700002101662700001801683700002401701700001701725700002101742700001401763856003701777 2013 eng d00aUniqueness of Quantum States Compatible with Given Measurement Results0 aUniqueness of Quantum States Compatible with Given Measurement R c2013/7/110 v883 a We discuss the uniqueness of quantum states compatible with given results for measuring a set of observables. For a given pure state, we consider two different types of uniqueness: (1) no other pure state is compatible with the same measurement results and (2) no other state, pure or mixed, is compatible with the same measurement results. For case (1), it is known that for a d-dimensional Hilbert space, there exists a set of 4d-5 observables that uniquely determines any pure state. We show that for case (2), 5d-7 observables suffice to uniquely determine any pure state. Thus there is a gap between the results for (1) and (2), and we give some examples to illustrate this. The case of observables corresponding to reduced density matrices (RDMs) of a multipartite system is also discussed, where we improve known bounds on local dimensions for case (2) in which almost all pure states are uniquely determined by their RDMs. We further discuss circumstances where (1) can imply (2). We use convexity of the numerical range of operators to show that when only two observables are measured, (1) always implies (2). More generally, if there is a compact group of symmetries of the state space which has the span of the observables measured as the set of fixed points, then (1) implies (2). We analyze the possible dimensions for the span of such observables. Our results extend naturally to the case of low rank quantum states. 1 aChen, Jianxin1 aDawkins, Hillary1 aJi, Zhengfeng1 aJohnston, Nathaniel1 aKribs, David1 aShultz, Frederic1 aZeng, Bei uhttp://arxiv.org/abs/1212.3503v201608nas a2200157 4500008004100000245005700041210005600098260001500154300001400169490000800183520116700191100002301358700001801381700001401399856003701413 2013 eng d00aUniversal computation by multi-particle quantum walk0 aUniversal computation by multiparticle quantum walk c2013/02/14 a791 - 7940 v3393 a A quantum walk is a time-homogeneous quantum-mechanical process on a graph defined by analogy to classical random walk. The quantum walker is a particle that moves from a given vertex to adjacent vertices in quantum superposition. Here we consider a generalization of quantum walk to systems with more than one walker. A continuous-time multi-particle quantum walk is generated by a time-independent Hamiltonian with a term corresponding to a single-particle quantum walk for each particle, along with an interaction term. Multi-particle quantum walk includes a broad class of interacting many-body systems such as the Bose-Hubbard model and systems of fermions or distinguishable particles with nearest-neighbor interactions. We show that multi-particle quantum walk is capable of universal quantum computation. Since it is also possible to efficiently simulate a multi-particle quantum walk of the type we consider using a universal quantum computer, this model exactly captures the power of quantum computation. In principle our construction could be used as an architecture for building a scalable quantum computer with no need for time-dependent control. 1 aChilds, Andrew, M.1 aGosset, David1 aWebb, Zak uhttp://arxiv.org/abs/1205.3782v202285nas a2200133 4500008004100000245005900041210005900100260001500159520189000174100001802064700001802082700001402100856003702114 2013 eng d00aUniversal Entanglers for Bosonic and Fermionic Systems0 aUniversal Entanglers for Bosonic and Fermionic Systems c2013/05/313 a A universal entangler (UE) is a unitary operation which maps all pure product states to entangled states. It is known that for a bipartite system of particles $1,2$ with a Hilbert space $\mathbb{C}^{d_1}\otimes\mathbb{C}^{d_2}$, a UE exists when $\min{(d_1,d_2)}\geq 3$ and $(d_1,d_2)\neq (3,3)$. It is also known that whenever a UE exists, almost all unitaries are UEs; however to verify whether a given unitary is a UE is very difficult since solving a quadratic system of equations is NP-hard in general. This work examines the existence and construction of UEs of bipartite bosonic/fermionic systems whose wave functions sit in the symmetric/antisymmetric subspace of $\mathbb{C}^{d}\otimes\mathbb{C}^{d}$. The development of a theory of UEs for these types of systems needs considerably different approaches from that used for UEs of distinguishable systems. This is because the general entanglement of identical particle systems cannot be discussed in the usual way due to the effect of (anti)-symmetrization which introduces "pseudo entanglement" that is inaccessible in practice. We show that, unlike the distinguishable particle case, UEs exist for bosonic/fermionic systems with Hilbert spaces which are symmetric (resp. antisymmetric) subspaces of $\mathbb{C}^{d}\otimes\mathbb{C}^{d}$ if and only if $d\geq 3$ (resp. $d\geq 8$). To prove this we employ algebraic geometry to reason about the different algebraic structures of the bosonic/fermionic systems. Additionally, due to the relatively simple coherent state form of unentangled bosonic states, we are able to give the explicit constructions of two bosonic UEs. Our investigation provides insight into the entanglement properties of systems of indisitinguishable particles, and in particular underscores the difference between the entanglement structures of bosonic, fermionic and distinguishable particle systems. 1 aKlassen, Joel1 aChen, Jianxin1 aZeng, Bei uhttp://arxiv.org/abs/1305.7489v101255nas a2200133 4500008004100000245010500041210006900146260001400215490000700229520081400236100001501050700001901065856003701084 2011 eng d00aUnified approach to topological quantum computation with anyons: From qubit encoding to Toffoli gate0 aUnified approach to topological quantum computation with anyons  c2011/7/260 v843 aTopological quantum computation may provide a robust approach for encoding and manipulating information utilizing the topological properties of anyonic quasi-particle excitations. We develop an efficient means to map between dense and sparse representations of quantum information (qubits) and a simple construction of multi-qubit gates, for all anyon models from Chern-Simons-Witten SU(2)$_k$ theory that support universal quantum computation by braiding ($k\geq 3,\ k \neq 4$). In the process, we show how the constructions of topological quantum memory and gates for $k=2,4$ connect naturally to those for $k\geq 3,\ k \neq 4$, unifying these concepts in a simple framework. Furthermore, we illustrate potential extensions of these ideas to other anyon models outside of Chern-Simons-Witten field theory. 1 aXu, Haitan1 aTaylor, J., M. uhttp://arxiv.org/abs/1001.4085v201292nas a2200121 4500008004100000245006300041210006200104260001500166300001400181520092200195100001601117856003701133 2011 eng d00aUniversal low-rank matrix recovery from Pauli measurements0 aUniversal lowrank matrix recovery from Pauli measurements c2011/03/14 a1638-16463 a We study the problem of reconstructing an unknown matrix M of rank r and dimension d using O(rd poly log d) Pauli measurements. This has applications in quantum state tomography, and is a non-commutative analogue of a well-known problem in compressed sensing: recovering a sparse vector from a few of its Fourier coefficients. We show that almost all sets of O(rd log^6 d) Pauli measurements satisfy the rank-r restricted isometry property (RIP). This implies that M can be recovered from a fixed ("universal") set of Pauli measurements, using nuclear-norm minimization (e.g., the matrix Lasso), with nearly-optimal bounds on the error. A similar result holds for any class of measurements that use an orthonormal operator basis whose elements have small operator norm. Our proof uses Dudley's inequality for Gaussian processes, together with bounds on covering numbers obtained via entropy duality. 1 aLiu, Yi-Kai uhttp://arxiv.org/abs/1103.2816v200931nas 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.1972v100912nas a2200133 4500008004100000245004600041210004600087300001400133490000700147520053100154100001900685700002300704856005100727 2008 eng d00aUncertainty principles for compact groups0 aUncertainty principles for compact groups a1315-13240 v523 a

We establish an uncertainty principle over arbitrary compact groups, generalizing several previous results. Specifically, we show that if P and R are operators on L2(G) such that P commutes with projection onto every measurable subset of G and R commutes with left-multiplication by elements of G, then ∥PR∥≤∥P⋅χG∥2∥R∥2, where χG:g↦1 is the characteristic function of G. As a consequence, we show that every nonzero function f in L2(G) satisfies μ(suppf)⋅∑ρ∈G^dρrankf^(ρ)≥1.

1 aAlagic, Gorjan1 aRussell, Alexander uhttp://projecteuclid.org/euclid.ijm/125855436501151nas a2200169 4500008004100000245006500041210006500106260001400171490000700185520063000192100002500822700001600847700002600863700002500889700002300914856004400937 2007 eng d00aUniversal Approach to Optimal Photon Storage in Atomic Media0 aUniversal Approach to Optimal Photon Storage in Atomic Media c2007/3/190 v983 a We present a universal physical picture for describing storage and retrieval of photon wave packets in a Lambda-type atomic medium. This physical picture encompasses a variety of different approaches to pulse storage ranging from adiabatic reduction of the photon group velocity and pulse-propagation control via off-resonant Raman fields to photon-echo based techniques. Furthermore, we derive an optimal control strategy for storage and retrieval of a photon wave packet of any given shape. All these approaches, when optimized, yield identical maximum efficiencies, which only depend on the optical depth of the medium. 1 aGorshkov, Alexey, V.1 aAndre, Axel1 aFleischhauer, Michael1 aSorensen, Anders, S.1 aLukin, Mikhail, D. uhttp://arxiv.org/abs/quant-ph/0604037v301494nas 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/0404132v201322nas a2200169 4500008004100000245007000041210006900111260001400180490000700194520079400201100002300995700002301018700002601041700001901067700002301086856004301109 2003 eng d00aUltracold collision properties of metastable alkaline-earth atoms0 aUltracold collision properties of metastable alkalineearth atoms c2003/2/130 v903 a Ultra-cold collisions of spin-polarized 24Mg,40Ca, and 88Sr in the metastable 3P2 excited state are investigated. We calculate the long-range interaction potentials and estimate the scattering length and the collisional loss rate as a function of magnetic field. The estimates are based on molecular potentials between 3P2 alkaline-earth atoms obtained from ab initio atomic and molecular structure calculations. The scattering lengths show resonance behavior due to the appearance of a molecular bound state in a purely long-range interaction potential and are positive for magnetic fields below 50 mT. A loss-rate model shows that losses should be smallest near zero magnetic field and for fields slightly larger than the resonance field, where the scattering length is also positive. 1 aDerevianko, Andrei1 aPorsev, Sergey, G.1 aKotochigova, Svetlana1 aTiesinga, Eite1 aJulienne, Paul, S. uhttp://arxiv.org/abs/physics/0210076v101384nas 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/0312613v201113nas 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/0109064v201258nas 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/0008070v200976nas 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/0008065v1