Webb. The Bose-Hubbard model is QMA-complete, 2013. arXiv:1311.3297.A. M. Childs, D. Gosset, and Z. Webb. The Bose-Hubbard model is QMA-complete. November 2013. http://arxiv.org/abs/1311.3297.Childs A. M., Gosset D. & Webb Z. The Bose-Hubbard model is QMA-complete . e-...
9-State 1-Dim Hamiltonians is QMA-completeQmacomplete, Hamiltonians
Non-identity check is QMA-complete - Janzing, Wocjan, et al. - 2005 () Citation Context ...information on the solution. To this end, we assume that we are given a quantum circuit Yr which decides whether a string x is in the given language L in the sense of Definition 2. In ...
Z. Ji and X. Wu, Non-identity check remains QMA-complete for short circuits, Proc. Asian Confer- ence on Quantum Information Science, 2009; http://arxiv.org/abs/0906.5416Non-identity check remains QMA-complete for short circuits - Ji, Wu () Citation Context ...one of these to be the...
Testing non-isometry is QMA-complete, Theory of Quantum - Rosgen - 2011 () Citation Context ...ψ|)‖ � ɛ (no case) Φ is an ɛ-isometry, i.e. ∀|ψ〉, ‖(Φ ⊗ 1H1)(|ψ〉〈ψ|)‖ � 1 − ɛ, promised one of these to be the case, where 1 2 > ...
We prove that approximating the ground energy of the Bose-Hubbard\nmodel on a graph at fixed particle number is QMA-complete. In our QMA-hardness\nproof, we encode the history of an n-qubit computation in the subspace with at\nmost one particle per site (i.e., hard-core bosons). ...
We show that the 2D local Hamiltonian problem with the restriction that the ground state satisfies area laws is QMA-complete. We also prove similar results in 2D translationally invariant systems and for the 3D Heisenberg and Hubbard models. Consequently, in general the ground states of local ...
Gharibian S., Kempe J.: Approximation algorithms for QMA-complete problems. SIAM J. Comput. 41 (4), 1028–1050 (2012) arXiv:1101.3884 MathSciNetApproximation algorithms for QMA-complete problems - Gharibian, Kempe - 2012 () Citation Context ...an eigenvalue greater than b (no ...
Bravyi showed that quantum 2-SAT can be solved efficiently on a classical computer and that quantum k-SAT with k >= 4 is QMA(1)-complete [S. Bravyi, Efficient Algorithm for a Quantum Analogue of 2-SAT, eprint arXiv: quant-ph/0602108, 2006]. Quantum 3-SAT was known to be ...
& Webb Z. The Bose-Hubbard model is QMA-complete . e-print arXiv: 1311.3297 ; (2013).Childs, A.M., Gosset, D., Webb, Z.: The Bose-Hubbard model is QMA-complete. arXiv:1311.3297The Bose-Hubbard model is QMA-complete, Proceedings of the 41st International Colloquium on Automata, ...