On the Satisfiability of Quantum Circuits of Small Treewidth

DOI10.1007/978-3-319-20297-6_11zbMath1378.68043arXiv1404.5565OpenAlexW2583162222MaRDI QIDQ3194714

Mateus de Oliveira Oliveira

Publication date: 20 October 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.5565

zbMATH Keywords

treewidthtensor networkssatisfiability of quantum circuits

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items

On the satisfiability of quantum circuits of small treewidth

Cites Work

• Satisfiability, branch-width and Tseitin tautologies
• Graph minors. III. Planar tree-width
• Linear time algorithms for NP-hard problems restricted to partial k- trees
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Quantum Computation and Quantum Information
• Quantum Circuits That Can Be Simulated Classically in Polynomial Time
• Easy problems for tree-decomposable graphs
• Complexity and Algorithms for Well-Structured k-SAT Instances
• Simulating Quantum Computation by Contracting Tensor Networks
• Bounded Round Interactive Proofs in Finite Groups
• On the role of entanglement in quantum-computational speed-up
• Theory and Applications of Satisfiability Testing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item