02367nas a2200181 4500008004100000022001400041245004800055210004800103260001400151300000900165490000600174520189200180100001802072700001802090700001802108700002002126856003902146 2024 eng d a2521-327X00aFast simulation of planar Clifford circuits0 aFast simulation of planar Clifford circuits c2/12/2024 a12510 v83 a

A general quantum circuit can be simulated classically in exponential time. If it has a planar layout, then a tensor-network contraction algorithm due to Markov and Shi has a runtime exponential in the square root of its size, or more generally exponential in the treewidth of the underlying graph. Separately, Gottesman and Knill showed that if all gates are restricted to be Clifford, then there is a polynomial time simulation. We combine these two ideas and show that treewidth and planarity can be exploited to improve Clifford circuit simulation. Our main result is a classical algorithm with runtime scaling asymptotically as nω/2<n1.19 which samples from the output distribution obtained by measuring all n qubits of a planar graph state in given Pauli bases. Here ω is the matrix multiplication exponent. We also provide a classical algorithm with the same asymptotic runtime which samples from the output distribution of any constant-depth Clifford circuit in a planar geometry. Our work improves known classical algorithms with cubic runtime. A key ingredient is a mapping which, given a tree decomposition of some graph G, produces a Clifford circuit with a structure that mirrors the tree decomposition and which emulates measurement of the corresponding graph state. We provide a classical simulation of this circuit with the runtime stated above for planar graphs and otherwise ntω−1 where t is the width of the tree decomposition. Our algorithm incorporates two subroutines which may be of independent interest. The first is a matrix-multiplication-time version of the Gottesman-Knill simulation of multi-qubit measurement on stabilizer states. The second is a new classical algorithm for solving symmetric linear systems over F2 in a planar geometry, extending previous works which only applied to non-singular linear systems in the analogous setting.

1 aGosset, David1 aGrier, Daniel1 aKerzner, Alex1 aSchaeffer, Luke uhttps://arxiv.org/abs/2009.03218v300787nas a2200121 4500008004100000245005500041210005200096260001300148520042900161100002000590700001800610856003700628 2024 eng d00aFree Quantum Codes from Twisted Unitary $t$-groups0 aFree Quantum Codes from Twisted Unitary tgroups c2/2/20243 a

We introduce twisted unitary t-groups, a generalization of unitary t-groups under a twisting by an irreducible representation. We then apply representation theoretic methods to the Knill-Laflamme error correction conditions to show that twisted unitary t-groups automatically correspond to quantum codes with distance d=t+1. By construction these codes have many transversal gates, which are naturally fault tolerant.

1 aKubischta, Eric1 aTeixeira, Ian uhttps://arxiv.org/abs/2402.0163801092nas a2200133 4500008004100000245005600041210005400097260001400151520069700165100001600862700002300878700002000901856003700921 2023 eng d00aA family of permutationally invariant quantum codes0 afamily of permutationally invariant quantum codes c10/9/20233 a

We construct a new family of permutationally invariant codes that correct t Pauli errors for any t≥1. We also show that codes in the new family correct spontaneous decay errors as well as deletion errors. In many cases the codes in this family are shorter than the best previously known explicit families of permutationally invariant codes both for Pauli errors, deletions, and for the amplitude damping channel. As a separate result, we generalize the conditions for permutationally invariant codes to correct t Pauli errors from the previously known results for t=1 to any number of errors. For small t, these conditions can be used to construct new examples of codes by computer.

1 aAydin, Arda1 aAlekseyev, Max, A.1 aBarg, Alexander uhttps://arxiv.org/abs/2310.0535800804nas a2200121 4500008004100000245006000041210005800101260001400159520043400173100002000607700001800627856003700645 2023 eng d00aA Family of Quantum Codes with Exotic Transversal Gates0 aFamily of Quantum Codes with Exotic Transversal Gates c5/11/20233 a

Recently it has been shown that the binary icosahedral group 2I together with a certain involution forms the most efficient single-qubit universal gate set. In order for this to be viable, one must construct a quantum code with transversal gate group 2I, however, no such code has ever been demonstrated explicitly. We fill this void by constructing a novel family of quantum codes that all have transversal gate group 2I.

1 aKubischta, Eric1 aTeixeira, Ian uhttps://arxiv.org/abs/2305.0702301715nas 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 a

Temporal 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.

10aCryptography and Security (cs.CR)10aFOS: Computer and information sciences1 aZhou, Jie1 aCriswell, John1 aHicks, Michael uhttps://arxiv.org/abs/2208.1290002121nas a2200181 4500008004100000245006900041210006800110260001400178520156100192100001901753700002201772700001901794700001901813700002401832700002501856700002101881856003701902 2023 eng d00aFault-tolerant hyperbolic Floquet quantum error correcting codes0 aFaulttolerant hyperbolic Floquet quantum error correcting codes c9/18/20233 a

A central goal in quantum error correction is to reduce the overhead of fault-tolerant quantum computing by increasing noise thresholds and reducing the number of physical qubits required to sustain a logical qubit. We introduce a potential path towards this goal based on a family of dynamically generated quantum error correcting codes that we call "hyperbolic Floquet codes." These codes are defined by a specific sequence of non-commuting two-body measurements arranged periodically in time that stabilize a topological code on a hyperbolic manifold with negative curvature. We focus on a family of lattices for n qubits that, according to our prescription that defines the code, provably achieve a finite encoding rate (1/8+2/n) and have a depth-3 syndrome extraction circuit. Similar to hyperbolic surface codes, the distance of the code at each time-step scales at most logarithmically in n. The family of lattices we choose indicates that this scaling is achievable in practice. We develop and benchmark an efficient matching-based decoder that provides evidence of a threshold near 0.1% in a phenomenological noise model. Utilizing weight-two check operators and a qubit connectivity of 3, one of our hyperbolic Floquet codes uses 400 physical qubits to encode 52 logical qubits with a code distance of 8, i.e., it is a [[400,52,8]] code. At small error rates, comparable logical error suppression to this code requires 5x as many physical qubits (1924) when using the honeycomb Floquet code with the same noise model and decoder.

1 aFahimniya, Ali1 aDehghani, Hossein1 aBharti, Kishor1 aMathew, Sheryl1 aKollár, Alicia, J.1 aGorshkov, Alexey, V.1 aGullans, Michael uhttps://arxiv.org/abs/2309.1003301860nas a2200145 4500008004100000245007100041210006900112260001500181520139900196100001601595700002101611700002401632700002101656856003701677 2023 eng d00aFault-Tolerant Quantum Memory using Low-Depth Random Circuit Codes0 aFaultTolerant Quantum Memory using LowDepth Random Circuit Codes c11/29/20233 a

