{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T19:40:02Z","timestamp":1770061202369,"version":"3.49.0"},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1109\/tit.2020.3004427","type":"journal-article","created":{"date-parts":[[2020,6,23]],"date-time":"2020-06-23T20:41:12Z","timestamp":1592944872000},"page":"5585-5600","source":"Crossref","is-referenced-by-count":16,"title":["Explicit Lower Bounds on Strong Quantum Simulation"],"prefix":"10.1109","volume":"66","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7466-8033","authenticated-orcid":false,"given":"Cupjin","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6640-1072","authenticated-orcid":false,"given":"Michael","family":"Newman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mario","family":"Szegedy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","author":"nielsen","year":"2002","journal-title":"Quantum Computation and Quantum Information"},{"key":"ref38","first-page":"1089","article-title":"Fine grained quantum computational supremacy","volume":"19","author":"morimae","year":"2019","journal-title":"Quantum Inf Comput"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/1066100.1066101"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1997.646146"},{"key":"ref31","article-title":"Tensor network complexity of multilinear maps","author":"austrin","year":"2017","journal-title":"arXiv 1712 09630"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2010.01.010"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1137\/0218053"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2006.6"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/120868177"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814612"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.116.250501"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.87.022328"},{"key":"ref11","article-title":"Classical simulation of quantum computation, the Gottesman-Knill theorem, and slightly beyond","author":"van den nest","year":"2008","journal-title":"arXiv 0811 0898"},{"key":"ref12","article-title":"How many qubits are needed for quantum computational supremacy?","author":"dalzell","year":"2018","journal-title":"arXiv 1805 05224"},{"key":"ref13","article-title":"From estimation of quantum probabilities to simulation of quantum circuits","author":"pashayan","year":"2017","journal-title":"arXiv 1712 02806"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1774"},{"key":"ref15","article-title":"Simulation of quantum circuits by low-rank stabilizer decompositions","author":"bravyi","year":"2018","journal-title":"arxiv 1808 00128"},{"key":"ref16","author":"feynman","year":"1965","journal-title":"Quantum Mechanics and Path Integrals"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/050644756"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/BF02165411"},{"key":"ref19","first-page":"32","article-title":"The Heisenberg representation of quantum computers","author":"gottesman","year":"1999","journal-title":"Proc 22nd Int Colloq Group Theor Methods Phys"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1364\/QIM.2014.QTh1A.2"},{"key":"ref4","article-title":"Simulation of low-depth quantum circuits as complex undirected graphical models","author":"boixo","year":"2017","journal-title":"arXiv 1712 05384"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.80.054302"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.22331\/q-2018-08-06-79"},{"key":"ref6","article-title":"Classical simulation of intermediate-size quantum circuits","author":"chen","year":"2018","journal-title":"arXiv 1805 01450"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107325708"},{"key":"ref5","first-page":"22","article-title":"Complexity-theoretic foundations of quantum supremacy experiments","author":"aaronson","year":"2017","journal-title":"Proc 32nd Comput Complex Conf"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3126908.3126947"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.scib.2018.06.007"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1038\/s41567-018-0124-x"},{"key":"ref9","article-title":"Breaking the 49-qubit barrier in the simulation of quantum circuits","author":"pednault","year":"2017","journal-title":"arXiv 1710 05867"},{"key":"ref1","article-title":"Quantum computing and the entanglement frontier","author":"preskill","year":"2012","journal-title":"arXiv 1203 5813"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700377025"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.6.021043"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.70.052328"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/322326.322341"},{"key":"ref41","article-title":"Quantum supremacy through the quantum approximate optimization algorithm","author":"farhi","year":"2016","journal-title":"arXiv 1602 07674"},{"key":"ref23","article-title":"Non-identity check remains QMA-complete for short circuits","author":"ji","year":"2009","journal-title":"arXiv 0906 5416"},{"key":"ref26","article-title":"Quantum supremacy and the complexity of random circuit sampling","author":"bouland","year":"2018","journal-title":"arXiv 1803 04402"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1088\/1751-8121\/aa565f"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9170933\/09123426.pdf?arnumber=9123426","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T17:31:29Z","timestamp":1651080689000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9123426\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9]]},"references-count":41,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tit.2020.3004427","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9]]}}}