Search results for "QMA"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
258	Ran Raz, Amir Shpilka	On the Power of Quantum Proofs.	CCC	2004	DBLP DOI BibTeX RDF
248	Scott Aaronson, Salman Beigi, Andrew Drucker, Bill Fefferman, Peter W. Shor	The Power of Unentanglement.	CCC	2008	DBLP DOI BibTeX RDF	QMA, 3SAT, PCP Theorem, quantum computing, additivity, entanglement
89	Yi-Kai Liu 0001	Consistency of Local Density Matrices Is QMA-Complete.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
89	Scott Aaronson	QMA/qpoly \subseteq PSPACE/poly: De-Merlinizing Quantum Protocols.	CCC	2006	DBLP DOI BibTeX RDF
86	Dorit Aharonov, Daniel Gottesman, Sandy Irani, Julia Kempe	The Power of Quantum Systems on a Line.	FOCS	2007	DBLP DOI BibTeX RDF
86	Scott Aaronson, Greg Kuperberg	Quantum versus Classical Proofs and Advice.	CCC	2007	DBLP DOI BibTeX RDF
86	Dorit Aharonov, Oded Regev 0001	A Lattice Problem in Quantum NP.	FOCS	2003	DBLP DOI BibTeX RDF
64	Michele Cinotti, Paolo Orefice, Luigi Paura, Amedeo Scarpiello	Performance analysis of a QoS management architecture for an emergency scenario.	IWCMC	2010	DBLP DOI BibTeX RDF	QoS management architecture, performance analysis, wireless technologies, emergency management
64	Alexandra Martínez, Joachim Hammer, Sanjay Ranka	BioDQ: Data Quality Estimation and Management for Genomics Databases.	ISBRA	2008	DBLP DOI BibTeX RDF	Genomics Databases, GenBank, RefSeq, quality dimension, classification, architecture, measure, management, estimation, Data Quality
64	Dapeng Wang, Kai Liu, Lianzhen Cheng, Yan Zhang	A Novel Multiple Access Protocol with QoS Support for Mobile Ad Hoc Networks.	NPC	2007	DBLP DOI BibTeX RDF	forecast burst, QoS, mobile ad hoc network, collision resolution, multiple access protocol
43	Chris Marriott, John Watrous	Quantum Arthur-Merlin Games.	CCC	2004	DBLP DOI BibTeX RDF
34	Dorit Aharonov, Itai Arad, Zeph Landau, Umesh V. Vazirani	The detectability lemma and quantum gap amplification.	STOC	2009	DBLP DOI BibTeX RDF	QMA, detectability lemma, gap amplification, local hamiltonians, quantum computation, PCP
24	Scott Aaronson, Sabee Grewal, Vishnu Iyer, Simon C. Marshall, Ronak Ramachandran	PDQMA = DQMA = NEXP: QMA With Hidden Variables and Non-collapsing Measurements.	CoRR	2024	DBLP DOI BibTeX RDF
24	Shalev Ben-David, Srijita Kundu	Oracle separation of QMA and QCMA with bounded adaptivity.	CoRR	2024	DBLP DOI BibTeX RDF
24	Roozbeh Bassirian, Kunal Marwaha	Superposition detection and QMA with non-collapsing measurements.	CoRR	2024	DBLP DOI BibTeX RDF
24	Ping Wang, Yiting Su	BQP ≠q QMA.	IACR Cryptol. ePrint Arch.	2023	DBLP BibTeX RDF
24	Anand Natarajan, Chinmay Nirkhe	A Distribution Testing Oracle Separating QMA and QCMA.	CCC	2023	DBLP DOI BibTeX RDF
24	Sevag Gharibian, Miklos Santha, Jamie Sikora, Aarthi Sundaram, Justin Yirka	Quantum generalizations of the polynomial hierarchy with applications to QMA(2).	Comput. Complex.	2022	DBLP DOI BibTeX RDF
24	Tomoyuki Morimae, Takashi Yamakawa	Classically Verifiable NIZK for QMA with Preprocessing.	IACR Cryptol. ePrint Arch.	2022	DBLP BibTeX RDF
24	Anne Broadbent, Alex Bredariol Grilo	QMA-Hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge.	SIAM J. Comput.	2022	DBLP DOI BibTeX RDF
24	Sevag Gharibian, Dorian Rudolph	On Polynomially Many Queries to NP or QMA Oracles.	ITCS	2022	DBLP DOI BibTeX RDF
24	Tomoyuki Morimae, Takashi Yamakawa	Classically Verifiable NIZK for QMA with Preprocessing.	ASIACRYPT (4)	2022	DBLP DOI BibTeX RDF
24	Taiga Hiroka, Tomoyuki Morimae, Ryo Nishimaki, Takashi Yamakawa	Certified Everlasting Zero-Knowledge Proof for QMA.	CRYPTO (1)	2022	DBLP DOI BibTeX RDF
24	Yichen Huang	Two-dimensional local Hamiltonian problem with area laws is QMA-complete.	J. Comput. Phys.	2021	DBLP DOI BibTeX RDF
24	Sevag Gharibian, Dorian Rudolph	On polynomially many queries to NP or QMA oracles.	Electron. Colloquium Comput. Complex.	2021	DBLP BibTeX RDF
24	Taiga Hiroka, Tomoyuki Morimae, Ryo Nishimaki, Takashi Yamakawa	Certified Everlasting Zero-Knowledge Proof for QMA.	CoRR	2021	DBLP BibTeX RDF
24	Bryan O'Gorman, Sandy Irani, James Whitfield, Bill Fefferman	Electronic Structure in a Fixed Basis is QMA-complete.	CoRR	2021	DBLP BibTeX RDF
24	Tomoyuki Morimae, Takashi Yamakawa	Classically Verifiable (Dual-Mode) NIZK for QMA with Preprocessing.	CoRR	2021	DBLP BibTeX RDF
24	Florian Meyer, Volker Turau	QMA: A Ressource-efficient, Q-Learning-based Multiple Access Scheme for the IIoT.	CoRR	2021	DBLP BibTeX RDF
24	Sevag Gharibian, Dorian Rudolph	On polynomially many queries to NP or QMA oracles.	CoRR	2021	DBLP BibTeX RDF
24	James Bartusek, Giulio Malavolta	Candidate Obfuscation of Null Quantum Circuits and Witness Encryption for QMA.	IACR Cryptol. ePrint Arch.	2021	DBLP BibTeX RDF
24	Taiga Hiroka, Tomoyuki Morimae, Ryo Nishimaki, Takashi Yamakawa	Certified Everlasting Zero-Knowledge Proof for QMA.	IACR Cryptol. ePrint Arch.	2021	DBLP BibTeX RDF
24	Serge Massar, Miklos Santha	Total functions in QMA.	Quantum Inf. Process.	2021	DBLP DOI BibTeX RDF
24	Serge Massar, Miklos Santha	Characterising the intersection of QMA and coQMA.	Quantum Inf. Process.	2021	DBLP DOI BibTeX RDF
24	Florian Meyer, Volker Turau	QMA: A Resource-efficient, Q-learning-based Multiple Access Scheme for the IIoT.	ICDCS	2021	DBLP DOI BibTeX RDF
24	Omri Shmueli	Multi-theorem Designated-Verifier NIZK for QMA.	CRYPTO (1)	2021	DBLP DOI BibTeX RDF
24	Omri Shmueli	Multi-theorem (Malicious) Designated-Verifier NIZK for QMA.	CoRR	2020	DBLP BibTeX RDF
24	Omri Shmueli	Multi-theorem (Malicious) Designated-Verifier NIZK for QMA.	IACR Cryptol. ePrint Arch.	2020	DBLP BibTeX RDF
24	Sebastian M. Bernasek, Nicolás Peláez, Richard W. Carthew, Neda Bagheri, Luis A. Nunes Amaral	Fly-QMA: Automated analysis of mosaic imaginal discs in Drosophila.	PLoS Comput. Biol.	2020	DBLP DOI BibTeX RDF
24	Anne Broadbent, Zhengfeng Ji, Fang Song 0001, John Watrous	Zero-Knowledge Proof Systems for QMA.	SIAM J. Comput.	2020	DBLP DOI BibTeX RDF
24	Anne Broadbent, Alex B. Grilo	QMA-hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge.	FOCS	2020	DBLP DOI BibTeX RDF
24	Yichen Huang	2D Local Hamiltonian with Area Laws Is QMA-Complete.	ISIT	2020	DBLP DOI BibTeX RDF
24	Andrea Coladangelo, Thomas Vidick, Tina Zhang	Non-interactive Zero-Knowledge Arguments for QMA, with Preprocessing.	CRYPTO (3)	2020	DBLP DOI BibTeX RDF
24	Alexander A. Sherstov, Justin Thaler	Vanishing-Error Approximate Degree and QMA Complexity.	Electron. Colloquium Comput. Complex.	2019	DBLP BibTeX RDF
24	William Kretschmer	QMA Lower Bounds for Approximate Counting.	Electron. Colloquium Comput. Complex.	2019	DBLP BibTeX RDF
24	Andrea Coladangelo, Thomas Vidick, Tina Zhang	Non-interactive zero-knowledge arguments for QMA, with preprocessing.	CoRR	2019	DBLP BibTeX RDF
24	William Kretschmer	$\mathsf{QMA}$ Lower Bounds for Approximate Counting.	CoRR	2019	DBLP BibTeX RDF
24	Anne Broadbent, Alex B. Grilo	Zero-Knowledge for QMA from Locally Simulatable Proofs.	CoRR	2019	DBLP BibTeX RDF
24	Alexander A. Sherstov, Justin Thaler	Vanishing-Error Approximate Degree and QMA Complexity.	CoRR	2019	DBLP BibTeX RDF
24	Sevag Gharibian, Miklos Santha, Jamie Sikora, Aarthi Sundaram, Justin Yirka	Quantum generalizations of the polynomial hierarchy with applications to QMA(2).	CoRR	2018	DBLP BibTeX RDF
24	Anand Natarajan, Thomas Vidick	Low-Degree Testing for Quantum States, and a Quantum Entangled Games PCP for QMA.	FOCS	2018	DBLP DOI BibTeX RDF
24	Sevag Gharibian, Miklos Santha, Jamie Sikora, Aarthi Sundaram, Justin Yirka	Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2).	MFCS	2018	DBLP DOI BibTeX RDF
24	Friederike Anna Dziemba	Robustness of QMA against witness noise.	Quantum Inf. Comput.	2017	DBLP DOI BibTeX RDF
24	Alex B. Grilo, Iordanis Kerenidis, Jamie Sikora	QMA with Subset State Witnesses.	Chic. J. Theor. Comput. Sci.	2016	DBLP BibTeX RDF
24	Anne Broadbent, Zheng-Feng Ji, Fang Song 0001, John Watrous	Zero-knowledge proof systems for QMA.	CoRR	2016	DBLP BibTeX RDF
24	Anne Broadbent, Zhengfeng Ji, Fang Song 0001, John Watrous	Zero-Knowledge Proof Systems for QMA.	FOCS	2016	DBLP DOI BibTeX RDF
24	Andrew M. Childs, David Gosset, Zak Webb	The Bose-Hubbard Model is QMA-complete.	Theory Comput.	2015	DBLP DOI BibTeX RDF
24	Alex Bredariol Grilo, Iordanis Kerenidis, Jamie Sikora	QMA with Subset State Witnesses.	MFCS (2)	2015	DBLP DOI BibTeX RDF
24	Adam D. Bookatz	QMA-complete problems.	Quantum Inf. Comput.	2014	DBLP DOI BibTeX RDF
24	Yichen Huang	Two-dimensional local Hamiltonian problem with area laws is QMA-complete.	CoRR	2014	DBLP DOI BibTeX RDF
24	Alex Bredariol Grilo, Iordanis Kerenidis, Jamie Sikora	QMA with subset state witnesses.	CoRR	2014	DBLP BibTeX RDF
24	Andrew M. Childs, David Gosset, Zak Webb	The Bose-Hubbard Model is QMA-complete.	ICALP (1)	2014	DBLP DOI BibTeX RDF
24	Andris Ambainis	On Physical Problems that are Slightly More Difficult than QMA.	CCC	2014	DBLP DOI BibTeX RDF
24	Alessandro Chiesa, Michael A. Forbes 0001	Improved Soundness for QMA with Multiple Provers	Chic. J. Theor. Comput. Sci.	2013	DBLP BibTeX RDF
24	Sean Hallgren, Daniel Nagaj, Sandeep Narayanaswami	The local Hamiltonian problem on a line with eight states is QMA-complete.	Quantum Inf. Comput.	2013	DBLP DOI BibTeX RDF
24	Sevag Gharibian, Jamie Sikora, Sarvagya Upadhyay	QMA variants with polynomially many provers.	Quantum Inf. Comput.	2013	DBLP DOI BibTeX RDF
24	Attila Pereszlényi	One-Sided Error QMA with Shared EPR Pairs - A Simpler Proof.	CoRR	2013	DBLP BibTeX RDF
24	Andris Ambainis	On physical problems that are slightly more difficult than QMA.	CoRR	2013	DBLP BibTeX RDF
24	Andrew M. Childs, David Gosset, Zak Webb	The Bose-Hubbard model is QMA-complete.	CoRR	2013	DBLP BibTeX RDF
24	François Le Gall, Shota Nakagawa, Harumichi Nishimura	On QMA protocols with two short quantum proofs.	Quantum Inf. Comput.	2012	DBLP DOI BibTeX RDF
24	Sevag Gharibian, Julia Kempe	Approximation Algorithms for QMA-Complete Problems.	SIAM J. Comput.	2012	DBLP DOI BibTeX RDF
24	Alessandro Chiesa, Michael A. Forbes 0001	Improved Soundness for QMA with Multiple Provers.	Electron. Colloquium Comput. Complex.	2011	DBLP BibTeX RDF
24	Sevag Gharibian, Julia Kempe	Approximation algorithms for QMA-complete problems	CoRR	2011	DBLP BibTeX RDF
24	François Le Gall, Shota Nakagawa, Harumichi Nishimura	On QMA Protocols with Two Short Quantum Proofs	CoRR	2011	DBLP BibTeX RDF
24	Sevag Gharibian, Jamie Sikora, Sarvagya Upadhyay	QMA variants with polynomially many provers	CoRR	2011	DBLP BibTeX RDF
24	Alessandro Chiesa, Michael A. Forbes 0001	Improved Soundness for QMA with Multiple Provers	CoRR	2011	DBLP BibTeX RDF
24	Sevag Gharibian, Julia Kempe	Approximation Algorithms for QMA-Complete Problems.	CCC	2011	DBLP DOI BibTeX RDF
24	Bill Rosgen	Testing Non-isometry Is QMA-Complete.	TQC	2010	DBLP DOI BibTeX RDF
24	Yuniol Alvarez-Betancourt, Miguel García-Silvente	A fast Iris location based on aggregating gradient approximation using QMA-OWA operator.	FUZZ-IEEE	2010	DBLP DOI BibTeX RDF
24	Scott Aaronson	On perfect completeness for QMA.	Quantum Inf. Comput.	2009	DBLP DOI BibTeX RDF
24	Daniel Nagaj, Pawel Wocjan, Yong Zhang	Fast amplification of QMA.	Quantum Inf. Comput.	2009	DBLP DOI BibTeX RDF
24	Scott Aaronson	On Perfect Completeness for QMA.	Electron. Colloquium Comput. Complex.	2008	DBLP BibTeX RDF
24	José Ignacio Peláez, Jesús M. Doña	A majority model in group decision making using QMA-OWA operators.	Int. J. Intell. Syst.	2006	DBLP DOI BibTeX RDF
24	Scott Aaronson	QMA/qpoly Is Contained In PSPACE/poly: De-Merlinizing Quantum Protocols	Electron. Colloquium Comput. Complex.	2005	DBLP BibTeX RDF
24	Scott Aaronson	QMA/qpoly Is Contained In PSPACE/poly: De-Merlinizing Quantum Protocols	CoRR	2005	DBLP BibTeX RDF
24	Julia Kempe, Oded Regev 0001	3-local Hamiltonian is QMA-complete.	Quantum Inf. Comput.	2003	DBLP DOI BibTeX RDF
24	Mikhail N. Vyalyi	QMA=PP implies that PP contains PH	Electron. Colloquium Comput. Complex.	2003	DBLP BibTeX RDF
21	Chris Marriott, John Watrous	Quantum Arthur-Merlin games.	Comput. Complex.	2005	DBLP DOI BibTeX RDF	68Q15, Subject classification. 68Q10
21	Bill Rosgen	On the Hardness of Distinguishing Mixed-State Quantum Computations.	CCC	2005	DBLP DOI BibTeX RDF