Low-depth random circuit codes possess many desirable properties for quantum error correction but have so far only been analyzed in the code capacity setting where it is assumed that encoding gates and syndrome measurements are noiseless. In this work, we design a fault-tolerant distillation protocol for preparing encoded states of one-dimensional random circuit codes even when all gates and measurements are subject to noise. This is sufficient for fault-tolerant quantum memory since these encoded states can then be used as ancillas for Steane error correction. We show through numerical simulations that our protocol can correct erasure errors up to an error rate of 2%. In addition, we also extend results in the code capacity setting by developing a maximum likelihood decoder for depolarizing noise similar to work by Darmawan et al. As in their work, we formulate the decoding problem as a tensor network contraction and show how to contract the network efficiently by exploiting the low-depth structure. Replacing the tensor network with a so-called ''tropical'' tensor network, we also show how to perform minimum weight decoding. With these decoders, we are able to numerically estimate the depolarizing error threshold of finite-rate random circuit codes and show that this threshold closely matches the hashing bound even when the decoding is sub-optimal.

1 aNelson, Jon1 aBentsen, Gregory1 aFlammia, Steven, T.1 aGullans, Michael uhttps://arxiv.org/abs/2311.1798501740nas a2200145 4500008004100000245008100041210006900122260001400191520125300205100003001458700002401488700002301512700002201535856003701557 2023 eng d00aFeasibility of a trapped atom interferometer with accelerating optical traps0 aFeasibility of a trapped atom interferometer with accelerating o c8/23/20233 a

In order to increase the measured phase of an atom interferometer and improve its sensitivity, researchers attempt to increase the enclosed space-time area using two methods: creating larger separations between the interferometer arms and having longer evolution times. However, increasing the evolution time reduces the bandwidth that can be sampled, whereas decreasing the evolution time worsens the sensitivity. In this paper, we attempt to address this by proposing a setup for high-bandwidth applications, with improved overall sensitivity. This is realized by accelerating and holding the atoms using optical dipole traps. We find that accelerations of up to 103-105 m/s2 can be achieved using acousto-optic deflectors (AODs) to move the traps. By comparing the sensitivity of our approach to acceleration as a baseline to traditional atom interferometry, we find a substantial improvement to the state of the art. In the limit of appropriate beam and optics stabilization, sensitivities approaching 10−14 (m/s2)/Hz−−−√ may be achievable at 1 Hz, while detection at 1 kHz with a sensitivity an order of magnitude better than traditional free-fall atom interferometers is possible with today's systems.

1 aPremawardhana, Gayathrini1 aKunjummen, Jonathan1 aSubhankar, Sarthak1 aTaylor, Jacob, M. uhttps://arxiv.org/abs/2308.1224601923nas a2200253 4500008004100000020002200041245008700063210006900150260004800219520105800267100002001325700001901345700002301364700001501387700001601402700002401418700002001442700002201462700001201484700001501496700002201511700002201533856011401555 2023 eng d a978-3-031-38554-400aFixing and Mechanizing the Security Proof of Fiat-Shamir with Aborts and Dilithium0 aFixing and Mechanizing the Security Proof of FiatShamir with Abo aChambSpringer Nature Switzerlandc8/9/20233 a

We extend and consolidate the security justification for the Dilithium signature scheme. In particular, we identify a subtle but crucial gap that appears in several ROM and QROM security proofs for signature schemes that are based on the Fiat-Shamir with aborts paradigm, including Dilithium. The gap lies in the CMA-to-NMA reduction and was uncovered when trying to formalize a variant of the QROM security proof by Kiltz, Lyubashevsky, and Schaffner (Eurocrypt 2018). The gap was confirmed by the authors, and there seems to be no simple patch for it. We provide new, fixed proofs for the affected CMA-to-NMA reduction, both for the ROM and the QROM, and we perform a concrete security analysis for the case of Dilithium to show that the claimed security level is still valid after addressing the gap. Furthermore, we offer a fully mechanized ROM proof for the CMA-security of Dilithium in the EasyCrypt proof assistant. Our formalization includes several new tools and techniques of independent interest for future formal verification results.

1 aBarbosa, Manuel1 aBarthe, Gilles1 aDoczkal, Christian1 aDon, Jelle1 aFehr, Serge1 aGrégoire, Benjamin1 aHuang, Yu-Hsuan1 aHülsing, Andreas1 aLee, Yi1 aWu, Xiaodi1 aHandschuh, Helena1 aLysyanskaya, Anna uhttps://www.quics.umd.edu/publications/fixing-and-mechanizing-security-proof-fiat-shamir-aborts-and-dilithium02469nas a2200241 4500008004100000245007800041210006900119260001500188520171200203653003801915653004301953653002701996653003102023100001302054700001402067700001402081700001802095700002002113700001602133700002502149700001602174856003702190 2022 eng d00aFIPS Compliant Quantum Secure Communication using Quantum Permutation Pad0 aFIPS Compliant Quantum Secure Communication using Quantum Permut c12/30/20223 a

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

10aCryptography and Security (cs.CR)10aFOS: Computer and information sciences10aFOS: Physical sciences10aQuantum Physics (quant-ph)1 aHe, Alex1 aLou, Dafu1 aShe, Eric1 aGuo, Shangjie1 aWatson, Hareesh1 aWeng, Sibyl1 aPerepechaenko, Maria1 aKuang, Rand uhttps://arxiv.org/abs/2301.0006201880nas a2200169 4500008004100000022001400041245006100055210006100116260001400177490000600191520140600197100001901603700001301622700001901635700001901654856003701673 2021 eng d a2691-339900aFaster Digital Quantum Simulation by Symmetry Protection0 aFaster Digital Quantum Simulation by Symmetry Protection c2/14/20210 v23 a

Simulating 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.1624801332nas a2200157 4500008004100000245007400041210006900115260001500184300001200199490000600211520085200217100002201069700002501091700002101116856003701137 2021 eng d00aFeedback-stabilized dynamical steady states in the Bose-Hubbard model0 aFeedbackstabilized dynamical steady states in the BoseHubbard mo c12/15/2021 a043075 0 v33 a

The implementation of a combination of continuous weak measurement and classical feedback provides a powerful tool for controlling the evolution of quantum systems. In this work, we investigate the potential of this approach from three perspectives. First, we consider a double-well system in the classical large-atom-number limit, deriving the exact equations of motion in the presence of feedback. Second, we consider the same system in the limit of small atom number, revealing the effect that quantum fluctuations have on the feedback scheme. Finally, we explore the behavior of modest sized Hubbard chains using exact numerics, demonstrating the near-deterministic preparation of number states, a tradeoff between local and non-local feedback for state preparation, and evidence of a feedback-driven symmetry-breaking phase transition.

