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 27 items.
- The complexity of approximating complex-valued Ising and Tutte partition functions (Q1686832) (← links)
- Learning nonlinear input-output maps with dissipative quantum systems (Q2105978) (← links)
- Classically simulating quantum circuits with local depolarizing noise (Q2238211) (← 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)
- Quantum extensive-form games (Q2686222) (← 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)
- (Q3384939) (← links)
- Fault-tolerant conversion between adjacent Reed–Muller quantum codes based on gauge fixing (Q4642694) (← links)
- (Q5089258) (← links)
- (Q5091772) (← links)
- (Q5121907) (← links)
- (Q5140846) (← links)
- Compact Gaussian quantum computation by multi-pixel homodyne detection (Q5141563) (← links)
- A framework for phase and interference in generalized probabilistic theories (Q5141572) (← links)
- Generating a state<i>t</i>-design by diagonal quantum circuits (Q5143214) (← links)
- Exact and efficient simulation of concordant computation (Q5144311) (← links)
- DIAGONAL-UNITARY 2-DESIGN AND THEIR IMPLEMENTATIONS BY QUANTUM CIRCUITS (Q5417138) (← links)
- Computation in a general physical setting (Q5877780) (← links)
- (Q5889073) (← links)
- Commuting quantum circuits and complexity of Ising partition functions (Q6100591) (← links)
- Approximate unitary \(t\)-designs by short random quantum circuits using nearest-neighbor and long-range gates (Q6165434) (← links)
- Random quantum circuits transform local noise into global white noise (Q6202916) (← links)