Pages that link to "Item:Q3088963"
From MaRDI portal
The following pages link to Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy (Q3088963):
Displayed 10 items.
- The complexity of approximating complex-valued Ising and Tutte partition functions (Q1686832) (← links)
- Verification of quantum computation: an overview of existing approaches (Q2311888) (← links)
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz (Q2632506) (← links)
- Complexity Classification of Local Hamiltonian Problems (Q2799351) (← links)
- A linear-optical proof that the permanent is # <b>P</b> -hard (Q2901811) (← links)
- Quantum circuits and low-degree polynomials over ${{\mathbb{F}}_\mathsf{2}}$ (Q2969880) (← links)
- Optimised resource construction for verifiable quantum computation (Q2988006) (← links)
- Commuting Quantum Circuits with Few Outputs are Unlikely to be Classically Simulatable (Q3196386) (← links)
- Fault-tolerant conversion between adjacent Reed–Muller quantum codes based on gauge fixing (Q4642694) (← links)
- DIAGONAL-UNITARY 2-DESIGN AND THEIR IMPLEMENTATIONS BY QUANTUM CIRCUITS (Q5417138) (← links)