{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T15:41:51Z","timestamp":1772725311256,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":70,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,11,17]],"date-time":"2019-11-17T00:00:00Z","timestamp":1573948800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1619253"],"award-info":[{"award-number":["1619253"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"EPiQC, an NSF Expedition in Computing","award":["CCF-1730449\/1832377"],"award-info":[{"award-number":["CCF-1730449\/1832377"]}]},{"name":"STAQ","award":["NSF Phy-1818914"],"award-info":[{"award-number":["NSF Phy-1818914"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,11,17]]},"DOI":"10.1145\/3295500.3356155","type":"proceedings-article","created":{"date-parts":[[2019,11,7]],"date-time":"2019-11-07T19:43:22Z","timestamp":1573155802000},"page":"1-24","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":113,"title":["Full-state quantum circuit simulation by using data compression"],"prefix":"10.1145","author":[{"given":"Xin-Chuan","family":"Wu","sequence":"first","affiliation":[{"name":"University of Chicago"}]},{"given":"Sheng","family":"Di","sequence":"additional","affiliation":[{"name":"Mathematics and Computer Science Division, Argonne National Laboratory Lemont, Illinois"}]},{"given":"Emma Maitreyee","family":"Dasgupta","sequence":"additional","affiliation":[{"name":"University of Chicago"}]},{"given":"Franck","family":"Cappello","sequence":"additional","affiliation":[{"name":"Argonne National Laboratory Lemont"}]},{"given":"Hal","family":"Finkel","sequence":"additional","affiliation":[{"name":"Argonne National Laboratory Lemont"}]},{"given":"Yuri","family":"Alexeev","sequence":"additional","affiliation":[{"name":"Argonne National Laboratory Lemont"}]},{"given":"Frederic T.","family":"Chong","sequence":"additional","affiliation":[{"name":"University of Chicago, Chicago"}]}],"member":"320","published-online":{"date-parts":[[2019,11,17]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Complexity-theoretic foundations of quantum supremacy experiments. arXiv preprint arXiv:1612.05903","author":"Aaronson Scott","year":"2016","unstructured":"Scott Aaronson and Lijie Chen . 2016. Complexity-theoretic foundations of quantum supremacy experiments. arXiv preprint arXiv:1612.05903 ( 2016 ). Scott Aaronson and Lijie Chen. 2016. Complexity-theoretic foundations of quantum supremacy experiments. arXiv preprint arXiv:1612.05903 (2016)."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.70.052328"},{"key":"e_1_3_2_1_3_1","volume-title":"MCDRAM as High-Bandwidth Memory (HBM) in Knights Landing processors: developers guide. Colfax International","author":"Asai Ryo","year":"2016","unstructured":"Ryo Asai . 2016. MCDRAM as High-Bandwidth Memory (HBM) in Knights Landing processors: developers guide. Colfax International ( 2016 ). Ryo Asai. 2016. MCDRAM as High-Bandwidth Memory (HBM) in Knights Landing processors: developers guide. Colfax International (2016)."},{"key":"e_1_3_2_1_4_1","volume-title":"Brooks Campbell, et al.","author":"Barends Rami","year":"2014","unstructured":"Rami Barends , Julian Kelly , Anthony Megrant , Andrzej Veitia , Daniel Sank , Evan Jeffrey , Ted C White , Josh Mutus , Austin G Fowler , Brooks Campbell, et al. 2014 . Superconducting quantum circuits at the surface code threshold for fault tolerance. Nature 508, 7497 (2014), 500. Rami Barends, Julian Kelly, Anthony Megrant, Andrzej Veitia, Daniel Sank, Evan Jeffrey, Ted C White, Josh Mutus, Austin G Fowler, Brooks Campbell, et al. 2014. Superconducting quantum circuits at the surface code threshold for fault tolerance. Nature 508, 7497 (2014), 500."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.54.3824"},{"key":"e_1_3_2_1_6_1","series-title":"SIAM Journal on computing 26, 5","volume-title":"Quantum complexity theory","author":"Bernstein Ethan","year":"1997","unstructured":"Ethan Bernstein and Umesh Vazirani . 1997. Quantum complexity theory . SIAM Journal on computing 26, 5 ( 1997 ), 1411--1473. Ethan Bernstein and Umesh Vazirani. 1997. Quantum complexity theory. SIAM Journal on computing 26, 5 (1997), 1411--1473."},{"key":"e_1_3_2_1_7_1","volume-title":"Tensor networks in a nutshell. arXiv preprint arXiv:1708.00006","author":"Biamonte Jacob","year":"2017","unstructured":"Jacob Biamonte and Ville Bergholm . 2017. Tensor networks in a nutshell. arXiv preprint arXiv:1708.00006 ( 2017 ). Jacob Biamonte and Ville Bergholm. 2017. Tensor networks in a nutshell. arXiv preprint arXiv:1708.00006 (2017)."},{"key":"e_1_3_2_1_8_1","unstructured":"BlosC compressor. [n. d.]. http:\/\/blosc.org\/. Online.  BlosC compressor. [n. d.]. http:\/\/blosc.org\/. Online."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41567-018-0124-x"},{"key":"e_1_3_2_1_10_1","volume-title":"Simulation of low-depth quantum circuits as complex undirected graphical models. arXiv preprint arXiv:1712.05384","author":"Boixo Sergio","year":"2017","unstructured":"Sergio Boixo , Sergei V Isakov , Vadim N Smelyanskiy , and Hartmut Neven . 2017. Simulation of low-depth quantum circuits as complex undirected graphical models. arXiv preprint arXiv:1712.05384 ( 2017 ). Sergio Boixo, Sergei V Isakov, Vadim N Smelyanskiy, and Hartmut Neven. 2017. Simulation of low-depth quantum circuits as complex undirected graphical models. arXiv preprint arXiv:1712.05384 (2017)."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.98.062339"},{"key":"e_1_3_2_1_12_1","volume-title":"Teleportation as a quantum computation. arXiv preprint quant-ph\/9605035","author":"Brassard Gilles","year":"1996","unstructured":"Gilles Brassard . 1996. Teleportation as a quantum computation. arXiv preprint quant-ph\/9605035 ( 1996 ). Gilles Brassard. 1996. Teleportation as a quantum computation. arXiv preprint quant-ph\/9605035 (1996)."},{"key":"e_1_3_2_1_13_1","volume-title":"Improved classical simulation of quantum circuits dominated by Clifford gates. Physical review letters 116, 25","author":"Bravyi Sergey","year":"2016","unstructured":"Sergey Bravyi and David Gosset . 2016. Improved classical simulation of quantum circuits dominated by Clifford gates. Physical review letters 116, 25 ( 2016 ), 250501. Sergey Bravyi and David Gosset. 2016. Improved classical simulation of quantum circuits dominated by Clifford gates. Physical review letters 116, 25 (2016), 250501."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2008.131"},{"key":"e_1_3_2_1_15_1","volume-title":"Classical simulation of intermediate-size quantum circuits. arXiv preprint arXiv:1805.01450","author":"Chen Jianxin","year":"2018","unstructured":"Jianxin Chen , Fang Zhang , Mingcheng Chen , Cupjin Huang , Michael Newman , and Yaoyun Shi . 2018. Classical simulation of intermediate-size quantum circuits. arXiv preprint arXiv:1805.01450 ( 2018 ). Jianxin Chen, Fang Zhang, Mingcheng Chen, Cupjin Huang, Michael Newman, and Yaoyun Shi. 2018. Classical simulation of intermediate-size quantum circuits. arXiv preprint arXiv:1805.01450 (2018)."},{"key":"e_1_3_2_1_16_1","volume-title":"64-qubit quantum circuit simulation. Science Bulletin","author":"Chen Zhao-Yun","year":"2018","unstructured":"Zhao-Yun Chen , Qi Zhou , Cheng Xue , Xia Yang , Guang-Can Guo , and Guo-Ping Guo . 2018. 64-qubit quantum circuit simulation. Science Bulletin ( 2018 ). Zhao-Yun Chen, Qi Zhou, Cheng Xue, Xia Yang, Guang-Can Guo, and Guo-Ping Guo. 2018. 64-qubit quantum circuit simulation. Science Bulletin (2018)."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1098\/rspa.1998.0164"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/9\/8\/301"},{"key":"e_1_3_2_1_19_1","unstructured":"Yann Collet. 2015. Zstandard - Real-time data compression algorithm. http:\/\/facebook.github.io\/zstd\/ (2015).  Yann Collet. 2015. Zstandard - Real-time data compression algorithm. http:\/\/facebook.github.io\/zstd\/ (2015)."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cpc.2006.08.007"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"L Peter Deutsch. 1996. GZIP file format specification version 4.3.  L Peter Deutsch. 1996. GZIP file format specification version 4.3.","DOI":"10.17487\/rfc1952"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2016.11"},{"key":"e_1_3_2_1_23_1","volume-title":"Fast Error-Bounded Lossy HPC Data Compression with SZ. In IPDPS","author":"Di Sheng","year":"2016","unstructured":"Sheng Di and Franck Cappello . 2016 . Fast Error-Bounded Lossy HPC Data Compression with SZ. In IPDPS 2016. 730--739. Sheng Di and Franck Cappello. 2016. Fast Error-Bounded Lossy HPC Data Compression with SZ. In IPDPS 2016. 730--739."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.51.1015"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.8.031027"},{"key":"e_1_3_2_1_26_1","unstructured":"Argonne Leadership Computing Facility. 2019. Aurora Supercomputer. https:\/\/www.alcf.anl.gov\/programs\/aurora-esp. Online. Accessed: 2019-04-06.  Argonne Leadership Computing Facility. 2019. Aurora Supercomputer. https:\/\/www.alcf.anl.gov\/programs\/aurora-esp. Online. Accessed: 2019-04-06."},{"key":"e_1_3_2_1_27_1","volume-title":"A quantum approximate optimization algorithm. arXiv preprint arXiv:1411.4028","author":"Farhi Edward","year":"2014","unstructured":"Edward Farhi , Jeffrey Goldstone , and Sam Gutmann . 2014. A quantum approximate optimization algorithm. arXiv preprint arXiv:1411.4028 ( 2014 ). Edward Farhi, Jeffrey Goldstone, and Sam Gutmann. 2014. A quantum approximate optimization algorithm. arXiv preprint arXiv:1411.4028 (2014)."},{"key":"e_1_3_2_1_28_1","volume-title":"The complexity of approximating complex-valued Ising and Tutte partition functions. computational complexity 26, 4","author":"Goldberg Leslie Ann","year":"2017","unstructured":"Leslie Ann Goldberg and Heng Guo . 2017. The complexity of approximating complex-valued Ising and Tutte partition functions. computational complexity 26, 4 ( 2017 ), 765--833. Leslie Ann Goldberg and Heng Guo. 2017. The complexity of approximating complex-valued Ising and Tutte partition functions. computational complexity 26, 4 (2017), 765--833."},{"key":"e_1_3_2_1_29_1","volume-title":"Stabilizer codes and quantum error correction. arXiv preprint quant-ph\/9705052","author":"Gottesman Daniel","year":"1997","unstructured":"Daniel Gottesman . 1997. Stabilizer codes and quantum error correction. arXiv preprint quant-ph\/9705052 ( 1997 ). Daniel Gottesman. 1997. Stabilizer codes and quantum error correction. arXiv preprint quant-ph\/9705052 (1997)."},{"key":"e_1_3_2_1_30_1","volume-title":"The Heisenberg representation of quantum computers. arXiv preprint quant-ph\/9807006","author":"Gottesman Daniel","year":"1998","unstructured":"Daniel Gottesman . 1998. The Heisenberg representation of quantum computers. arXiv preprint quant-ph\/9807006 ( 1998 ). Daniel Gottesman. 1998. The Heisenberg representation of quantum computers. arXiv preprint quant-ph\/9807006 (1998)."},{"key":"e_1_3_2_1_31_1","volume-title":"Using MPI: portable parallel programming with the message-passing interface","author":"Gropp William D","unstructured":"William D Gropp , William Gropp , Ewing Lusk , and Anthony Skjellum . 1999. Using MPI: portable parallel programming with the message-passing interface . Vol. 1 . MIT press . William D Gropp, William Gropp, Ewing Lusk, and Anthony Skjellum. 1999. Using MPI: portable parallel programming with the message-passing interface. Vol. 1. MIT press."},{"key":"e_1_3_2_1_32_1","volume-title":"A fast quantum mechanical algorithm for database search. arXiv preprint quant-ph\/9605043","author":"Grover Lov K","year":"1996","unstructured":"Lov K Grover . 1996. A fast quantum mechanical algorithm for database search. arXiv preprint quant-ph\/9605043 ( 1996 ). Lov K Grover. 1996. A fast quantum mechanical algorithm for database search. arXiv preprint quant-ph\/9605043 (1996)."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3126908.3126947"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3307650.3322213"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/JRPROC.1952.273898"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1111\/1467-8659.00681"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2014.12.001"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"crossref","unstructured":"James Jeffers and James Reinders. 2013. Intel Xeon Phi coprocessor high performance programming. Newnes.  James Jeffers and James Reinders. 2013. Intel Xeon Phi coprocessor high performance programming. Newnes.","DOI":"10.1016\/B978-0-12-410414-3.00010-4"},{"key":"e_1_3_2_1_39_1","volume-title":"Quantum factoring, discrete logarithms, and the hidden subgroup problem. Computing in science & engineering 3, 2","author":"Jozsa Richard","year":"2001","unstructured":"Richard Jozsa . 2001. Quantum factoring, discrete logarithms, and the hidden subgroup problem. Computing in science & engineering 3, 2 ( 2001 ), 34. Richard Jozsa. 2001. Quantum factoring, discrete logarithms, and the hidden subgroup problem. Computing in science & engineering 3, 2 (2001), 34."},{"key":"e_1_3_2_1_40_1","volume-title":"Error mitigation extends the computational reach of a noisy quantum processor. Nature 567, 7749","author":"Kandala Abhinav","year":"2019","unstructured":"Abhinav Kandala , Kristan Temme , Antonio D C\u00f3rcoles , Antonio Mezzacapo , Jerry M Chow , and Jay M Gambetta . 2019. Error mitigation extends the computational reach of a noisy quantum processor. Nature 567, 7749 ( 2019 ), 491. Abhinav Kandala, Kristan Temme, Antonio D C\u00f3rcoles, Antonio Mezzacapo, Jerry M Chow, and Jay M Gambetta. 2019. Error mitigation extends the computational reach of a noisy quantum processor. Nature 567, 7749 (2019), 491."},{"key":"e_1_3_2_1_41_1","volume-title":"Google\u00e2\u0102Źs new quantum processor. Google Research Blog 5","author":"Kelly Julian","year":"2018","unstructured":"Julian Kelly . 2018. A preview of Bristlecone , Google\u00e2\u0102Źs new quantum processor. Google Research Blog 5 ( 2018 ). Julian Kelly. 2018. A preview of Bristlecone, Google\u00e2\u0102Źs new quantum processor. Google Research Blog 5 (2018)."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.2887"},{"key":"e_1_3_2_1_43_1","volume-title":"Quantum supremacy circuit simulation on Sunway taihuLight. arXiv preprint arXiv:1804.04797","author":"Li Riling","year":"2018","unstructured":"Riling Li , Bujiao Wu , Mingsheng Ying , Xiaoming Sun , and Guangwen Yang . 2018. Quantum supremacy circuit simulation on Sunway taihuLight. arXiv preprint arXiv:1804.04797 ( 2018 ). Riling Li, Bujiao Wu, Mingsheng Ying, Xiaoming Sun, and Guangwen Yang. 2018. Quantum supremacy circuit simulation on Sunway taihuLight. arXiv preprint arXiv:1804.04797 (2018)."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2018.8622520"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2014.2346458"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2006.143"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2018.00044"},{"key":"e_1_3_2_1_48_1","volume-title":"Quantum supremacy is both closer and farther than it appears. arXiv preprint arXiv:1807.10749","author":"Markov Igor L","year":"2018","unstructured":"Igor L Markov , Aneeqa Fatima , Sergei V Isakov , and Sergio Boixo . 2018. Quantum supremacy is both closer and farther than it appears. arXiv preprint arXiv:1807.10749 ( 2018 ). Igor L Markov, Aneeqa Fatima, Sergei V Isakov, and Sergio Boixo. 2018. Quantum supremacy is both closer and farther than it appears. arXiv preprint arXiv:1807.10749 (2018)."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1137\/050644756"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0206704"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"crossref","unstructured":"Michael A Nielsen and Isaac Chuang. 2002. Quantum computation and quantum information.  Michael A Nielsen and Isaac Chuang. 2002. Quantum computation and quantum information.","DOI":"10.1119\/1.1463744"},{"key":"e_1_3_2_1_53_1","volume-title":"Breaking the 49-qubit barrier in the simulation of quantum circuits. arXiv preprint arXiv:1710.05867","author":"Pednault Edwin","year":"2017","unstructured":"Edwin Pednault , John A Gunnels , Giacomo Nannicini , Lior Horesh , Thomas Magerlein , Edgar Solomonik , and Robert Wisnieff . 2017. Breaking the 49-qubit barrier in the simulation of quantum circuits. arXiv preprint arXiv:1710.05867 ( 2017 ). Edwin Pednault, John A Gunnels, Giacomo Nannicini, Lior Horesh, Thomas Magerlein, Edgar Solomonik, and Robert Wisnieff. 2017. Breaking the 49-qubit barrier in the simulation of quantum circuits. arXiv preprint arXiv:1710.05867 (2017)."},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.22331\/q-2018-08-06-79"},{"key":"e_1_3_2_1_55_1","unstructured":"Quantiki. 2019. A list of QC simulators. https:\/\/quantiki.org\/wiki\/list-qc-simulators. Online.  Quantiki. 2019. A list of QC simulators. https:\/\/quantiki.org\/wiki\/list-qc-simulators. Online."},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"crossref","unstructured":"Ramiro Sagastizabal Xavier Bonet-Monroig Malay Singh MA Rol CC Bultink X Fu CH Price VP Ostroukh N Muthusubramanian A Bruno etal 2019. Error mitigation by symmetry verification on a variational quantum eigensolver. arXiv preprint arXiv:1902.11258 (2019).  Ramiro Sagastizabal Xavier Bonet-Monroig Malay Singh MA Rol CC Bultink X Fu CH Price VP Ostroukh N Muthusubramanian A Bruno et al. 2019. Error mitigation by symmetry verification on a variational quantum eigensolver. arXiv preprint arXiv:1902.11258 (2019).","DOI":"10.1103\/PhysRevA.100.010302"},{"key":"e_1_3_2_1_57_1","volume-title":"Exploration of Lossy Compression for Application-Level Checkpoint\/Restart. In IPDPS","author":"Sasaki Naoto","year":"2015","unstructured":"Naoto Sasaki , Kento Sato , Toshio Endo , and Satoshi Matsuoka . 2015 . Exploration of Lossy Compression for Application-Level Checkpoint\/Restart. In IPDPS 2015. 914--922. Naoto Sasaki, Kento Sato, Toshio Endo, and Satoshi Matsuoka. 2015. Exploration of Lossy Compression for Application-Level Checkpoint\/Restart. In IPDPS 2015. 914--922."},{"key":"e_1_3_2_1_58_1","series-title":"SIAM review 41, 2","volume-title":"Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer","author":"Shor Peter W","year":"1999","unstructured":"Peter W Shor . 1999. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer . SIAM review 41, 2 ( 1999 ), 303--332. Peter W Shor. 1999. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM review 41, 2 (1999), 303--332."},{"key":"e_1_3_2_1_59_1","volume-title":"Nicolas PD Sawaya, and Al\u00e1n Aspuru-Guzik","author":"Smelyanskiy Mikhail","year":"2016","unstructured":"Mikhail Smelyanskiy , Nicolas PD Sawaya, and Al\u00e1n Aspuru-Guzik . 2016 . qHiP-STER: the quantum high performance software testing environment. arXiv preprint arXiv:1601.07195 (2016). Mikhail Smelyanskiy, Nicolas PD Sawaya, and Al\u00e1n Aspuru-Guzik. 2016. qHiP-STER: the quantum high performance software testing environment. arXiv preprint arXiv:1601.07195 (2016)."},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1109\/HOTCHIPS.2015.7477467"},{"key":"e_1_3_2_1_61_1","unstructured":"Erich Strohmaier Jack Dongarra Horst Simon Martin Meuer and Hans Meuer. 2018. TOP500 list. https:\/\/www.top500.org\/lists\/2018\/11\/. (2018).  Erich Strohmaier Jack Dongarra Horst Simon Martin Meuer and Hans Meuer. 2018. TOP500 list. https:\/\/www.top500.org\/lists\/2018\/11\/. (2018)."},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2017.115"},{"key":"e_1_3_2_1_63_1","volume-title":"Establishing the Quantum Supremacy Frontier with a 281 Pflop\/s Simulation. arXiv preprint arXiv:1905.00444","author":"Villalonga Benjamin","year":"2019","unstructured":"Benjamin Villalonga , Dmitry Lyakh , Sergio Boixo , Hartmut Neven , Travis S Humble , Rupak Biswas , Eleanor G Rieffel , Alan Ho , and Salvatore Mandr\u00e0 . 2019. Establishing the Quantum Supremacy Frontier with a 281 Pflop\/s Simulation. arXiv preprint arXiv:1905.00444 ( 2019 ). Benjamin Villalonga, Dmitry Lyakh, Sergio Boixo, Hartmut Neven, Travis S Humble, Rupak Biswas, Eleanor G Rieffel, Alan Ho, and Salvatore Mandr\u00e0. 2019. Establishing the Quantum Supremacy Frontier with a 281 Pflop\/s Simulation. arXiv preprint arXiv:1905.00444 (2019)."},{"key":"e_1_3_2_1_64_1","volume-title":"Announcing Supercomputer Summit. (6","author":"Wells Jack","year":"2016","unstructured":"Jack Wells , Buddy Bland , Jeff Nichols , Jim Hack , Fernanda Foertter , Gaute Hagen , Thomas Maier , Moetasim Ashfaq , Bronson Messer , and Suzanne Parete-Koon . 2016. Announcing Supercomputer Summit. (6 2016 ). Jack Wells, Buddy Bland, Jeff Nichols, Jim Hack, Fernanda Foertter, Gaute Hagen, Thomas Maier, Moetasim Ashfaq, Bronson Messer, and Suzanne Parete-Koon. 2016. Announcing Supercomputer Summit. (6 2016)."},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1145\/214762.214771"},{"key":"e_1_3_2_1_66_1","volume-title":"Efficient Transformation Scheme for Lossy Data Compression with Point-wise Relative Error Bound","author":"Zizhong Chen Franck Cappello Dingwen Tao","unstructured":"Dingwen Tao Zizhong Chen Franck Cappello Xin Liang , Sheng Di. 2018. Efficient Transformation Scheme for Lossy Data Compression with Point-wise Relative Error Bound . In CLUSTER. IEEE. Dingwen Tao Zizhong Chen Franck Cappello Xin Liang, Sheng Di. 2018. Efficient Transformation Scheme for Lossy Data Compression with Point-wise Relative Error Bound. In CLUSTER. IEEE."},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055714"},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSST.2019.00-15"},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"crossref","unstructured":"Alwin Zulehner Philipp Niemann Rolf Drechsler and Robert Wille. 2019. Accuracy and Compactness in Decision Diagrams for Quantum Computation. In Design Automation and Test in Europe.  Alwin Zulehner Philipp Niemann Rolf Drechsler and Robert Wille. 2019. Accuracy and Compactness in Decision Diagrams for Quantum Computation. In Design Automation and Test in Europe.","DOI":"10.23919\/DATE.2019.8715040"},{"key":"e_1_3_2_1_70_1","volume-title":"Advanced simulation of quantum computations","author":"Zulehner Alwin","year":"2018","unstructured":"Alwin Zulehner and Robert Wille . 2018. Advanced simulation of quantum computations . IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems ( 2018 ). Alwin Zulehner and Robert Wille. 2018. Advanced simulation of quantum computations. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (2018)."},{"key":"e_1_3_2_1_71_1","first-page":"1","article-title":"Matrix-Vector vs","volume":"1","author":"Zulehner Alwin","year":"2019","unstructured":"Alwin Zulehner and Robert Wille . 2019 . Matrix-Vector vs . Matrix-Matrix Multiplication: Potential in DD-based Simulation of Quantum Computations. Quantum 1 , 1 (2019), 1 -- 1 . Alwin Zulehner and Robert Wille. 2019. Matrix-Vector vs. Matrix-Matrix Multiplication: Potential in DD-based Simulation of Quantum Computations. Quantum 1, 1 (2019), 1--1.","journal-title":"Quantum"}],"event":{"name":"SC '19: The International Conference for High Performance Computing, Networking, Storage, and Analysis","location":"Denver Colorado","acronym":"SC '19","sponsor":["SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing","IEEE CS"]},"container-title":["Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3295500.3356155","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3295500.3356155","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3295500.3356155","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:02:13Z","timestamp":1750208533000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3295500.3356155"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,17]]},"references-count":70,"alternative-id":["10.1145\/3295500.3356155","10.1145\/3295500"],"URL":"https:\/\/doi.org\/10.1145\/3295500.3356155","relation":{},"subject":[],"published":{"date-parts":[[2019,11,17]]},"assertion":[{"value":"2019-11-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}