Classical Simulation of Quantum Computation

Tzvetan S. Metodi, Arvin I. Faruque, Frederic T. Chong

Alan M. Kadin

•Classical superconducting circuit simulators are powerful and available. •Include Josephson junction as basic element. •Provide efficient time-domain simulations of complex circuits. •May show effects otherwise attributed to quantum circuits. •Circuits of coupled superconducting qubits are being developed for quantum computing (QC). •Entangled quantum theory incompatible with classical simulators. •Quantum model difficult to simulate on conventional computers for complex circuits already being tested. •Classical circuit simulations should provide the baseline to compare with quantum effects, but this is seldom done. •Coupled oscillators are delocalized even in classical limit.

Tzvetan S. Metodi, Frederic T. Chong

Xin-Chuan Wu

Quantum computing (QC) aims to solve certain computational problems beyond the capabilities of even the largest classical high-performance computers. By leveraging the quantum mechanical principles of superposition and entanglement, QC algorithms have the potential to revolutionize areas such as machine learning, quantum chemistry, and cryptography. To perform quantum advantages, a scalable quantum computing system is essential. This thesis demonstrates techniques that address problems of the development of scalable quantum computers. The first part of the thesis describes our technique to perform scalable quantum circuit optimization by using synthesis. Traditional quantum synthesis can only be used for circuits on a handful of qubits. The proposed technique partitions the circuit into multiple small pieces of circuits and performs quantum synthesis individually. This technique enables quantum circuit synthesis for large circuits. The second section is the design and evaluation of the trapped-ion linear-tape architecture. This study provides an alternative idea towards scalable quantum computing systems. The last section of the thesis is our technique to increase the capability of quantum circuit simulation on classical supercomputing systems. Our hybrid data compression technique is introduced into the simulation of quantum computing. This work allows us to further push the limit of classical simulation, and hence verify a larger size of quantum computing systems.

Richard Jozsa

Jeongho Bang, Junghee Ryu, Chang‐Woo Lee +3 more

A model of quantum computation (QC) is compared with a generalized classical computation model, named stochastic ensemble computation (SEnC), in article number 1800037 by Jeongho Bang, Jinhyoung Lee, Wonmin Son and co-workers. SEnC runs in an ensemble consisting of finite copies of single probabilistic entities, and hence is a generalized probabilistic Turing machine. Impossibility of simulating a QC in the SEnC is proved, manifesting “QC is characterized beyond any classical probabilistic computation,” i.e., SEnC ⊆ QC.