Classical Simulation of Quantum Supremacy Circuits

• URL: http://arxiv.org/abs/2005.06787v1
• Date: Thu, 14 May 2020 07:57:38 GMT
• Title: Classical Simulation of Quantum Supremacy Circuits
• Authors: Cupjin Huang, Fang Zhang, Michael Newman, Junjie Cai, Xun Gao, Zhengxiong Tian, Junyin Wu, Haihong Xu, Huanjun Yu, Bo Yuan, Mario Szegedy, Yaoyun Shi, Jianxin Chen
• Abstract summary: It is believed that random quantum circuits are difficult to simulate classically. In this work, we present a network-based classical simulation algorithm. We estimate that our simulator can perform this task in less than 20 days.
• Score: 11.913526591569632
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: It is believed that random quantum circuits are difficult to simulate classically. These have been used to demonstrate quantum supremacy: the execution of a computational task on a quantum computer that is infeasible for any classical computer. The task underlying the assertion of quantum supremacy by Arute et al. (Nature, 574, 505--510 (2019)) was initially estimated to require Summit, the world's most powerful supercomputer today, approximately 10,000 years. The same task was performed on the Sycamore quantum processor in only 200 seconds. In this work, we present a tensor network-based classical simulation algorithm. Using a Summit-comparable cluster, we estimate that our simulator can perform this task in less than 20 days. On moderately-sized instances, we reduce the runtime from years to minutes, running several times faster than Sycamore itself. These estimates are based on explicit simulations of parallel subtasks, and leave no room for hidden costs. The simulator's key ingredient is identifying and optimizing the "stem" of the computation: a sequence of pairwise tensor contractions that dominates the computational cost. This orders-of-magnitude reduction in classical simulation time, together with proposals for further significant improvements, indicates that achieving quantum supremacy may require a period of continuing quantum hardware developments without an unequivocal first demonstration.

Related papers

• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• Fast classical simulation of Harvard/QuEra IQP circuits [4.415661493715816]
  A quantum advantage is achieved once a certain computational capability of a quantum computer is so complex that it can no longer be reproduced by classical means. We report a classical simulation algorithm that takes only $0.00947$ seconds to compute an amplitude for a $48$-qubit computation. Our algorithm is furthermore not subject to a significant decline in performance due to the additional CNOT layers.
  arXiv  Detail & Related papers  (2024-02-05T17:22:41Z)
• Parallelizing quantum simulation with decision diagrams [2.5999037208435705]
  Classical computers face a critical obstacle in simulating quantum algorithms. Quantum states reside in a Hilbert space whose size grows exponentially to the number of subsystems, i.e., qubits. This work explores several strategies for parallelizing decision diagram operations, specifically for quantum simulations.
  arXiv  Detail & Related papers  (2023-12-04T02:00:24Z)
• Fast classical simulation of evidence for the utility of quantum computing before fault tolerance [0.0]
  We show that a classical algorithm based on sparse Pauli dynamics can efficiently simulate quantum circuits studied in a recent experiment on 127 qubits of IBM's Eagle processor. Our simulations on a single core of a laptop are orders of magnitude faster than the reported walltime of the quantum simulations, and are in good agreement with the zero-noise extrapolated experimental results.
  arXiv  Detail & Related papers  (2023-06-28T17:08:00Z)
• Quantum Clustering with k-Means: a Hybrid Approach [117.4705494502186]
  We design, implement, and evaluate three hybrid quantum k-Means algorithms. We exploit quantum phenomena to speed up the computation of distances. We show that our hybrid quantum k-Means algorithms can be more efficient than the classical version.
  arXiv  Detail & Related papers  (2022-12-13T16:04:16Z)
• Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
  We present an approach where the quantum computation is supplemented by a classical result. Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative. In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
  arXiv  Detail & Related papers  (2022-09-12T15:47:44Z)
• Recompilation-enhanced simulation of electron-phonon dynamics on IBM Quantum computers [62.997667081978825]
  We consider the absolute resource cost for gate-based quantum simulation of small electron-phonon systems. We perform experiments on IBM quantum hardware for both weak and strong electron-phonon coupling. Despite significant device noise, through the use of approximate circuit recompilation we obtain electron-phonon dynamics on current quantum computers comparable to exact diagonalisation.
  arXiv  Detail & Related papers  (2022-02-16T19:00:00Z)
• Parallel Simulation of Quantum Networks with Distributed Quantum State Management [56.24769206561207]
  We identify requirements for parallel simulation of quantum networks and develop the first parallel discrete event quantum network simulator. Our contributions include the design and development of a quantum state manager that maintains shared quantum information distributed across multiple processes. We release the parallel SeQUeNCe simulator as an open-source tool alongside the existing sequential version.
  arXiv  Detail & Related papers  (2021-11-06T16:51:17Z)
• Redefining the Quantum Supremacy Baseline With a New Generation Sunway Supercomputer [17.816108993297664]
  A major milestone in the era of noisy intermediate scale quantum computers is textitquantum supremacy [Nature textbf574, 505] claimed on the Sycamore quantum processor of $53$ qubits. This record has been renewed with two recent experiments on the Zuchongzhi $2.0$ ($56$ qubits) and Zuchongzhi $2.1$ ($60$ qubits) quantum processors. Here we report the full-scale simulations of these problems on new generation Sunway supercomputer, based on a customized tensor network contraction algorithm.
  arXiv  Detail & Related papers  (2021-11-01T16:28:51Z)
• Doubling the size of quantum simulators by entanglement forging [2.309018557701645]
  Quantum computers are promising for simulations of chemical and physical systems. We present a method, classical entanglement forging, that harnesses classical resources to capture quantum correlations. We compute the ground state energy of a water molecule in the most accurate simulation to date.
  arXiv  Detail & Related papers  (2021-04-20T19:32:37Z)
• Quantum Deformed Neural Networks [83.71196337378022]
  We develop a new quantum neural network layer designed to run efficiently on a quantum computer. It can be simulated on a classical computer when restricted in the way it entangles input states.
  arXiv  Detail & Related papers  (2020-10-21T09:46:12Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.