Skip to main content

Logical abstractions for noisy variational Quantum algorithm simulation

Author(s): Huang, Yipeng; Holtzen, Steven; Millstein, Todd; Van den Broeck, Guy; Martonosi, Margaret

Download
To refer to this page use: http://arks.princeton.edu/ark:/88435/pr15p01
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHuang, Yipeng-
dc.contributor.authorHoltzen, Steven-
dc.contributor.authorMillstein, Todd-
dc.contributor.authorVan den Broeck, Guy-
dc.contributor.authorMartonosi, Margaret-
dc.date.accessioned2021-10-08T19:51:16Z-
dc.date.available2021-10-08T19:51:16Z-
dc.date.issued2021en_US
dc.identifier.citationHuang, Yipeng, Steven Holtzen, Todd Millstein, Guy Van den Broeck, and Margaret Martonosi. "Logical abstractions for noisy variational Quantum algorithm simulation." In Proceedings of the 26th ACM International Conference on Architectural Support for Programming Languages and Operating Systems (2021): pp. 456-472. doi:10.1145/3445814.3446750en_US
dc.identifier.urihttps://arxiv.org/pdf/2103.17226.pdf-
dc.identifier.urihttp://arks.princeton.edu/ark:/88435/pr15p01-
dc.description.abstractDue to the unreliability and limited capacity of existing quantum computer prototypes, quantum circuit simulation continues to be a vital tool for validating next generation quantum computers and for studying variational quantum algorithms, which are among the leading candidates for useful quantum computation. Existing quantum circuit simulators do not address the common traits of variational algorithms, namely: 1) their ability to work with noisy qubits and operations, 2) their repeated execution of the same circuits but with different parameters, and 3) the fact that they sample from circuit final wavefunctions to drive a classical optimization routine. We present a quantum circuit simulation toolchain based on logical abstractions targeted for simulating variational algorithms. Our proposed toolchain encodes quantum amplitudes and noise probabilities in a probabilistic graphical model, and it compiles the circuits to logical formulas that support efficient repeated simulation of and sampling from quantum circuits for different parameters. Compared to state-of-the-art state vector and density matrix quantum circuit simulators, our simulation approach offers greater performance when sampling from noisy circuits with at least eight to 20 qubits and with around 12 operations on each qubit, making the approach ideal for simulating near-term variational quantum algorithms. And for simulating noise-free shallow quantum circuits with 32 qubits, our simulation approach offers a 66× reduction in sampling cost versus quantum circuit simulation techniques based on tensor network contraction.en_US
dc.format.extent456 - 472en_US
dc.language.isoen_USen_US
dc.relation.ispartofProceedings of the 26th ACM International Conference on Architectural Support for Programming Languages and Operating Systemsen_US
dc.rightsAuthor's manuscripten_US
dc.titleLogical abstractions for noisy variational Quantum algorithm simulationen_US
dc.typeConference Articleen_US
dc.identifier.doi10.1145/3445814.3446750-
pu.type.symplectichttp://www.symplectic.co.uk/publications/atom-terms/1.0/conference-proceedingen_US

Files in This Item:
File Description SizeFormat 
LogicalAbstract.pdf1.41 MBAdobe PDFView/Download


Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.