Quantum advantage in deciding NP-complete problems
DOI10.1007/S11128-023-03889-3OpenAlexW4323314013MaRDI QIDQ2689786FDOQ2689786
Authors: Marius Nagy, Naya Nagy 
Publication date: 14 March 2023
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11128-023-03889-3
Recommendations
probabilityNP-completequantum state discriminationprojective measurementquantum advantagePOVM measurementdecision-version
Quantum computation (81P68) Quantum measurement theory, state operations, state preparations (81P15) Quantum state tomography, quantum state discrimination (81P18)
Cites Work
- Title not available (Why is that?)
- Statistical decision theory for quantum systems
- Quantum computation and quantum information. 10th anniversary edition
- Unambiguous discrimination between linearly independent quantum states.
- Optimum unambiguous discrimination of two mixed quantum states
- Optimal distinction between two non-orthogonal quantum states
- Optimal distinction between non-orthogonal quantum states
- A semidefinite programming approach to optimal unambiguous discrimination of quantum states
Cited In (7)
- Quantum advantage through the magic pentagram problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Quantum advantage with shallow circuits
- Solving NP-Complete Problems with Quantum Search
- Characterization of quantum computable decision problems by state discrimination
- Superlinear advantage for exact quantum algorithms
This page was built for publication: Quantum advantage in deciding NP-complete problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2689786)