1 aYoung, Jeremy, T.1 aGorshkov, Alexey, V.1 aSpielman, I., B. uhttps://arxiv.org/abs/2106.0974400786nas 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 a

In 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.0019901706nas a2200193 4500008004100000245008500041210006900126260001400195490000600209520111700215100001901332700001901351700001801370700001601388700002401404700002201428700002501450856003701475 2021 eng d00aFrustration-induced anomalous transport and strong photon decay in waveguide QED0 aFrustrationinduced anomalous transport and strong photon decay i c9/16/20210 v33 a

We study the propagation of photons in a one-dimensional environment consisting of two non-interacting species of photons frustratingly coupled to a single spin-1/2. The ultrastrong frustrated coupling leads to an extreme mixing of the light and matter degrees of freedom, resulting in the disintegration of the spin and a breakdown of the "dressed-spin", or polaron, description. Using a combination of numerical and analytical methods, we show that the elastic response becomes increasingly weak at the effective spin frequency, showing instead an increasingly strong and broadband response at higher energies. We also show that the photons can decay into multiple photons of smaller energies. The total probability of these inelastic processes can be as large as the total elastic scattering rate, or half of the total scattering rate, which is as large as it can be. The frustrated spin induces strong anisotropic photon-photon interactions that are dominated by inter-species interactions. Our results are relevant to state-of-the-art circuit and cavity quantum electrodynamics experiments.

1 aBelyansky, Ron1 aWhitsitt, Seth1 aLundgren, Rex1 aWang, Yidan1 aVrajitoarea, Andrei1 aHouck, Andrew, A.1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/2007.0369001295nas a2200145 4500008004100000245008500041210006900126260001500195520080400210653002701014653003101041100002301072700001701095856003701112 2021 eng d00aFully device-independent quantum key distribution using synchronous correlations0 aFully deviceindependent quantum key distribution using synchrono c10/27/20213 a

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

10aFOS: Physical sciences10aQuantum Physics (quant-ph)1 aRodrigues, Nishant1 aLackey, Brad uhttps://arxiv.org/abs/2110.1453002128nas a2200229 4500008004100000245006400041210006200105260001400167520146400181100001601645700002301661700001801684700002101702700001601723700002201739700002001761700001501781700002301796700001801819700002401837856003701861 2020 eng d00aFault-Tolerant Operation of a Quantum Error-Correction Code0 aFaultTolerant Operation of a Quantum ErrorCorrection Code c9/24/20203 a

Quantum 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.1148201736nas a2200133 4500008004100000245007300041210006900114260001400183520130700197100002201504700001801526700002101544856003701565 2020 eng d00aFeedback Induced Magnetic Phases in Binary Bose-Einstein Condensates0 aFeedback Induced Magnetic Phases in Binary BoseEinstein Condensa c7/14/20203 a

Weak measurement in tandem with real-time feedback control is a new route toward engineering novel non-equilibrium quantum matter. Here we develop a theoretical toolbox for quantum feedback control of multicomponent Bose-Einstein condensates (BECs) using backaction-limited weak measurements in conjunction with spatially resolved feedback. Feedback in the form of a single-particle potential can introduce effective interactions that enter into the stochastic equation governing system dynamics. The effective interactions are tunable and can be made analogous to Feshbach resonances -- spin-independent and spin-dependent -- but without changing atomic scattering parameters. Feedback cooling prevents runaway heating due to measurement backaction and we present an analytical model to explain its effectiveness. We showcase our toolbox by studying a two-component BEC using a stochastic mean-field theory, where feedback induces a phase transition between easy-axis ferromagnet and spin-disordered paramagnet phases. We present the steady-state phase diagram as a function of intrinsic and effective spin-dependent interaction strengths. Our result demonstrates that closed-loop quantum control of Bose-Einstein condensates is a powerful new tool for quantum engineering in cold-atom systems.

1 aHurst, Hilary, M.1 aGuo, Shangjie1 aSpielman, I., B. uhttps://arxiv.org/abs/2007.0726601237nas a2200145 4500008004100000245008300041210006900124260001400193490000800207520076500215100003200980700002001012700002201032856003701054 2020 eng d00aFluctuations in Extractable Work Bound the Charging Power of Quantum Batteries0 aFluctuations in Extractable Work Bound the Charging Power of Qua c7/22/20200 v1253 a

