Showing quant-phShow all
2 papers · 1 filter
quant-ph2025
Tight bounds on depth-2 QAC-circuits computing parity
Stephen Fenner, Daniel Grier, Daniel Padé +1
We show that the parity of more than three non-target input bits cannot be computed by QAC-circuits of depth-2, not even uncleanly, regardless of the number of ancilla qubits. This…
quant-ph2024
Quantum Threshold is Powerful
Daniel Grier, Jackson Morris
In 2005, Høyer and Å palek showed that constant-depth quantum circuits augmented with multi-qubit Fanout gates are quite powerful, able to compute a wide variety of Boolean functi…