Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
2,332
Constant-Depth Quantum Circuits with Gates for Addition
"... Abstract. We investigate a class QNC 0 (ADD) that is QNC 0 with gates for addition of two binary numbers, where QNC 0 is a class consisting of quantum operations computed by constant-depth quantum ..."
Abstract
- Add to MetaCart
Abstract. We investigate a class QNC 0 (ADD) that is QNC 0 with gates for addition of two binary numbers, where QNC 0 is a class consisting of quantum operations computed by constant-depth quantum
Bounds on the power of constant-depth quantum circuits. Preprint: quant-ph/0312209
- In Proc. 15th International Symposium on on Fundamentals of Computation Theory (FCT 2005), volume 3623 of Lecture Notes in Computer Science
, 2004
"... We show that if a language is recognized within certain error bounds by constant-depth quantum circuits over a finite family of gates, then it is computable in (classical) polynomial time. In particular, for 0 < ɛ ≤ δ ≤ 1, we define BQNC 0 ɛ,δ to be the class of languages recognized by constant d ..."
Abstract
-
Cited by 19 (1 self)
- Add to MetaCart
We show that if a language is recognized within certain error bounds by constant-depth quantum circuits over a finite family of gates, then it is computable in (classical) polynomial time. In particular, for 0 < ɛ ≤ δ ≤ 1, we define BQNC 0 ɛ,δ to be the class of languages recognized by constant
Adaptive Quantum Computation, Constant Depth Quantum Circuits and Arthur-Merlin Games
, 2004
"... We present evidence that there exist quantum computations that can be carried out in constant depth, using 2-qubit gates, that cannot be simulated classically with high accuracy. We prove that if one can simulate these circuits classically efficiently then BQP ⊆ AM. 1 ..."
Abstract
- Add to MetaCart
We present evidence that there exist quantum computations that can be carried out in constant depth, using 2-qubit gates, that cannot be simulated classically with high accuracy. We prove that if one can simulate these circuits classically efficiently then BQP ⊆ AM. 1
Adaptive Quantum Computation, Constant Depth Quantum Circuits and Arthur-Merlin Games
, 2004
"... We present evidence that there exist quantum computations that can be carried out in constant depth, using 2-qubit gates, that cannot be simulated classically with high accuracy. We prove that if one can simulate these circuits classically efficiently then BQP ⊆ AM. 1 ..."
Abstract
- Add to MetaCart
We present evidence that there exist quantum computations that can be carried out in constant depth, using 2-qubit gates, that cannot be simulated classically with high accuracy. We prove that if one can simulate these circuits classically efficiently then BQP ⊆ AM. 1
Adaptive Quantum Computation, Constant Depth Quantum Circuits and Arthur-Merlin Games
, 2004
"... We present evidence that there exist quantum computations that can be carried out in constant depth, using 2-qubit gates, that cannot be simulated classically with high accuracy. We prove that if one can simulate these circuits classically efficiently then BQP ⊆ AM. 1 ..."
Abstract
- Add to MetaCart
We present evidence that there exist quantum computations that can be carried out in constant depth, using 2-qubit gates, that cannot be simulated classically with high accuracy. We prove that if one can simulate these circuits classically efficiently then BQP ⊆ AM. 1
Adaptive Quantum Computation, Constant Depth Quantum Circuits and Arthur-Merlin Games
, 2003
"... We present evidence that there exist quantum computations that can be carried out in constant depth, using 2-qubit gates, that cannot be simulated classically with high accuracy. We prove that if one can simulate these circuits classically efficiently then BQP ⊆ AM. We show that if an efficient ‘cou ..."
Abstract
- Add to MetaCart
We present evidence that there exist quantum computations that can be carried out in constant depth, using 2-qubit gates, that cannot be simulated classically with high accuracy. We prove that if one can simulate these circuits classically efficiently then BQP ⊆ AM. We show that if an efficient
A New Lower Bound Technique for Quantum Circuits without Ancillæ
"... We present a technique to derive depth lower bounds for quantum circuits. The technique is based on the observation that in circuits without ancillæ, only a few input states can set all the control qubits of a Toffoli gate to 1. This can be used to selectively remove large Toffoli gates from a quant ..."
Abstract
- Add to MetaCart
quantum circuit while keeping the cumulative error low. We use the technique to give another proof that parity cannot be computed by constant depth quantum circuits without ancillæ. 1
Quantum Lower Bounds for Fanout
, 2003
"... We prove several new lower bounds for constant depth quantum circuits. The main result is that parity (and hence fanout) requires log depth circuits, when the circuits are composed of single qubit and arbitrary size Tooli gates, and when they use only constantly many ancill. Under this constraint, t ..."
Abstract
-
Cited by 9 (3 self)
- Add to MetaCart
We prove several new lower bounds for constant depth quantum circuits. The main result is that parity (and hence fanout) requires log depth circuits, when the circuits are composed of single qubit and arbitrary size Tooli gates, and when they use only constantly many ancill. Under this constraint
Non-Identity Check Remains QMA-Complete for Short Circuits
, 2008
"... The Non-Identity Check problem asks whether a given a quantum circuit is far away from the identity or not. It is well known that this problem is QMA-Complete [14]. In this note, it is shown that the Non-Identity Check problem remains QMA-Complete for circuits of short depth. Specifically, we prove ..."
Abstract
-
Cited by 4 (0 self)
- Add to MetaCart
that for constant depth quantum circuit in which each gate is given to at least Ω(log n) bits of precision, the Non-Identity Check problem is QMA-Complete. It also follows that the hardness of the problem remains for polylogarithmic depth circuit consisting of only gates from any universal gate set
Results 1 - 10
of
2,332
