Efficient algorithm for a quantum analogue of 2-SAT
From MaRDI portal
Recommendations
Cited in
(30)- The complexity of translationally invariant spin chains with low local dimension
- Efficient quantum algorithm for the parity problem of a certain function
- Solving binary \(\mathcal {MQ}\) with Grover's algorithm
- The commuting local Hamiltonian problem on locally expanding graphs is approximable in \(\mathsf{NP}\)
- Entanglement subvolume law for 2D frustration-free spin systems
- Solving SAT (and MaxSAT) with a quantum annealer: foundations, encodings, and preliminary results
- On efficiently solvable cases of quantum \(k\)-SAT
- Perturbation gadgets: arbitrary energy scales from a single strong interaction
- Matched instances of quantum satisfiability (QSat) -- product state solutions of restrictions
- Quantum logic is undecidable
- Total functions in QMA
- scientific article; zbMATH DE number 1583866 (Why is no real title available?)
- Complexity classification of local Hamiltonian problems
- Quantum 3-SAT Is QMA₁-complete
- Stronger methods of making quantum interactive proofs perfectly complete
- Linear-Time Algorithm for Quantum 2SAT
- A parallel quantum algorithm for the satisfiability problem
- Linear time algorithm for quantum 2SAT
- The complexity of translationally invariant low-dimensional spin lattices in 3D
- On the complexity of probabilistic trials for hidden satisfiability problems
- On efficiently solvable cases of quantum k-SAT
- A quantum differentiation of k-SAT instances
- Gapped and gapless phases of frustration-free spin-\(\frac{1}{2}\) chains
- scientific article; zbMATH DE number 6789292 (Why is no real title available?)
- Faster than classical quantum algorithm for dense formulas of exact satisfiability and occupation problems
- Classical and quantum satisfiability
- The quantum detection of projectors in finite-dimensional algebras and holography
- Zero-knowledge proof systems for QMA
- Testing quantum satisfiability
- Bounds on the ground state energy of quantum p-spin Hamiltonians
This page was built for publication: Efficient algorithm for a quantum analogue of 2-SAT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3001461)
