Tag: Ryan O
Learning quantum many-body systems from a few copies
Cambyse Rouzé1 and Daniel Stilck França2,31Department of Mathematics, Technische Universität München, 85748 Garching, Germany2QMATH, Department of Mathematical Sciences, University of Copenhagen, Denmark3Univ Lyon, ENS...
Breaking News
Efficient learning of $t$-doped stabilizer states with single-copy measurements
Nai-Hui Chia1, Ching-Yi Lai2, and Han-Hsuan Lin31Department of Computer Science, Rice University, TX 77005-1892, United States2Institute of Communications Engineering, National Yang Ming Chiao Tung...
Entanglement Purification with Quantum LDPC Codes and Iterative Decoding
Narayanan Rengaswamy1, Nithin Raveendran1, Ankur Raina2, and Bane Vasić11Department of Electrical and Computer Engineering, University of Arizona, Tucson, Arizona 85721, USA2Department of Electrical Engineering...
Efficient classical algorithms for simulating symmetric quantum systems
Eric R. Anschuetz1, Andreas Bauer2, Bobak T. Kiani3, and Seth Lloyd4,51MIT Center for Theoretical Physics, 77 Massachusetts Avenue, Cambridge, MA 02139, USA2Dahlem Centre for...
An Improved Approximation Algorithm for Quantum Max-Cut on Triangle-Free Graphs
Robbie KingDepartment of Computing and Mathematical Sciences, CaltechFind this paper interesting or want to discuss? Scite or leave a comment on SciRate.AbstractWe give an...
Partitioning qubits in hypergraph product codes to implement logical gates
Armanda O. Quintavalle1,2, Paul Webster3, and Michael Vasmer4,51Department of Physics & Astronomy, University of Sheffield, Sheffield, S3 7RH, United Kingdom2Dahlem Center for Complex Quantum...
Discovering optimal fermion-qubit mappings through algorithmic enumeration
Mitchell Chiew and Sergii StrelchukDAMTP, Centre for Mathematical Sciences, University of Cambridge, Cambridge CB30WA, UKFind this paper interesting or want to discuss? Scite or...
Encoding trade-offs and design toolkits in quantum algorithms for discrete optimization: coloring, routing, scheduling, and other problems
Nicolas PD Sawaya1, Albert T Schmitz2, and Stuart Hadfield3,41Intel Labs, Intel Corporation, Santa Clara, California 95054, USA 2Intel Labs, Intel Corporation, Hillsboro, Oregon 97124,...
Quantum Interior Point Methods for Semidefinite Optimization
Brandon Augustino1, Giacomo Nannicini2, Tamás Terlaky1, and Luis F. Zuluaga11Department of Industrial and Systems Engineering, Quantum Computing and Optimization Lab, Lehigh University2Department of...
Testing identity of collections of quantum states: sample complexity analysis
Marco Fanizza1, Raffaele Salvia2, and Vittorio Giovannetti31FÃsica Teòrica: Informació i Fenòmens Quà ntics, Departament de FÃsica, Universitat Autònoma de Barcelona, 08193 Bellaterra, Spain.2Scuola Normale Superiore,...
Optimizing sparse fermionic Hamiltonians
Yaroslav Herasymenko1,2, Maarten Stroeks2,3, Jonas Helsen1, and Barbara Terhal2,31QuSoft & CWI, Science Park 123 1098 XG Amsterdam, The Netherlands2QuTech, Delft University of Technology, Lorentzweg...
Clifford Circuits can be Properly PAC Learned if and only if $textsf{RP}=textsf{NP}$
Daniel LiangDepartment of Computer Science, University of Texas at AustinFind this paper interesting or want to discuss? Scite or leave a comment on...
Scalable and Flexible Classical Shadow Tomography with Tensor Networks
Ahmed A. Akhtar1, Hong-Ye Hu1,2, and Yi-Zhuang You11Department of Physics, University of California San Diego, La Jolla, CA 92093, USA2Department of Physics, Harvard University,...
Latest Intelligence
