Pages that link to "Item:Q3149866"
From MaRDI portal
The following pages link to Quantum Circuits That Can Be Simulated Classically in Polynomial Time (Q3149866):
Displaying 13 items.
- Boson-sampling with non-interacting fermions (Q5258464) (← links)
- Classification of a Class of Counting Problems Using Holographic Reductions (Q5323095) (← links)
- Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP (Q5737812) (← links)
- A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY (Q5858921) (← links)
- The Complexity of Symmetric Boolean Parity Holant Problems (Q5892610) (← links)
- Commuting quantum circuits and complexity of Ising partition functions (Q6100591) (← links)
- Holographic algorithms on domains of general size (Q6109063) (← links)
- Quantum circuit dynamics via path integrals: Is there a classical action for discrete-time paths? (Q6156859) (← links)
- Undirected determinant and its complexity (Q6166664) (← links)
- The computational complexity of Holant problems on 3-regular graphs (Q6199389) (← links)
- Complexity of quantum circuits via sensitivity, magic, and coherence (Q6564161) (← links)
- Brick wall quantum circuits with global fermionic symmetry (Q6613170) (← links)
- A complexity trichotomy for \(k\)-regular asymmetric spin systems with complex edge functions (Q6634373) (← links)