We study the connection between the charging power of quantum batteries and the fluctuations of the stored work. We prove that in order to have a non-zero rate of change of the extractable work, the state ρW of the battery cannot be an eigenstate of a `\emph{work operator}', defined by F ≡ HW + β−1log(ρW), where HW is the Hamiltonian of the battery and β is the inverse temperature of a reference thermal bath with respect to which the extractable work is calculated. We do so by proving that fluctuations in the stored work upper bound the charging power of a quantum battery. Our findings also suggest that quantum coherence in the battery enhances the charging process, which we illustrate on a toy model of a heat engine. 

1 aGarcía-Pintos, Luis, Pedro1 aHamma, Alioscia1 adel Campo, Adolfo uhttps://arxiv.org/abs/1909.0355801284nas a2200145 4500008004100000245004700041210004700088260001500135490000600150520088800156100002301044700002101067700001301088856003701101 2019 eng d00aFaster quantum simulation by randomization0 aFaster quantum simulation by randomization c08/28/20190 v33 a

Product 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.0838501739nas a2200205 4500008004100000245013400041210006900175260001500244520106400259100001801323700001201341700002201353700001701375700002501392700001301417700001901430700002601449700002101475856003701496 2019 eng d00aFeshbach resonances in p-wave three-body recombination within Fermi-Fermi mixtures of open-shell 6Li and closed-shell 173Yb atoms0 aFeshbach resonances in pwave threebody recombination within Ferm c12/10/20193 a

We report on observations and modeling of interspecies magnetic Feshbach resonances in dilute ultracold mixtures of open-shell alkali-metal 6Li and closed-shell 173Yb atoms with temperatures just above quantum degeneracy for both fermionic species. Resonances are located by detecting magnetic-field-dependent atom loss due to three-body recombination. We resolve closely-located resonances that originate from a weak separation-dependent hyperfine coupling between the electronic spin of 6Li and the nuclear spin of 173Yb, and confirm their magnetic field spacing by ab initio electronic-structure calculations. Through quantitative comparisons of theoretical atom-loss profiles and experimental data at various temperatures between 1 μK and 20 μK, we show that three-body recombination in fermionic mixtures has a p-wave Wigner threshold behavior leading to characteristic asymmetric loss profiles. Such resonances can be applied towards the formation of ultracold doublet ground-state molecules and quantum simulation of superfluid p-wave pairing.

1 aGreen, Alaina1 aLi, Hui1 aToh, Jun, Hui See1 aTang, Xinxin1 aMcCormick, Katherine1 aLi, Ming1 aTiesinga, Eite1 aKotochigova, Svetlana1 aGupta, Subhadeep uhttps://arxiv.org/abs/1912.0487401980nas a2200193 4500008004100000245011000041210006900151260001500220520137500235100001801610700001601628700001401644700001501658700001301673700002501686700002001711700001801731856003701749 2019 eng d00aFloquet engineering of optical lattices with spatial features and periodicity below the diffraction limit0 aFloquet engineering of optical lattices with spatial features an c06/18/20193 a

Floquet engineering or coherent time periodic driving of quantum systems has been successfully used to synthesize Hamiltonians with novel properties. In ultracold atomic systems, this has led to experimental realizations of artificial gauge fields, topological band structures, and observation of dynamical localization, to name just a few. Here we present a Floquet-based framework to stroboscopically engineer Hamiltonians with spatial features and periodicity below the diffraction limit of light used to create them by time-averaging over various configurations of a 1D optical Kronig-Penney (KP) lattice. The KP potential is a lattice of narrow subwavelength barriers spaced by half the optical wavelength (λ/2) and arises from the non-linear optical response of the atomic dark state. Stroboscopic control over the strength and position of this lattice requires time-dependent adiabatic manipulation of the dark state spin composition. We investigate adiabaticity requirements and shape our time-dependent light fields to respect the requirements. We apply this framework to show that a λ/4-spaced lattice can be synthesized using realistic experimental parameters as an example, discuss mechanisms that limit lifetimes in these lattices, explore candidate systems and their limitations, and treat adiabatic loading into the ground band of these lattices.

1 aSubhankar, S.1 aBienias, P.1 aTitum, P.1 aTsui, T-C.1 aWang, Y.1 aGorshkov, Alexey, V.1 aRolston, S., L.1 aPorto, J., V. uhttps://arxiv.org/abs/1906.0764601300nas a2200145 4500008004100000245008500041210006900126260001300195490000800208520083900216100002101055700002501076700001601101856003701117 2019 eng d00aFluctuation-induced torque on a topological insulator out of thermal equilibrium0 aFluctuationinduced torque on a topological insulator out of ther c8/1/20190 v1233 a

Topological insulators with the time reversal symmetry broken exhibit strong magnetoelectric and magneto-optic effects. While these effects are well-understood in or near equilibrium, nonequilibrium physics is richer yet less explored. We consider a topological insulator thin film, weakly coupled to a ferromagnet, out of thermal equilibrium with a cold environment (quantum electrodynamics vacuum). We show that the heat flow to the environment is strongly circularly polarized, thus carrying away angular momentum and exerting a purely fluctuation-driven torque on the topological insulator film. Utilizing the Keldysh framework, we investigate the universal nonequilibrium response of the TI to the temperature difference with the environment. Finally, we argue that experimental observation of this effect is within reach.

1 aMaghrebi, M., F.1 aGorshkov, Alexey, V.1 aSau, J., D. uhttps://arxiv.org/abs/1811.0608000650nas a2200121 4500008004100000245012100041210006900162260001500231490000600246520020700252100001300459856005600472 2019 eng d00aFramework for Hamiltonian simulation and beyond: standard-form encoding, qubitization, and quantum signal processing0 aFramework for Hamiltonian simulation and beyond standardform enc c08/13/20190 v33 a
This is a Perspective on "Hamiltonian Simulation by Qubitization" by Guang Hao Low and Isaac L. Chuang, published in Quantum 3, 163 (2019).
1 aSu, Yuan uhttps://quantum-journal.org/views/qv-2019-08-13-21/01418nas a2200145 4500008004100000245007200041210006900113260001500182300001100197490000600208520097500214100002601189700002001215856003701235 2018 eng d00aFaster Quantum Algorithm to simulate Fermionic Quantum Field Theory0 aFaster Quantum Algorithm to simulate Fermionic Quantum Field The c2018/05/04 a0123320 vA3 a

In quantum algorithms discovered so far for simulating scattering processes in quantum field theories, state preparation is the slowest step. We present a new algorithm for preparing particle states to use in simulation of Fermionic Quantum Field Theory (QFT) on a quantum computer, which is based on the matrix product state ansatz. We apply this to the massive Gross-Neveu model in one spatial dimension to illustrate the algorithm, but we believe the same algorithm with slight modifications can be used to simulate any one-dimensional massive Fermionic QFT. In the case where the number of particle species is one, our algorithm can prepare particle states using O(ε−3.23…) gates, which is much faster than previous known results, namely O(ε−8−o(1)). Furthermore, unlike previous methods which were based on adiabatic state preparation, the method given here should be able to simulate quantum phases unconnected to the free theory.

1 aMoosavian, Ali, Hamed1 aJordan, Stephen uhttps://arxiv.org/abs/1711.0400601691nas a2200169 4500008004100000245007000041210006900111260001500180300001300195490000600208520118500214100002701399700001301426700001901439700002601458856003701484 2018 eng d00aFractal Universality in Near-Threshold Magnetic Lanthanide Dimers0 aFractal Universality in NearThreshold Magnetic Lanthanide Dimers c2018/02/16 aeaap83080 v43 a

Ergodic quantum systems are often quite alike, whereas nonergodic, fractal systems are unique and display characteristic properties. We explore one of these fractal systems, weakly bound dysprosium lanthanide molecules, in an external magnetic field. As recently shown, colliding ultracold magnetic dysprosium atoms display a soft chaotic behavior with a small degree of disorder. We broaden this classification by investigating the generalized inverse participation ratio and fractal dimensions for large sets of molecular wave functions. Our exact close-coupling simulations reveal a dynamic phase transition from partially localized states to totally delocalized states and universality in its distribution by increasing the magnetic field strength to only a hundred Gauss (or 10 mT). Finally, we prove the existence of nonergodic delocalized phase in the system and explain the violation of ergodicity by strong coupling between near-threshold molecular states and the nearby continuum.

1 aMakrides, Constantinos1 aLi, Ming1 aTiesinga, Eite1 aKotochigova, Svetlana uhttps://arxiv.org/abs/1802.0958601617nas a2200157 4500008004100000245012800041210006900169520105700238100001801295700002401313700002101337700001801358700002101376700002501397856003701422 2018 eng d00aFractional quantum Hall phases of bosons with tunable interactions: From the Laughlin liquid to a fractional Wigner crystal0 aFractional quantum Hall phases of bosons with tunable interactio3 a

Highly tunable platforms for realizing topological phases of matter are emerging from atomic and photonic systems, and offer the prospect of designing interactions between particles. The shape of the potential, besides playing an important role in the competition between different fractional quantum Hall phases, can also trigger the transition to symmetry-broken phases, or even to phases where topological and symmetry-breaking order coexist. Here, we explore the phase diagram of an interacting bosonic model in the lowest Landau level at half-filling as two-body interactions are tuned. Apart from the well-known Laughlin liquid, Wigner crystal phase, stripe, and bubble phases, we also find evidence of a phase that exhibits crystalline order at fractional filling per crystal site. The Laughlin liquid transits into this phase when pairs of bosons strongly repel each other at relative angular momentum 4ℏ. We show that such interactions can be achieved by dressing ground-state cold atoms with multiple different-parity Rydberg states.

1 aGraß, Tobias1 aBienias, Przemyslaw1 aGullans, Michael1 aLundgren, Rex1 aMaciejko, Joseph1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/1809.0449301300nas a2200169 4500008004100000245006300041210006300104260001500167300001100182490000700193520081800200100001401018700002001032700002401052700001701076856003701093 2017 eng d00aFast optimization algorithms and the cosmological constant0 aFast optimization algorithms and the cosmological constant c2017/11/13 a1035120 v963 a

Denef and Douglas have observed that in certain landscape models the problem of finding small values of the cosmological constant is a large instance of an NP-hard problem. The number of elementary operations (quantum gates) needed to solve this problem by brute force search exceeds the estimated computational capacity of the observable universe. Here we describe a way out of this puzzling circumstance: despite being NP-hard, the problem of finding a small cosmological constant can be attacked by more sophisticated algorithms whose performance vastly exceeds brute force search. In fact, in some parameter regimes the average-case complexity is polynomial. We demonstrate this by explicitly finding a cosmological constant of order 10−120 in a randomly generated 109 -dimensional ADK landscape.

1 aBao, Ning1 aBousso, Raphael1 aJordan, Stephen, P.1 aLackey, Brad uhttps://arxiv.org/abs/1706.0850322768nas a2200133 45000080041000002450055000412100055000962600015001513000011001664900007001775202237100184100002422555856005522579 2017 eng d00aFast quantum computation at arbitrarily low energy0 aFast quantum computation at arbitrarily low energy c2017/03/06 a0323050 v953 a

One version of the energy-time uncertainty principle states that the minimum time T for a quantum system to evolve from a given state to any orthogonal state is h/(4ΔE), where ΔE is the energy uncertainty. A related bound called the Margolus-Levitin theorem states that Th/(2E), where E is the expectation value of energy and the ground energy is taken to be zero. Many subsequent works have interpreted T as defining a minimal time for an elementary computational operation and correspondingly a fundamental limit on clock speed determined by a system's energy. Here we present local time-independent Hamiltonians in which computational clock speed becomes arbitrarily large relative to E and ΔE as the number of computational steps goes to infinity. We argue that energy considerations alone are not sufficient to obtain an upper bound on computational speed, and that additional physical assumptions such as limits to information density and information transmission speed are necessary to obtain such a bound.

1 aJordan, Stephen, P. uhttp://link.aps.org/doi/10.1103/PhysRevA.95.03230527528nas a2200181 45000080041000002450087000412100069001282600015001973000011002124900008002235202696300231100002227194700001927216700002627235700002327261700002527284856003727309 2017 eng d00aFast State Transfer and Entanglement Renormalization Using Long-Range Interactions0 aFast State Transfer and Entanglement Renormalization Using LongR c2017/10/25 a1705030 v1193 a

In short-range interacting systems, the speed at which entanglement can be established between two separated points is limited by a constant Lieb-Robinson velocity. Long-range interacting systems are capable of faster entanglement generation, but the degree of the speed-up possible is an open question. In this paper, we present a protocol capable of transferring a quantum state across a distance L in d dimensions using long-range interactions with strength bounded by 1/rα. If α<d, the state transfer time is asymptotically independent of L; if α=d, the time is logarithmic in distance L; if d<α<d+1, transfer occurs in time proportional to Lαd; and if αd+1, it occurs in time proportional to L. We then use this protocol to upper bound the time required to create a state specified by a MERA (multiscale entanglement renormalization ansatz) tensor network, and show that, if the linear size of the MERA state is L, then it can be created in time that scales with L identically to state transfer up to multiplicative logarithmic corrections.

1 aEldredge, Zachary1 aGong, Zhe-Xuan1 aMoosavian, Ali, Hamed1 aFoss-Feig, Michael1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/1612.0244204684nas a2200145 4500008004100000245004500041210004500086260001500131520426900146100001804415700002304433700002604456700001904482856003704501 2016 eng d00aFigures of merit for quantum transducers0 aFigures of merit for quantum transducers c2016/10/043 a

Recent technical advances have sparked renewed interest in physical systems that couple simultaneously to different parts of the electromagnetic spectrum, thus enabling transduction of signals between vastly different frequencies at the level of single photons. Such hybrid systems have demonstrated frequency conversion of classical signals and have the potential of enabling quantum state transfer, e.g., between superconducting circuits and traveling optical signals. This Letter describes a simple approach for the theoretical characterization of performance for quantum transducers. Given that, in practice, one cannot attain ideal one-to-one quantum conversion, we will explore how well the transducer performs in various scenarios ranging from classical signal detection to applications for quantum information processing. While the performance of the transducer depends on the particular application in which it enters, we show that the performance can be characterized by defining two simple parameters: the signal transfer efficiency η and the added noise N.

1 aZeuthen, Emil1 aSchliesser, Albert1 aSørensen, Anders, S.1 aTaylor, J., M. uhttps://arxiv.org/abs/1610.0109901044nas a2200133 4500008004100000245005300041210005000094260001500144520066000159100001700819700001800836700001900854856003700873 2016 eng d00aA finite presentation of CNOT-dihedral operators0 afinite presentation of CNOTdihedral operators c2016/12/313 a

We 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.0014001255nas a2200157 4500008004100000245006900041210006900110260001500179300001100194490000700205520078100212100002700993700002201020700001901042856003601061 2016 eng d00aFlight of a heavy particle nonlinearly coupled to a quantum bath0 aFlight of a heavy particle nonlinearly coupled to a quantum bath c2016/01/28 a0143090 v933 a Fluctuation and dissipation are by-products of coupling to the `environment.' The Caldeira-Leggett model, a successful paradigm of quantum Brownian motion, views the environment as a collection of harmonic oscillators linearly coupled to the system. However, symmetry considerations may forbid a linear coupling, e.g. for a neutral particle in quantum electrodynamics. We argue that nonlinear couplings can lead to a fundamentally different behavior. Specifically, we consider a heavy particle quadratically coupled to quantum fluctuations of the bath. In one dimension the particle undergoes anomalous diffusion, unfolding as a power-law distribution in space, reminiscent of L\'{e}vy flights. We suggest condensed matter analogs where similar effects may arise. 1 aMaghrebi, Mohammad, F.1 aKrüger, Matthias1 aKardar, Mehran uhttp://arxiv.org/abs/1508.0058201270nas a2200193 4500008004100000245005700041210005700098260001500155300001100170490000700181520071900188100002700907700002000934700002100954700001700975700002200992700002501014856003701039 2015 eng d00aFractional Quantum Hall States of Rydberg Polaritons0 aFractional Quantum Hall States of Rydberg Polaritons c2015/03/31 a0338380 v913 a We propose a scheme for realizing fractional quantum Hall states of light. In our scheme, photons of two polarizations are coupled to different atomic Rydberg states to form two flavors of Rydberg polaritons that behave as an effective spin. An array of optical cavity modes overlapping with the atomic cloud enables the realization of an effective spin-1/2 lattice. We show that the dipolar interaction between such polaritons, inherited from the Rydberg states, can be exploited to create a flat, topological band for a single spin-flip excitation. At half filling, this gives rise to a photonic (or polaritonic) fractional Chern insulator -- a lattice-based, fractional quantum Hall state of light. 1 aMaghrebi, Mohammad, F.1 aYao, Norman, Y.1 aHafezi, Mohammad1 aPohl, Thomas1 aFirstenberg, Ofer1 aGorshkov, Alexey, V. uhttp://arxiv.org/abs/1411.6624v101280nas a2200133 4500008004100000245005800041210005800099260001500157520087600172100001901048700001901067700002201086856003801108 2015 eng d00aFramework for learning agents in quantum environments0 aFramework for learning agents in quantum environments c2015/07/303 aIn this paper we provide a broad framework for describing learning agents in general quantum environments. We analyze the types of classically specified environments which allow for quantum enhancements in learning, by contrasting environments to quantum oracles. We show that whether or not quantum improvements are at all possible depends on the internal structure of the quantum environment. If the environments are constructed and the internal structure is appropriately chosen, or if the agent has limited capacities to influence the internal states of the environment, we show that improvements in learning times are possible in a broad range of scenarios. Such scenarios we call luck-favoring settings. The case of constructed environments is particularly relevant for the class of model-based learning agents, where our results imply a near-generic improvement. 1 aDunjko, Vedran1 aTaylor, J., M.1 aBriegel, Hans, J. uhttp://arxiv.org/abs/1507.08482v101274nas a2200181 4500008004100000245010400041210006900145260001500214300001200229490000800241520071300249100002100962700001500983700002100998700001901019700001701038856003701055 2015 eng d00aFrom membrane-in-the-middle to mirror-in-the-middle with a high-reflectivity sub-wavelength grating0 aFrom membraneinthemiddle to mirrorinthemiddle with a highreflect c2015/01/02 a81 - 880 v5273 aWe demonstrate a "membrane in the middle" optomechanical system using a silicon nitride membrane patterned as a subwavelength grating. The grating has a reflectivity of over 99.8%, effectively creating two sub-cavities, with free spectral ranges of 6 GHz, optically coupled via photon tunneling. Measurements of the transmission and reflection spectra show an avoided crossing where the two sub-cavities simultaneously come into resonance, with a frequency splitting of 54 MHz. We derive expressions for the lineshapes of the symmetric and antisymmetric modes at the avoided crossing, and infer the grating reflection, transmission, absorption, and scattering through comparison with the experimental data. 1 aStambaugh, Corey1 aXu, Haitan1 aKemiktarak, Utku1 aTaylor, J., M.1 aLawall, John uhttp://arxiv.org/abs/1407.1709v101173nas a2200145 4500008004100000245009200041210007000133260001500203300001100218490000700229520071000236100002000946700002400966856003700990 2014 eng d00aThe Fundamental Gap for a Class of Schrödinger Operators on Path and Hypercube Graphs0 aFundamental Gap for a Class of Schrödinger Operators on Path and c2014/03/06 a0521040 v553 a We consider the difference between the two lowest eigenvalues (the fundamental gap) of a Schr\"{o}dinger operator acting on a class of graphs. In particular, we derive tight bounds for the gap of Schr\"{o}dinger operators with convex potentials acting on the path graph. Additionally, for the hypercube graph, we derive a tight bound for the gap of Schr\"{o}dinger operators with convex potentials dependent only upon vertex Hamming weight. Our proof makes use of tools from the literature of the fundamental gap theorem as proved in the continuum combined with techniques unique to the discrete case. We prove the tight bound for the hypercube graph as a corollary to our path graph results. 1 aJarret, Michael1 aJordan, Stephen, P. uhttp://arxiv.org/abs/1403.1473v101291nas a2200157 4500008004100000245007400041210006900115260001400184490000800198520079400206100002601000700002701026700002301053700002001076856003701096 2013 eng d00aFar from equilibrium quantum magnetism with ultracold polar molecules0 aFar from equilibrium quantum magnetism with ultracold polar mole c2013/2/110 v1103 a Recent theory has indicated how to emulate tunable models of quantum magnetism with ultracold polar molecules. Here we show that present molecule optical lattice experiments can accomplish three crucial goals for quantum emulation, despite currently being well below unit filling and not quantum degenerate. The first is to verify and benchmark the models proposed to describe these systems. The second is to prepare correlated and possibly useful states in well-understood regimes. The third is to explore many-body physics inaccessible to existing theoretical techniques. Our proposal relies on a non-equilibrium protocol that can be viewed either as Ramsey spectroscopy or an interaction quench. It uses only routine experimental tools available in any ultracold molecule experiment. 1 aHazzard, Kaden, R. A.1 aManmana, Salvatore, R.1 aFoss-Feig, Michael1 aRey, Ana, Maria uhttp://arxiv.org/abs/1209.4076v102343nas a2200133 4500008004100000245010800041210006900149260001400218490000700232520189600239100001802135700001902153856003702172 2013 eng d00aFormation and decay of Bose-Einstein condensates in an excited band of a double-well optical lattice 0 aFormation and decay of BoseEinstein condensates in an excited ba c2013/9/120 v883 a We study the formation and collision-aided decay of an ultra-cold atomic Bose-Einstein condensate in the first excited band of a double-well 2D-optical lattice with weak harmonic confinement in the perpendicular $z$ direction. This lattice geometry is based on an experiment by Wirth et al. The double well is asymmetric, with the local ground state in the shallow well nearly degenerate with the first excited state of the adjacent deep well. We compare the band structure obtained from a tight-binding (TB) model with that obtained numerically using a plane wave basis. We find the TB model to be in quantitative agreement for the lowest two bands, qualitative for next two bands, and inadequate for even higher bands. The band widths of the excited bands are much larger than the harmonic oscillator energy spacing in the $z$ direction. We then study the thermodynamics of a non-interacting Bose gas in the first excited band. We estimate the condensate fraction and critical temperature, $T_c$, as functions of lattice parameters. For typical atom numbers, the critical energy $k_BT_c$, with $k_B$ the Boltzmann constant, is larger than the excited band widths and harmonic oscillator energy. Using conservation of total energy and atom number, we show that the temperature increases after the lattice transformation. Finally, we estimate the time scale for a two-body collision-aided decay of the condensate as a function of lattice parameters. The decay involves two processes, the dominant one in which both colliding atoms decay to the ground band, and the second involving excitation of one atom to a higher band. For this estimate, we have used TB wave functions for the lowest four bands, and numerical estimates for higher bands. The decay rate rapidly increases with lattice depth, but stays smaller than the tunneling rate between the $s$ and $p$ orbitals in adjacent wells. 1 aPaul, Saurabh1 aTiesinga, Eite uhttp://arxiv.org/abs/1308.4449v101336nas a2200169 4500008004100000245006500041210006300106260001300169300001600182490000800198520084400206100002301050700001801073700002101091700001701112856003701129 2013 eng d00aA framework for bounding nonlocality of state discrimination0 aframework for bounding nonlocality of state discrimination c2013/9/4 a1121 - 11530 v3233 a We consider the class of protocols that can be implemented by local quantum operations and classical communication (LOCC) between two parties. In particular, we focus on the task of discriminating a known set of quantum states by LOCC. Building on the work in the paper "Quantum nonlocality without entanglement" [BDF+99], we provide a framework for bounding the amount of nonlocality in a given set of bipartite quantum states in terms of a lower bound on the probability of error in any LOCC discrimination protocol. We apply our framework to an orthonormal product basis known as the domino states and obtain an alternative and simplified proof that quantifies its nonlocality. We generalize this result for similar bases in larger dimensions, as well as the "rotated" domino states, resolving a long-standing open question [BDF+99]. 1 aChilds, Andrew, M.1 aLeung, Debbie1 aMancinska, Laura1 aOzols, Maris uhttp://arxiv.org/abs/1206.5822v101702nas a2200157 4500008004100000245004500041210004500086260001400131490000700145520128800152100001801440700001801458700001401476700001701490856003701507 2012 eng d00aFrom Ground States to Local Hamiltonians0 aFrom Ground States to Local Hamiltonians c2012/8/300 v863 a Traditional quantum physics solves ground states for a given Hamiltonian, while quantum information science asks for the existence and construction of certain Hamiltonians for given ground states. In practical situations, one would be mainly interested in local Hamiltonians with certain interaction patterns, such as nearest neighbour interactions on some type of lattices. A necessary condition for a space $V$ to be the ground-state space of some local Hamiltonian with a given interaction pattern, is that the maximally mixed state supported on $V$ is uniquely determined by its reduced density matrices associated with the given pattern, based on the principle of maximum entropy. However, it is unclear whether this condition is in general also sufficient. We examine the situations for the existence of such a local Hamiltonian to have $V$ satisfying the necessary condition mentioned above as its ground-state space, by linking to faces of the convex body of the local reduced states. We further discuss some methods for constructing the corresponding local Hamiltonians with given interaction patterns, mainly from physical points of view, including constructions related to perturbation methods, local frustration-free Hamiltonians, as well as thermodynamical ensembles. 1 aChen, Jianxin1 aJi, Zhengfeng1 aZeng, Bei1 aZhou, D., L. uhttp://arxiv.org/abs/1110.6583v401302nas a2200145 4500008004100000245008300041210006900124260001500193300001200208490000900220520081500229100001901044700001901063856007401082 2012 eng d00aFull Abstraction for Set-Based Models of the Symmetric Interaction Combinators0 aFull Abstraction for SetBased Models of the Symmetric Interactio c2012/01/01 a316-3300 v72133 aThe symmetric interaction combinators are a model of distributed and deterministic computation based on Lafont’s interaction nets, a special form of graph rewriting. The interest of the symmetric interaction combinators lies in their universality, that is, the fact that they may encode all other interaction net systems; for instance, several implementations of the lambda-calculus in the symmetric interaction combinators exist, related to Lamping’s sharing graphs for optimal reduction. A certain number of observational equivalences were introduced for this system, by Lafont, Fernandez and Mackie, and the first author. In this paper, we study the problem of full abstraction with respect to one of these equivalences, using a class of very simple denotational models based on pointed sets.1 aMazza, Damiano1 aRoss, Neil, J. uhttps://lipn.univ-paris13.fr/~mazza/papers/CombSetSem-FOSSACS2012.pdf01407nas a2200157 4500008004100000245006700041210006700108260001400175490000700189520094200196100002201138700001701160700001901177700001601196856003701212 2011 eng d00aFast and robust quantum computation with ionic Wigner crystals0 aFast and robust quantum computation with ionic Wigner crystals c2011/4/150 v833 aWe present a detailed analysis of the modulated-carrier quantum phase gate implemented with Wigner crystals of ions confined in Penning traps. We elaborate on a recent scheme, proposed by two of the authors, to engineer two-body interactions between ions in such crystals. We analyze for the first time the situation in which the cyclotron (w_c) and the crystal rotation (w_r) frequencies do not fulfill the condition w_c=2w_r. It is shown that even in the presence of the magnetic field in the rotating frame the many-body (classical) Hamiltonian describing small oscillations from the ion equilibrium positions can be recast in canonical form. As a consequence, we are able to demonstrate that fast and robust two-qubit gates are achievable within the current experimental limitations. Moreover, we describe a realization of the state-dependent sign-changing dipole forces needed to realize the investigated quantum computing scheme. 1 aBaltrusch, J., D.1 aNegretti, A.1 aTaylor, J., M.1 aCalarco, T. uhttp://arxiv.org/abs/1011.5616v200782nas a2200265 4500008004100000245009300041210006900134300000800203490000600211100001700217700001500234700001800249700001300267700002500280700001700305700001300322700001700335700001700352700001400369700001600383700001500399700002000414700001600434856006600450 2010 eng d00aFar-field optical imaging and manipulation of individual spins with nanoscale resolution0 aFarfield optical imaging and manipulation of individual spins wi a9120 v61 aMaurer, P, C1 aMaze, J, R1 aStanwix, P, L1 aJiang, L1 aGorshkov, Alexey, V.1 aZibrov, A, A1 aHarke, B1 aHodges, J, S1 aZibrov, A, S1 aYacoby, A1 aTwitchen, D1 aHell, S, W1 aWalsworth, R, L1 aLukin, M, D uhttp://www.nature.com/nphys/journal/v6/n11/abs/nphys1774.html01226nas a2200181 4500008004100000245008600041210006900127260001400196490000700210520065700217100002300874700001700897700002500914700002000939700002500959700002300984856003701007 2010 eng d00aFast Entanglement Distribution with Atomic Ensembles and Fluorescent Detection 0 aFast Entanglement Distribution with Atomic Ensembles and Fluores c2010/2/120 v813 a Quantum repeaters based on atomic ensemble quantum memories are promising candidates for achieving scalable distribution of entanglement over long distances. Recently, important experimental progress has been made towards their implementation. However, the entanglement rates and scalability of current approaches are limited by relatively low retrieval and single-photon detector efficiencies. We propose a scheme, which makes use of fluorescent detection of stored excitations to significantly increase the efficiency of connection and hence the rate. Practical performance and possible experimental realizations of the new protocol are discussed. 1 aBrask, Jonatan, B.1 aJiang, Liang1 aGorshkov, Alexey, V.1 aVuletic, Vladan1 aSorensen, Anders, S.1 aLukin, Mikhail, D. uhttp://arxiv.org/abs/0907.3839v201169nas a2200169 4500008004100000245004300041210004300084260001400127300001600141490000700157520072600164100001600890700001800906700001900924700001900943856003700962 2010 eng d00aFeshbach Resonances in Ultracold Gases0 aFeshbach Resonances in Ultracold Gases c2010/4/29 a1225 - 12860 v823 a Feshbach resonances are the essential tool to control the interaction between atoms in ultracold quantum gases. They have found numerous experimental applications, opening up the way to important breakthroughs. This Review broadly covers the phenomenon of Feshbach resonances in ultracold gases and their main applications. This includes the theoretical background and models for the description of Feshbach resonances, the experimental methods to find and characterize the resonances, a discussion of the main properties of resonances in various atomic species and mixed atomic species systems, and an overview of key experiments with atomic Bose-Einstein condensates, degenerate Fermi gases, and ultracold molecules. 1 aChin, Cheng1 aGrimm, Rudolf1 aJulienne, Paul1 aTiesinga, Eite uhttp://arxiv.org/abs/0812.1496v201345nas a2200109 4500008004100000245009200041210006900133260001500202520095700217100002401174856003701198 2008 eng d00aFast quantum algorithms for approximating some irreducible representations of groups 0 aFast quantum algorithms for approximating some irreducible repre c2008/11/043 a We consider the quantum complexity of estimating matrix elements of unitary irreducible representations of groups. For several finite groups including the symmetric group, quantum Fourier transforms yield efficient solutions to this problem. Furthermore, quantum Schur transforms yield efficient solutions for certain irreducible representations of the unitary group. Beyond this, we obtain poly(n)-time quantum algorithms for approximating matrix elements from all the irreducible representations of the alternating group A_n, and all the irreducible representations of polynomial highest weight of U(n), SU(n), and SO(n). These quantum algorithms offer exponential speedup in worst case complexity over the fastest known classical algorithms. On the other hand, we show that average case instances are classically easy, and that the techniques analyzed here do not offer a speedup over classical computation for the estimation of group characters. 1 aJordan, Stephen, P. uhttp://arxiv.org/abs/0811.0562v201388nas a2200145 4500008004100000245009200041210006900133260001300202490000700215520092500222100001401147700001901161700001801180856004401198 2007 eng d00aA fast and robust approach to long-distance quantum communication with atomic ensembles0 afast and robust approach to longdistance quantum communication w c2007/7/20 v763 aQuantum repeaters create long-distance entanglement between quantum systems while overcoming difficulties such as the attenuation of single photons in a fiber. Recently, an implementation of a repeater protocol based on single qubits in atomic ensembles and linear optics has been proposed [Nature 414, 413 (2001)]. Motivated by rapid experimental progress towards implementing that protocol, here we develop a more efficient scheme compatible with active purification of arbitrary errors. Using similar resources as the earlier protocol, our approach intrinsically purifies leakage out of the logical subspace and all errors within the logical subspace, leading to greatly improved performance in the presence of experimental inefficiencies. Our analysis indicates that our scheme could generate approximately one pair per 3 minutes over 1280 km distance with fidelity (F>78%) sufficient to violate Bell's inequality. 1 aJiang, L.1 aTaylor, J., M.1 aLukin, M., D. uhttp://arxiv.org/abs/quant-ph/0609236v301138nas 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/0410123v300806nas a2200121 4500008004100000245006100041210006100102260001400163490000700177520043200184100002400616856004400640 2005 eng d00aFast quantum algorithm for numerical gradient estimation0 aFast quantum algorithm for numerical gradient estimation c2005/7/280 v953 a Given a blackbox for f, a smooth real scalar function of d real variables, one wants to estimate the gradient of f at a given point with n bits of precision. On a classical computer this requires a minimum of d+1 blackbox queries, whereas on a quantum computer it requires only one query regardless of d. The number of bits of precision to which f must be evaluated matches the classical requirement in the limit of large n. 1 aJordan, Stephen, P. uhttp://arxiv.org/abs/quant-ph/0405146v201771nas 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/0504083v201366nas a2200169 4500008004100000245008200041210006900123260001500192490000700207520083000214100002301044700002001067700002201087700002101109700002301130856004301153 2002 eng d00a`Flat Phase' Loading of a Bose-Einstein Condensate into an Optical Lattice 0 aFlat Phase Loading of a BoseEinstein Condensate into an Optical  c2002/11/260 v663 a It has been proposed that the adiabatic loading of a Bose-Einstein Condensate (BEC) into an optical lattice via the Mott-insulator transition can be used to initialize a quantum computer [D. Jaksch, {\it et al.}, Phys. Rev. Lett. {\bf 81}, 3108 (1998)]. The loading of a BEC into the lattice without causing band excitation is readily achievable; however, unless one switches on an optical lattice very slowly, the optical lattice causes a phase to accumulate across the condensate. We show analytically and numerically that a cancellation of this effect is possible by adjusting the harmonic trap force-constant of the magnetic trap appropriately, thereby facilitating quick loading of an optical lattice for quantum computing purposes. A simple analytical theory is developed for a non-stationary BEC in a harmonic trap. 1 aSklarz, Shlomo, E.1 aFriedler, Inbal1 aTannor, David, J.1 aBand, Yehuda, B.1 aWilliams, Carl, J. uhttp://arxiv.org/abs/physics/0209071v101120nas 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/0012104v1