New Bounds on Quantum Sample Complexity of Measurement Classes

Mohsen Heidari, Wojciech Szpankowski

Type: Article

Publication Date: 2024-07-07

Citations: 0

DOI: https://doi.org/10.1109/isit57864.2024.10619538

View Publication

Download PDF

Locations

arXiv (Cornell University) - View - PDF
2022 IEEE International Symposium on Information Theory (ISIT) - View

Similar Works

Action	Title	Year	Authors
+ PDF Chat	Quantum learning algorithms for quantum measurements	2011	Alessandro Bisio Giacomo Mauro D’Ariano Paolo Perinotti Michal Sedlák
+ PDF Chat	Computational Depth Complexity of Measurement-Based Quantum Computation	2011	Dan E. Browne Elham Kashefi Simon Perdrix
+	New bounds on classical and quantum one-way communication complexity	2008	Rahul Jain Shengyu Zhang
+ PDF Chat	Improved Bounds on Quantum Learning Algorithms	2005	Alp Atıcı Rocco A. Servedio
+ PDF Chat	Complexity Bounds of Constant-Space Quantum Computation	2015	Tomoyuki Yamakami
+ PDF Chat	Sample-size-reduction of quantum states for the noisy linear problem	2023	Kabgyun Jeong
+ PDF Chat	New Bounds on Quantum Sample Complexity of Measurement Classes	2024	Mohsen Heidari Wojciech Szpankowski
+ PDF Chat	A Lower Bound on Entanglement-Assisted Quantum Communication Complexity	2007	Ashley Montanaro Andreas Winter
+ PDF Chat	Information Complexity of Quantum Gates	2006	Subhash Kak
+ PDF Chat	Improved Quantum Communication Complexity Bounds for Disjointness and Equality	2002	Peter Høyer Ronald de Wolf
+ PDF Chat	Quantum branching programs and space-bounded nonuniform quantum complexity	2005	Martin Sauerhoff Detlef Sieling
+	Computing the Communication Complexity of Quantum Channels	2013	A. Montina Marcel Pfaffhauser Stefan Wolf
+	Unbounded-Error Classical and Quantum Communication Complexity	2007	Kazuo Iwama Harumichi Nishimura Rudy Raymond Shigeru Yamashita
+	An invitation to the sample complexity of quantum hypothesis testing	2024	Hao–Chung Cheng Nilanjana Datta Nana Liu Theshani Nuradha Robert Salzmann Mark M. Wilde
+	Quantum Algorithms and Complexity for Continuous Problems	2011	Anargyros Papageorgiou J. F. Traub
+ PDF Chat	Exponential Separation of Quantum and Classical Online Space Complexity	2007	François Le Gall
+	Quantum Complexity: restrictions on algorithms and architectures	2010	D. J. Shepherd
+ PDF Chat	Zonoids and sparsification of quantum measurements	2015	Guillaume Aubrun Cécilia Lancien
+	A bound on the mutual information for quantum channels with inefficient measurements	2004	Kurt Jacobs
+	Singleton Bounds on Noisy Quantum Channels	1997	Nicolas J. Cerf

Works That Cite This (0)

Action	Title	Year	Authors

Works Cited by This (32)

Action	Title	Year	Authors
+	Sample-optimal tomography of quantum states	2016	Jeongwan Haah Aram W. Harrow Zhengfeng Ji Xiaodi Wu Nengkun Yu
+	Efficient quantum tomography	2016	Ryan O’Donnell John C. Wright
+ PDF Chat	Quantum principal component analysis	2014	Seth Lloyd Masoud Mohseni Patrick Rebentrost
+	Quantum algorithms for supervised and unsupervised machine learning	2013	Seth Lloyd Masoud Mohseni Patrick Rebentrost
+ PDF Chat	Quantum state discrimination	2009	Stephen M. Barnett Sarah Croke
+ PDF Chat	Quantum Random Access Memory	2008	Vittorio Giovannetti Seth Lloyd Lorenzo Maccone
+ PDF Chat	Simulating Chemistry Using Quantum Computers	2011	Ivan Kassal James Whitfield Alejandro Perdomo‐Ortiz Man‐Hong Yung Alán Aspuru‐Guzik
+ PDF Chat	Machine learning phases of matter	2017	Juan Carrasquilla Roger G. Melko
+ PDF Chat	Solving the quantum many-body problem with artificial neural networks	2017	Giuseppe Carleo Matthias Troyer
+ PDF Chat	Quantum machine learning	2017	Jacob Biamonte Péter Wittek Nicola Pancotti Patrick Rebentrost Nathan Wiebe Seth Lloyd