scientific article; zbMATH DE number 1962817
From MaRDI portal
Publication:4418653
Recommendations
- Quantum addition circuits and unbounded fan-out
- Hardness of classically simulating quantum circuits with unbounded Toffoli and fan-out gates
- Quantum lower bounds for fanout
- Realization of Quantum Circuits in Fock Space
- NONUNITARY QUANTUM CIRCUIT
- Efficient circuits for exact-universal computation with qudits
- Exponential separation between shallow quantum circuits and unbounded fan-in shallow classical circuits
- Quantum gates and circuits
- scientific article; zbMATH DE number 5666680
- Efficient Universal Quantum Circuits
Cited in
(14)- Power of uninitialized qubits in shallow quantum circuits
- Parallel quantum computation and quantum codes
- Hardness of classically simulating quantum circuits with unbounded Toffoli and fan-out gates
- Quantum circuits and low-degree polynomials over \(\mathbb{F}_2\)
- Quantum fan-out is powerful
- Quantum addition circuits and unbounded fan-out
- Collapse of the hierarchy of constant-depth exact quantum circuits
- Counting, fanout and the complexity of quantum ACC
- Quantum lower bounds for fanout
- Exponential separation between shallow quantum circuits and unbounded fan-in shallow classical circuits
- Efficient Universal Quantum Circuits
- Fundamentals of Computation Theory
- On the need for large quantum depth
- Parity vs. \(\text{AC}^0\) with simple quantum preprocessing
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4418653)
