Bulletin of the American Physical Society
APS March Meeting 2018
Volume 63, Number 1
Monday–Friday, March 5–9, 2018; Los Angeles, California
Session P39: Quantum Advantage in Nearterm SystemsFocus

Hide Abstracts 
Sponsoring Units: DQI Chair: Animesh Datta, University of Warwick Room: LACC 501B 
Wednesday, March 7, 2018 2:30PM  3:06PM 
P39.00001: Probing manybody dynamics on a largescale quantum simulator Invited Speaker: mikhail lukin We demonstrate a method for the creation of controlled manybody quantum matter that combines deterministically prepared, reconfigurable arrays of individually trapped cold atoms with strong, coherent interactions enabled by excitation to Rydberg states. We realize a programmable Isingtype quantum spin model with tunable interactions and system sizes up to 51 qubits. Using this approach, we observe transitions into ordered states that break various discrete symmetries, verify their highfidelity preparation, and investigate dynamics across the phase transition . In particular, we observe novel, robust manybody dynamics corresponding to persistent oscillations of the order after a sudden quantum quench, investigate quantum critical regimes with different universality classes and probe entanglement dynamics within this system. Finally, prospects for realization and testing of quantum optimization algorithms will be discussed. 
Wednesday, March 7, 2018 3:06PM  3:18PM 
P39.00002: Optimal quantum algorithms to simulate strongly correlated fermionic systems Zhang Jiang, Kevin Sung, Kostyantyn Kechedzhi, Vadim Smelyanskiy, Sergio Boixo We discuss quantum simulation of strongly correlated fermionic lattice models with nearestneighbor interacting qubit arrays. We improve an existing quantum algorithm to prepare arbitrary Slater determinants by exploiting a symmetry in their representations. We present a quantum algorithm to prepare an arbitrary fermionic Gaussian state with O(N^{2}) gates and O(N) circuit depth. This algorithmunlike existing ones that rely on translational symmetryis completely general and is useful to simulating disordered systems and quantum impurity models. These two algorithms are optimal because the numbers of gates equal to the numbers of parameters to describe the quantum states to be prepared. We also present an algorithm to implement the 2dimensional (2D) fermionic Fourier transformation on a 2D qubit array with O(N^{1.5}) gates and O(N^{1/2}) circuit depth. Both scalings are optimal because they represent the minimum cost for quantum information to travel through the qubit array. We also present methods to simulate each time step in the evolution of the 2D Hubbard modelagain on a 2D qubit arraywith O(N) gates and O(N^{1/2}) circuit depth. Finally, we discuss the physical significance of these algorithms using the FermiHubbard model as an example. 
Wednesday, March 7, 2018 3:18PM  3:30PM 
P39.00003: Boson sampling of multiple quantum random walkers on a lattice Gopikrishnan Muraleedharan, Ivan Deutsch, Akimasa Miyake A quantum device capable of performing an informationprocessing task more efficiently than current state of the art classical computers is said to demonstrate “quantum supremacy”. One path to achieving this in the short term is via “sampling complexity;” random samples are drawn from a probability distribution by measuring a complex quantum state in a defined basis. Surprisingly, a gas of identical noninteracting bosons can yield sampling complexity due solely to quantum statistics, as shown by Aaronson and Arkhipov, dubbed “boson sampling,” in the context of identical photons scattering from a linear optical network. We generalize this to noninteracting bosonic quantum random walkers on a 1D lattice. We study the quantum complexity of the probability distribution obtained through a discretetime quantum random walk. Here the goal is to approximate a Haarrandom unitary map on a single boson, and quantum statistics yields the manybody complexity. We consider a physical realization based on controlled transport of ultracold atoms in a spinor optical lattice. We quantify the degree of randomness (and thus complexity) of the unitarity map using different techniques from random matrix theory, unitary tdesigns, and Renyi entropy. 
Wednesday, March 7, 2018 3:30PM  3:42PM 
P39.00004: Feeding the multitude: A polynomialtime algorithm to improve sampling of degenerate optimization problems Helmut Katzgraber, Andrew Ochoa, Darryl Jacob, Salvatore Mandra A wide variety of optimization techniques, both exact and heuristic, tend to be biased samplers. This means that when attempting to find multiple uncorrelated solutions of a degenerate Boolean optimization problem a subset of the solution space tends to be favored while, in the worst case, some solutions can never be accessed by the employed algorithm. Here we present a simple postprocessing technique that improves sampling for any optimization technique. Starting from a pool of known optima, the algorithm generates potentially new solutions via rejectionfree cluster updates at zero temperature. Although the method is not ergodic and there is no guarantee that any new states can be found, the solution pool is typically increased. We illustrate our results on exponentiallybiased data produced on the DWave 2X quantum annealer. 
Wednesday, March 7, 2018 3:42PM  3:54PM 
P39.00005: Noiseresilient quantum circuits Isaac Kim, Brian Swingle Certain quantum circuits are shown to be surprisingly resilient to noise. The circuit depth scales with the system size, but even without error correction, loworder correlation functions are perturbed at most by an amount comparable to the noise strength, independent of the system size. These circuits can be run on a noisy quantum computer of moderate size to assist variational calculations of various tensor networks. In particular, the dependence of the computational cost on the variational parameters can be exponentially reduced by the quantum computer. We estimate the computational cost based on realistic physical parameters, and find that it is far smaller than the cost of classical computation. 
Wednesday, March 7, 2018 3:54PM  4:06PM 
P39.00006: Boson Sampling in the Frequency Domain Chaitali Joshi, Alessandro Farsi, Alexander Gaeta We present a scheme to perform Boson sampling using frequency modes that results in significantly reduced losses and experimental complexity as compared to existing spatial mode implementations. Boson sampling is computationally intractable on a classical computer but can be efficiently performed using a linear optical network. Our scheme uses Braggscattering four wave mixing (BSFWM), a thirdorder nonlinear process to achieve coherent interaction between a large number of frequency modes mediated by strong classical pumps and has distinct advantages over spatial mode implementations. While spatial beam splitters couple only nearest neighbors, it is straightforward to create highly delocalized nonnearest neighbor couplings using BSFWM, leading to complex unitary interaction with fewer resources. Moreover, the interaction takes place in a single nonlinear fiber, resulting in fixed loss independent of the number of modes. To demonstrate experimental feasibility, we show HongOuMandel interference between correlated photons of distinct frequencies, using BSFWM as a frequency beam splitter. We believe our scheme addresses multiple challenges to scale Boson Sampling to the regime of 2030 photons, which could provide confirmation for quantum speedup over classical simulations. 
Wednesday, March 7, 2018 4:06PM  4:18PM 
P39.00007: Randomized Benchmarking with Restricted Gate Sets Winton Brown, Bryan Eastin Standard randomized benchmarking protocols require sampling from a unitary 2design, which is not always practical. In this talk I examine randomized benchmarking protocols based on subgroups of the Clifford group that are not unitary 2designs. I show in a variety of cases that one can benchmark the error probability to within a small factor that rapidly approaches unity as the number of qubits in the benchmarking experiment grows. 
Wednesday, March 7, 2018 4:18PM  4:30PM 
P39.00008: The Effect of Coherent Errors in Error Correction Joseph Iverson, John Preskill The first threshold theorems for fault tolerant quantum computation assumed a stochastic error model. More recently there has been interest in coherent errors, because under these errors the error rate can grow quadratically instead of linearly. Even with the same error rate per gate, a coherent error model could have orders of magnitude larger error for the whole computation. Past work on coherent errors has focused on a constant singlequbit coherent error as a simple case. This work treats coherent, Markovian noise with arbitrary correlations in space using a random ensemble approach. The noise at each time step is drawn from some distribution on the space of channels. We work with an arbitrary family of stabilizer codes paired with a family of ensemble noise models and prove that if the correlations for the noise models satisfy a bound, the logical error rate and the residual logical noise approach the incoherent answer. We present a modified threshold theorem that gives conditions on the noise models such that an arbitrary length computation can be successfully performed. 
Wednesday, March 7, 2018 4:30PM  4:42PM 
P39.00009: General errortransparent quantum gates for faulttolerant quantum computation WenLong Ma, Liang Jiang Errortransparent (ET) quantum gates have recently been proposed for small logical qubit architectures [arXiv:1703.09762]. The key idea is to design the Hamiltonian evolution for an ET logical quantum gate, so that it commutes with all first order error processes which may occur anytime during the evolution. Even if the error occurs in the mid of the evolution, it will be detected/corrected at the end of the evolution without compromising the encoded quantum information. We provide a general construction of ET logical quantum gates for any quantum error correction code. In addition, we investigate practical implementation of ET logical quantum gates with circuit QED systems. 
Wednesday, March 7, 2018 4:42PM  4:54PM 
P39.00010: Quantum inspired tempering Christopher Pattison, Helmut Katzgraber We introduce a replica exchange heuristic based on the Shin Smith Smolin 
Wednesday, March 7, 2018 4:54PM  5:06PM 
P39.00011: Imaging incoherent point sources with quantuminspired measurements Kent BonsmaFisher, Edwin Tham, Hugo Ferretti, Aephraim Steinberg Every imaging technique has a resolution limit. The ability to image closelyseparated point sources faces the diffraction limit, or “Rayleigh’s curse”. However, recent progress by Tsang et al. [Phys. Rev. X 6, 031033 (2016), New Journ. Phys. 19, 023054 (2017)] has dispelled the curse: the separation of two incoherent point sources has a nonvanishing Fisher information even as the separation goes to zero. The separation, and any statistical moment of the source distribution, can be estimated using quantuminformationinspired measurements that address information contained in the full electromagnetic field rather than the intensity alone. There has been an upstart of experiments showing this advantage over direct imaging techniques. In this talk I will review the recent experimental progress in our group [Phys. Rev. Lett. 118, 070801 (2017)] which demonstrates an improved ability to estimate the separation distance between two sources, and our continuing efforts towards implementing these measurements in realistic imaging scenarios. 
Wednesday, March 7, 2018 5:06PM  5:18PM 
P39.00012: Searching for Axion Dark Matter using Superconducting Qubits Akash Dixit, S. Chakram, R. Naik, A. Agrawal, J. KudlerFlam, A. Chou, D. I. Schuster A transmon qubit can be operated in a resonant cavity as a sensor of a single microwave photon produced by the interaction between axion dark matter and a laboratory magnetic field. The axion is a potential solution to the strong CP problem in QCD and could account for the abundance of dark matter observed in the universe. In the presence of an applied magnetic field, the axion field will source a current that can be harnessed to drive a resonant cavity to single photon occupation. When weakly coupled to the detection cavity through a dipole interaction, the qubit transition frequency shift is used to measure the cavity photon number. The use of a direct dispersive quantum nondemolition measurement of the photon number decouples the measurement induced back action from the experimental uncertainties. 
Follow Us 
Engage
Become an APS Member 
My APS
Renew Membership 
Information for 
About APSThe American Physical Society (APS) is a nonprofit membership organization working to advance the knowledge of physics. 
© 2020 American Physical Society
 All rights reserved  Terms of Use
 Contact Us
Headquarters
1 Physics Ellipse, College Park, MD 207403844
(301) 2093200
Editorial Office
1 Research Road, Ridge, NY 119612701
(631) 5914000
Office of Public Affairs
529 14th St NW, Suite 1050, Washington, D.C. 200452001
(202) 6628700