Pages that link to "Item:Q3561913"
From MaRDI portal
The following pages link to Temporally unstructured quantum computation (Q3561913):
Displayed 12 items.
- The complexity of approximating complex-valued Ising and Tutte partition functions (Q1686832) (← links)
- Towards quantum computing based community detection (Q2065973) (← links)
- Constant-round blind classical verification of quantum sampling (Q2170108) (← links)
- Verification of quantum computation: an overview of existing approaches (Q2311888) (← links)
- Quantum Homomorphic Encryption for Polynomial-Sized Circuits (Q2829941) (← links)
- Quantum circuits and low-degree polynomials over ${{\mathbb{F}}_\mathsf{2}}$ (Q2969880) (← links)
- Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy (Q3088963) (← links)
- (Q3384939) (← 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)
- DIAGONAL-UNITARY 2-DESIGN AND THEIR IMPLEMENTATIONS BY QUANTUM CIRCUITS (Q5417138) (← links)
- Commuting quantum circuits and complexity of Ising partition functions (Q6100591) (← links)