Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
258 | Ran Raz, Amir Shpilka |
On the Power of Quantum Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 19th Annual IEEE Conference on Computational Complexity (CCC 2004), 21-24 June 2004, Amherst, MA, USA, pp. 260-274, 2004, IEEE Computer Society, 0-7695-2120-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
248 | Scott Aaronson, Salman Beigi, Andrew Drucker, Bill Fefferman, Peter W. Shor |
The Power of Unentanglement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, CCC 2008, 23-26 June 2008, College Park, Maryland, USA, pp. 223-236, 2008, IEEE Computer Society, 978-0-7695-3169-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and 10th International Workshop on Randomization and Computation, RANDOM 2006, Barcelona, Spain, August 28-30 2006, Proceedings, pp. 438-449, 2006, Springer, 3-540-38044-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
89 | Scott Aaronson |
QMA/qpoly \subseteq PSPACE/poly: De-Merlinizing Quantum Protocols. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 21st Annual IEEE Conference on Computational Complexity (CCC 2006), 16-20 July 2006, Prague, Czech Republic, pp. 261-273, 2006, IEEE Computer Society, 0-7695-2596-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
86 | Dorit Aharonov, Daniel Gottesman, Sandy Irani, Julia Kempe |
The Power of Quantum Systems on a Line. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), October 20-23, 2007, Providence, RI, USA, Proceedings, pp. 373-383, 2007, IEEE Computer Society, 978-0-7695-3010-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
86 | Scott Aaronson, Greg Kuperberg |
Quantum versus Classical Proofs and Advice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 22nd Annual IEEE Conference on Computational Complexity (CCC 2007), 13-16 June 2007, San Diego, California, USA, pp. 115-128, 2007, IEEE Computer Society, 0-7695-2780-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
86 | Dorit Aharonov, Oded Regev 0001 |
A Lattice Problem in Quantum NP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 44th Symposium on Foundations of Computer Science (FOCS 2003), 11-14 October 2003, Cambridge, MA, USA, Proceedings, pp. 210-219, 2003, IEEE Computer Society, 0-7695-2040-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWCMC ![In: Proceedings of the 6th International Wireless Communications and Mobile Computing Conference, IWCMC 2010, Caen, France, June 28 - July 2, 2010, pp. 514-518, 2010, ACM, 978-1-4503-0062-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISBRA ![In: Bioinformatics Research and Applications, Fourth International Symposium, ISBRA 2008, Atlanta, GA, USA, May 6-9, 2008. Proceedings, pp. 469-480, 2008, Springer, 978-3-540-79449-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NPC ![In: Network and Parallel Computing, IFIP International Conference, NPC 2007, Dalian, China, September 18-21, 2007, Proceedings, pp. 260-266, 2007, Springer, 978-3-540-74783-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 19th Annual IEEE Conference on Computational Complexity (CCC 2004), 21-24 June 2004, Amherst, MA, USA, pp. 275-285, 2004, IEEE Computer Society, 0-7695-2120-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
34 | Dorit Aharonov, Itai Arad, Zeph Landau, Umesh V. Vazirani |
The detectability lemma and quantum gap amplification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, pp. 417-426, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2403.02543, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
24 | Shalev Ben-David, Srijita Kundu |
Oracle separation of QMA and QCMA with bounded adaptivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2402.00298, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
24 | Roozbeh Bassirian, Kunal Marwaha |
Superposition detection and QMA with non-collapsing measurements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2403.02532, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
24 | Ping Wang, Yiting Su |
BQP ≠q QMA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2023, pp. 703, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
24 | Anand Natarajan, Chinmay Nirkhe |
A Distribution Testing Oracle Separating QMA and QCMA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 38th Computational Complexity Conference, CCC 2023, July 17-20, 2023, Warwick, UK, pp. 22:1-22:27, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-282-2. The full citation details ...](Pics/full.jpeg) |
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). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 31(2), pp. 13, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
24 | Tomoyuki Morimae, Takashi Yamakawa |
Classically Verifiable NIZK for QMA with Preprocessing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2022, pp. 1157, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
24 | Anne Broadbent, Alex Bredariol Grilo |
QMA-Hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 51(4), pp. 1400-1450, August 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
24 | Sevag Gharibian, Dorian Rudolph |
On Polynomially Many Queries to NP or QMA Oracles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 75:1-75:27, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
24 | Tomoyuki Morimae, Takashi Yamakawa |
Classically Verifiable NIZK for QMA with Preprocessing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASIACRYPT (4) ![In: Advances in Cryptology - ASIACRYPT 2022 - 28th International Conference on the Theory and Application of Cryptology and Information Security, Taipei, Taiwan, December 5-9, 2022, Proceedings, Part IV, pp. 599-627, 2022, Springer, 978-3-031-22971-8. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
24 | Taiga Hiroka, Tomoyuki Morimae, Ryo Nishimaki, Takashi Yamakawa |
Certified Everlasting Zero-Knowledge Proof for QMA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CRYPTO (1) ![In: Advances in Cryptology - CRYPTO 2022 - 42nd Annual International Cryptology Conference, CRYPTO 2022, Santa Barbara, CA, USA, August 15-18, 2022, Proceedings, Part I, pp. 239-268, 2022, Springer, 978-3-031-15801-8. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
24 | Yichen Huang |
Two-dimensional local Hamiltonian problem with area laws is QMA-complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Phys. ![In: J. Comput. Phys. 443, pp. 110534, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
24 | Sevag Gharibian, Dorian Rudolph |
On polynomially many queries to NP or QMA oracles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR21, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
24 | Taiga Hiroka, Tomoyuki Morimae, Ryo Nishimaki, Takashi Yamakawa |
Certified Everlasting Zero-Knowledge Proof for QMA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2109.14163, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
24 | Bryan O'Gorman, Sandy Irani, James Whitfield, Bill Fefferman |
Electronic Structure in a Fixed Basis is QMA-complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2103.08215, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
24 | Tomoyuki Morimae, Takashi Yamakawa |
Classically Verifiable (Dual-Mode) NIZK for QMA with Preprocessing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2102.09149, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
24 | Florian Meyer, Volker Turau |
QMA: A Ressource-efficient, Q-Learning-based Multiple Access Scheme for the IIoT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2101.04003, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
24 | Sevag Gharibian, Dorian Rudolph |
On polynomially many queries to NP or QMA oracles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2111.02296, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
24 | James Bartusek, Giulio Malavolta |
Candidate Obfuscation of Null Quantum Circuits and Witness Encryption for QMA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2021, pp. 421, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
24 | Taiga Hiroka, Tomoyuki Morimae, Ryo Nishimaki, Takashi Yamakawa |
Certified Everlasting Zero-Knowledge Proof for QMA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2021, pp. 1315, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
24 | Serge Massar, Miklos Santha |
Total functions in QMA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Quantum Inf. Process. ![In: Quantum Inf. Process. 20(1), pp. 35, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
24 | Serge Massar, Miklos Santha |
Characterising the intersection of QMA and coQMA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Quantum Inf. Process. ![In: Quantum Inf. Process. 20(12), pp. 396, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
24 | Florian Meyer, Volker Turau |
QMA: A Resource-efficient, Q-learning-based Multiple Access Scheme for the IIoT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCS ![In: 41st IEEE International Conference on Distributed Computing Systems, ICDCS 2021, Washington DC, USA, July 7-10, 2021, pp. 864-874, 2021, IEEE, 978-1-6654-4513-9. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
24 | Omri Shmueli |
Multi-theorem Designated-Verifier NIZK for QMA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CRYPTO (1) ![In: Advances in Cryptology - CRYPTO 2021 - 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16-20, 2021, Proceedings, Part I, pp. 375-405, 2021, Springer, 978-3-030-84241-3. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
24 | Omri Shmueli |
Multi-theorem (Malicious) Designated-Verifier NIZK for QMA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2007.12923, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
24 | Omri Shmueli |
Multi-theorem (Malicious) Designated-Verifier NIZK for QMA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2020, pp. 928, 2020. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLoS Comput. Biol. ![In: PLoS Comput. Biol. 16(3), 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
24 | Anne Broadbent, Zhengfeng Ji, Fang Song 0001, John Watrous |
Zero-Knowledge Proof Systems for QMA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 49(2), pp. 245-283, 2020. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA, November 16-19, 2020, pp. 196-205, 2020, IEEE, 978-1-7281-9621-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
24 | Yichen Huang |
2D Local Hamiltonian with Area Laws Is QMA-Complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISIT ![In: IEEE International Symposium on Information Theory, ISIT 2020, Los Angeles, CA, USA, June 21-26, 2020, pp. 1927-1932, 2020, IEEE, 978-1-7281-6432-8. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
24 | Andrea Coladangelo, Thomas Vidick, Tina Zhang |
Non-interactive Zero-Knowledge Arguments for QMA, with Preprocessing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CRYPTO (3) ![In: Advances in Cryptology - CRYPTO 2020 - 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17-21, 2020, Proceedings, Part III, pp. 799-828, 2020, Springer, 978-3-030-56876-4. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
24 | Alexander A. Sherstov, Justin Thaler |
Vanishing-Error Approximate Degree and QMA Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR19, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
24 | William Kretschmer |
QMA Lower Bounds for Approximate Counting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR19, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
24 | Andrea Coladangelo, Thomas Vidick, Tina Zhang |
Non-interactive zero-knowledge arguments for QMA, with preprocessing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1911.07546, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
24 | William Kretschmer |
$\mathsf{QMA}$ Lower Bounds for Approximate Counting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1902.02398, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
24 | Anne Broadbent, Alex B. Grilo |
Zero-Knowledge for QMA from Locally Simulatable Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1911.07782, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
24 | Alexander A. Sherstov, Justin Thaler |
Vanishing-Error Approximate Degree and QMA Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1909.07498, 2019. The full citation details ...](Pics/full.jpeg) |
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). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1805.11139, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
24 | Anand Natarajan, Thomas Vidick |
Low-Degree Testing for Quantum States, and a Quantum Entangled Games PCP for QMA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pp. 731-742, 2018, IEEE Computer Society, 978-1-5386-4230-6. The full citation details ...](Pics/full.jpeg) |
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). ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK, pp. 58:1-58:16, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-086-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
24 | Friederike Anna Dziemba |
Robustness of QMA against witness noise. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Quantum Inf. Comput. ![In: Quantum Inf. Comput. 17(13&14), pp. 1167-1190, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
24 | Alex B. Grilo, Iordanis Kerenidis, Jamie Sikora |
QMA with Subset State Witnesses. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Chic. J. Theor. Comput. Sci. ![In: Chic. J. Theor. Comput. Sci. 2016, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
24 | Anne Broadbent, Zheng-Feng Ji, Fang Song 0001, John Watrous |
Zero-knowledge proof systems for QMA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1604.02804, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
24 | Anne Broadbent, Zhengfeng Ji, Fang Song 0001, John Watrous |
Zero-Knowledge Proof Systems for QMA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey, USA, pp. 31-40, 2016, IEEE Computer Society, 978-1-5090-3933-3. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
24 | Andrew M. Childs, David Gosset, Zak Webb |
The Bose-Hubbard Model is QMA-complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. ![In: Theory Comput. 11, pp. 491-603, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
24 | Alex Bredariol Grilo, Iordanis Kerenidis, Jamie Sikora |
QMA with Subset State Witnesses. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS (2) ![In: Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part II, pp. 163-174, 2015, Springer, 978-3-662-48053-3. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
24 | Adam D. Bookatz |
QMA-complete problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Quantum Inf. Comput. ![In: Quantum Inf. Comput. 14(5-6), pp. 361-383, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
24 | Yichen Huang |
Two-dimensional local Hamiltonian problem with area laws is QMA-complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1411.6614, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
24 | Alex Bredariol Grilo, Iordanis Kerenidis, Jamie Sikora |
QMA with subset state witnesses. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1410.2882, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
24 | Andrew M. Childs, David Gosset, Zak Webb |
The Bose-Hubbard Model is QMA-complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I, pp. 308-319, 2014, Springer, 978-3-662-43947-0. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
24 | Andris Ambainis |
On Physical Problems that are Slightly More Difficult than QMA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: IEEE 29th Conference on Computational Complexity, CCC 2014, Vancouver, BC, Canada, June 11-13, 2014, pp. 32-43, 2014, IEEE Computer Society, 978-1-4799-3626-7. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
24 | Alessandro Chiesa, Michael A. Forbes 0001 |
Improved Soundness for QMA with Multiple Provers ![Search on Bibsonomy](Pics/bibsonomy.png) |
Chic. J. Theor. Comput. Sci. ![In: Chic. J. Theor. Comput. Sci. 2013, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
24 | Sean Hallgren, Daniel Nagaj, Sandeep Narayanaswami |
The local Hamiltonian problem on a line with eight states is QMA-complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Quantum Inf. Comput. ![In: Quantum Inf. Comput. 13(9-10), pp. 721-750, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
24 | Sevag Gharibian, Jamie Sikora, Sarvagya Upadhyay |
QMA variants with polynomially many provers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Quantum Inf. Comput. ![In: Quantum Inf. Comput. 13(1-2), pp. 135-157, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
24 | Attila Pereszlényi |
One-Sided Error QMA with Shared EPR Pairs - A Simpler Proof. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1306.5406, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
24 | Andris Ambainis |
On physical problems that are slightly more difficult than QMA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1312.4758, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
24 | Andrew M. Childs, David Gosset, Zak Webb |
The Bose-Hubbard model is QMA-complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1311.3297, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
24 | François Le Gall, Shota Nakagawa, Harumichi Nishimura |
On QMA protocols with two short quantum proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Quantum Inf. Comput. ![In: Quantum Inf. Comput. 12(7-8), pp. 589-600, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
24 | Sevag Gharibian, Julia Kempe |
Approximation Algorithms for QMA-Complete Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 41(4), pp. 1028-1050, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
24 | Alessandro Chiesa, Michael A. Forbes 0001 |
Improved Soundness for QMA with Multiple Provers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR11, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
24 | Sevag Gharibian, Julia Kempe |
Approximation algorithms for QMA-complete problems ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1101.3884, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
24 | François Le Gall, Shota Nakagawa, Harumichi Nishimura |
On QMA Protocols with Two Short Quantum Proofs ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1108.4306, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
24 | Sevag Gharibian, Jamie Sikora, Sarvagya Upadhyay |
QMA variants with polynomially many provers ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1108.0617, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
24 | Alessandro Chiesa, Michael A. Forbes 0001 |
Improved Soundness for QMA with Multiple Provers ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1108.2098, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
24 | Sevag Gharibian, Julia Kempe |
Approximation Algorithms for QMA-Complete Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 26th Annual IEEE Conference on Computational Complexity, CCC 2011, San Jose, California, USA, June 8-10, 2011, pp. 178-188, 2011, IEEE Computer Society, 978-0-7695-4411-3. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
24 | Bill Rosgen |
Testing Non-isometry Is QMA-Complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TQC ![In: Theory of Quantum Computation, Communication, and Cryptography - 5th Conference, TQC 2010, Leeds, UK, April 13-15, 2010, Revised Selected Papers, pp. 63-76, 2010, Springer, 978-3-642-18072-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FUZZ-IEEE ![In: FUZZ-IEEE 2010, IEEE International Conference on Fuzzy Systems, Barcelona, Spain, 18-23 July, 2010, Proceedings, pp. 1-8, 2010, IEEE, 978-1-4244-6919-2. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
24 | Scott Aaronson |
On perfect completeness for QMA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Quantum Inf. Comput. ![In: Quantum Inf. Comput. 9(1&2), pp. 81-89, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
24 | Daniel Nagaj, Pawel Wocjan, Yong Zhang |
Fast amplification of QMA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Quantum Inf. Comput. ![In: Quantum Inf. Comput. 9(11&12), pp. 1053-1068, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
24 | Scott Aaronson |
On Perfect Completeness for QMA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR08, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Intell. Syst. ![In: Int. J. Intell. Syst. 21(2), pp. 193-208, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
24 | Scott Aaronson |
QMA/qpoly Is Contained In PSPACE/poly: De-Merlinizing Quantum Protocols ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR05, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
24 | Scott Aaronson |
QMA/qpoly Is Contained In PSPACE/poly: De-Merlinizing Quantum Protocols ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/quant-ph/0510230, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
24 | Julia Kempe, Oded Regev 0001 |
3-local Hamiltonian is QMA-complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Quantum Inf. Comput. ![In: Quantum Inf. Comput. 3(3), pp. 258-264, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
24 | Mikhail N. Vyalyi |
QMA=PP implies that PP contains PH ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR03, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP BibTeX RDF |
|
21 | Chris Marriott, John Watrous |
Quantum Arthur-Merlin games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 14(2), pp. 122-152, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
68Q15, Subject classification. 68Q10 |
21 | Bill Rosgen |
On the Hardness of Distinguishing Mixed-State Quantum Computations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 20th Annual IEEE Conference on Computational Complexity (CCC 2005), 11-15 June 2005, San Jose, CA, USA, pp. 344-354, 2005, IEEE Computer Society, 0-7695-2364-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|