Live briefing
Everything about QMA
Quantum Merlin Arthur
QMA, as an abbreviation for Quantum Merlin Arthur, refers to a complexity class in computational complexity theory. It is the set of all formal languages that satisfy the following properties:If a string is in the language, then there is a polynomial-size quantum proof that convinces a polynomial-time quantum verifier of this fact with high probability. If a string is not in the language, every polynomial-size quantum state is rejected by the verifier with high probability. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: QMAA 5-minute orientation
- Skim a recent paper: QMA-Hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-KnowledgeInfluential work since 2022
- Pick up a classic book: Kai qmaThe most-reprinted book on the subject
- Read the landmark paper: Quantum Computational Complexity of the N -Representability Problem: QMA CompleteCited 157 times
- Go sideways: QIP (complexity)A closely related topic
- Go sideways: BQPA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Quantum Computational Complexity of the N -Representability Problem: QMA Complete
"NON-IDENTITY-CHECK" IS QMA-COMPLETE
3-Local Hamiltonian is QMA-complete
Interacting Boson Problems Can Be QMA Hard
Fast amplification of QMA
A majority model in group decision making using QMA-OWA operators
Approximation Algorithms for QMA-Complete Problems
Polyamine analogue QMA attenuated ischemic injury in MCAO rats via ERK and Akt activated Nrf2/HO-1 signaling pathway
🆕 Influential since 2022
QMA-Hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge
Clique Homology is $${{\mathsf{QMA}}}_{1}$$-hard
A microCT imaging protocol for reproducible and efficient quantitative morphometric analysis (QMA) of joint structures of the in situ mouse tibio-femoral joint
SPHARM-PDM based image preprocessing pipeline for quantitative morphometric analysis (QMA) for in situ joint assessment in rabbit and rat models
Associations among production systems, identity aspects, microbiological results and physical-chemical traits as revealed by official analyses of Minas Artisanal Cheese (QMA, Queijo Minas Artesanal)
📚 Books worth reading
- 📕Kai qmaLeila Mesxi · 1999
- 📕MAS QMA 2019 Topical Conference on Quantitative MicroanalysisMicroanalysis Society MAS · 2019
- 📕Hey'Ya Arab Women in SportsBrigitte Lacombe QMA · 2012
- 📕Shiva ComesEdward Maumbauer · 2019
- 📕Mtʻvaris qmaJano Jikʻiże · 2002
- 📕A method for the quantitative metallographic analysis of nuclear fuels (Programme QMA)A. Moreno · 1978
Data Mining in Large Sets of Complex DataRobson L. F. Cordeiro · 2013- 📕Kavkasiuri etiketiXatʻuna Ioseliani, M. B. Kandelaki · 2018
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- QIP (complexity) In computational complexity theory, the class QIP (which stands for Quantum Interactive Proof) is the quantum computing analogue of the classical complexity…
- BQP In computational complexity theory, bounded-error quantum polynomial time (BQP) is the class of decision problems solvable by a quantum computer in polynomial…
- NLTS conjecture In quantum information theory, the no low-energy trivial state (NLTS) conjecture is a lower bound on the complexity of certain classes of quantum states…
- Quantum complexity theory Quantum complexity theory is the subfield of computational complexity theory that deals with complexity classes defined using quantum computers, a computational…
- Interactive proof system In computational complexity theory, an interactive proof system is an abstract machine that models computation as the exchange of messages between two…
- PSPACE Unsolved problem in computer science 𝖯=?𝖯𝖲𝖯𝖠𝖢𝖤 More unsolved problems in computer science In computational complexity theory, PSPACE is the set…
- IP (complexity) In computational complexity theory, the class IP (which stands for interactive proof) is the class of problems solvable by an interactive proof system…
- PostBQP In computational complexity theory, PostBQP is a complexity class consisting of all of the computational problems solvable in polynomial time on a quantum…