The computational power of random quantum circuits in arbitrary geometries
Matthew DeCross, Reza Haghshenas, Minzhao Liu, Enrico Rinaldi, Johnnie Gray, Yuri Alexeev, Charles H. Baldwin, John P. Bartolotta, Matthew Bohn, Eli Chertkov, J… 展开作者
Matthew DeCross, Reza Haghshenas, Minzhao Liu, Enrico Rinaldi, Johnnie Gray, Yuri Alexeev, Charles H. Baldwin, John P. Bartolotta, Matthew Bohn, Eli Chertkov, Julia Cline, Jonhas Colina, Davide DelVento, Joan M. Dreiling, Cameron Foltz, John P. Gaebler, Thomas M. Gatterman, Christopher N. Gilbreth, Joshua Giles, Dan Gresh, Alex Hall, Aaron Hankin, Azure Hansen, Nathan Hewitt, Ian Hoffman, Craig Holliman, Ross B. Hutson, Trent Jacobs, Jacob Johansen, Patricia J. Lee, Elliot Lehman, Dominic Lucchetti, Danylo Lykov, Ivaylo S. Madjarov, Brian Mathewson, Karl Mayer, Michael Mills, Pradeep Niroula, Juan M. Pino, Conrad Roman, Michael Schecter, Peter E. Siegfried, Bruce G. Tiemann, Curtis Volin, James Walker, Ruslan Shaydulin, Marco Pistoia, Steven. A. Moses, David Hayes, Brian Neyenhuis, Russell P. Stutz, Michael Foss-Feig
备注:
Includes minor updates to the text and an updated author list to include researchers who made technical contributions in upgrading the machine to 56 qubits but were left off the original version by mistake
Empirical evidence for a gap between the computational powers of classical and quantum computers has been provided by experiments that sample the output distributions of two-dimensional quantum circuits. Many attempts to close this gap have utilized classical simulations based on tensor network techniques, and their limitations shed light on the improvements to quantum hardware required to frustrate classical simulability. In particular, quantum computers having in excess of $\sim 50$ qubits are primarily vulnerable to classical simulation due to restrictions on their gate fidelity and their connectivity, the latter determining how many gates are required (and therefore how much infidelity is suffered) in generating highly-entangled states. Here, we describe recent hardware upgrades to Quantinuum's H2 quantum computer enabling it to operate on up to $56$ qubits with arbitrary connectivity and $99.843(5)\%$ two-qubit gate fidelity. Utilizing the flexible connectivity of H2, we present data from random circuit sampling in highly connected geometries, doing so at unprecedented fidelities and a scale that appears to be beyond the capabilities of state-of-the-art classical algorithms. The considerable difficulty of classically simulating H2 is likely limited only by qubit number, demonstrating the promise and scalability of the QCCD architecture as continued progress is made towards building larger machines.
Fluctuating Surface Currents: A New Algorithm for Efficient Prediction of Casimir Interactions among Arbitrary Materials in Arbitrary Geometries. I. Theory
Quantum Hamiltonian simulation of linearised Euler equations in complex geometries
Haiqu, Inc.(海奎公司);Department for Theoretical Physics, Ivan Franko National University of Lviv(利沃夫伊万弗兰科大学理论物理系);Department of Physics, University of Zürich(苏黎世大学物理系)
Open-boundary integrable quantum circuits with different geometries
Instituto Galego de Física de Altas Enerxías (IGFAE), and Departamento de Física de Partículas, Universidade de Santiago de Compostela(加利西亚高能物理研究所,圣地亚哥德孔波斯特拉大学粒子物理系);Department of Physics, Faculty of Mathematics and Physics, University of Ljubljana(卢布尔雅那大学数学与物理学院物理系);Department of Mathematical Sciences, Durham University(杜伦大学数学科学系);Deutsches Elektronen-Synchrotron DESY(德国电子同步加速器)
Simulating quantum circuits with arbitrary local noise using Pauli Propagation
Ecole Polytechnique Fédérale de Lausanne (EPFL)(洛桑联邦理工学院);Freie Universität Berlin(柏林自由大学);Dahlem Center for Complex Quantum Systems, Freie Universität Berlin(柏林自由大学达勒姆复杂量子系统中心);Los Alamos National Laboratory(洛斯阿拉莫斯国家实验室)
Efficient Quantum Circuit Construction of Controlled Time-Evolution for Arbitrary Pauli-Sum Hamiltonians
Faculty of Engineering, Yokohama National University(横滨国立大学工学部);Department of Applied Physics and Physico-Informatics, Keio University(庆应义塾大学应用物理·物理信息系)
Quantum Hashing Circuit Optimization for Arbitrary Qubit Connectivity Graphs Based on 1-Covering Path
Kazan Federal University(喀山联邦大学);Zavoisky Physical-Technical Institute, FRC Kazan Scientific Center of RAS(扎沃伊斯基物理技术研究所,俄罗斯科学院喀山科学中心);University of Messina(墨西拿大学)