<p>There are two way to see your question :</p>

<ol>
<li>Is unbounded fanout a reasonable approximation for realistic (quantum) circuits ?</li>
<li>Is there a realistic quantum architecture which is effectively equivalent to the quantum circuit with unbounded fan-out ?</li>
</ol>

<p>Peter Shor essentially suggested the formulation 1. in his comment above, and I’ll let experimentalists answer this question. </p>

<p>The question 2. seems strange, but I bring it forward because its answer is positive : In a 2009 paper (<a href="http://arxiv.org/abs/0909.4673" rel="nofollow">arXiv:0909.4673</a>, <a href="http://link.springer.com/chapter/10.1007%2F978-3-642-18073-6_4" rel="nofollow">paywalled version</a>), Dan Browne, Elham Kashefi, and Simon Perdrix showed that <a href="https://en.wikipedia.org/wiki/One-way_quantum_computer" rel="nofollow">Measurement Based Quantum Computing</a> (MBQC), is equivalent up to a classical side-processing of logarithmic depth, to the quantum circuit model augmented with unbounded fanout gates. </p>

<p>They basically recall that the unbounded parity gate is a Clifford gate and can be therefore be expressed as a measurement pattern of constant depth (<a href="http://arxiv.org/abs/quant-ph/0301052" rel="nofollow">arXiv</a>,<a href="http://journals.aps.org/pra/abstract/10.1103/PhysRevA.68.022312" rel="nofollow">paywalled PRA</a>) and show that a fanout gate is nothing else than a parity gate “sandwiched” between two layers of Hadamard gates, and can therefore be simulated in constant depth.</p>

<p>Therefore, your question</p>

<blockquote>
  <p>Is there any experimental evidence to suggest whether such constant-latency quantum fanout unitary operations are feasible?</p>
</blockquote>

<p>is equivalent to</p>

<blockquote>
  <p>Is there any experimental evidence to suggest whether Measurent Based Quantum Computing is feasible?</p>
</blockquote>

<p>I personally think the answer to the latter question is “yes”, but the opinions on the feasibility of a given quantum computing architecture tend to be subjective...</p>

CC BY-SA 3.0
2016-02-04T17:53:05.247Z
2016-02-04T17:53:05.247Z
Frédéric Grosshans
<p>It is known that the "unbounded quantum fanout operation" is very powerful: (See, for example, Hoyer et al. : <a href="http://theoryofcomputing.org/articles/v001a005/v001a005.pdf" rel="nofollow">http://theoryofcomputing.org/articles/v001a005/v001a005.pdf</a>). </p>

<p>In particular, it is known that many operations that cannot be done in constant depth classical circuits can be done in constant depth quantum cicuits that include the quantum fan-out operation.</p>

<p>However, I can't seem to find any discussion as to whether "constant depth" fanout is possible physically.</p>

<p>In classical computation, it seems fairly reasonable to consider "fan-out" to be an operation that does not add to the "depth" of a circuit: such a computational model models the latency of actual physical circuits of reasonable size.</p>

<p>For a fair comparison, unbounded quantum fanout would need to be achievable using some kind of experiment with a latency that scales as a constant with the size of the fanout (if it scales even logarithmically, then that kind of defeats the whole advantage of the quantum fanout operation).</p>

<p>Is there any experimental evidence to suggest whether such constant-latency quantum fanout unitary operations are feasible?</p>

CC BY-SA 3.0
2016-02-04T14:56:34.053Z
You're comparing apples and oranges. Unbounded fanout is not experimentally feasible in classical computation. It's a pretty good model for certain reasonably-sized circuits. It's also not experimentally feasible in quantum computation. The question is: how good a model is it?
Peter Shor 
<quantum-computing><circuit-complexity><circuit-depth>
Is unbounded quantum fanout operation experimentally feasible?
Chris Blake
# Is unbounded quantum fanout operation experimentally feasible?

(Asked by: username_0 on 2016-02-04)

It is known that the "unbounded quantum fanout operation" is very powerful: (See, for example, Hoyer et al. : <http://theoryofcomputing.org/articles/v001a005/v001a005.pdf>).

In particular, it is known that many operations that cannot be done in constant depth classical circuits can be done in constant depth quantum cicuits that include the quantum fan-out operation.

However, I can't seem to find any discussion as to whether "constant depth" fanout is possible physically.

In classical computation, it seems fairly reasonable to consider "fan-out" to be an operation that does not add to the "depth" of a circuit: such a computational model models the latency of actual physical circuits of reasonable size.

For a fair comparison, unbounded quantum fanout would need to be achievable using some kind of experiment with a latency that scales as a constant with the size of the fanout (if it scales even logarithmically, then that kind of defeats the whole advantage of the quantum fanout operation).

Is there any experimental evidence to suggest whether such constant-latency quantum fanout unitary operations are feasible?

**Tags:** quantum-computing, circuit-complexity, circuit-depth

> **Comments:**
> **username_1**: You're comparing apples and oranges. Unbounded fanout is not experimentally feasible in classical computation. It's a pretty good model for certain reasonably-sized circuits. It's also not experimentally feasible in quantum computation. The question is: how good a model is it?  

---

## 1 answers

### Answer by username_2 on 2016-02-04. Score: 2 | Accepted answer

There are two way to see your question :

1. Is unbounded fanout a reasonable approximation for realistic (quantum) circuits ?
2. Is there a realistic quantum architecture which is effectively equivalent to the quantum circuit with unbounded fan-out ?

username_1essentially suggested the formulation 1. in his comment above, and I’ll let experimentalists answer this question.

The question 2. seems strange, but I bring it forward because its answer is positive : In a 2009 paper ([arXiv:0909.4673](http://arxiv.org/abs/0909.4673), [paywalled version](http://link.springer.com/chapter/10.1007%2F978-3-642-18073-6_4)), Dan Browne, Elham Kashefi, and Simon Perdrix showed that [Measurement Based Quantum Computing](https://en.wikipedia.org/wiki/One-way_quantum_computer) (MBQC), is equivalent up to a classical side-processing of logarithmic depth, to the quantum circuit model augmented with unbounded fanout gates.

They basically recall that the unbounded parity gate is a Clifford gate and can be therefore be expressed as a measurement pattern of constant depth ([arXiv](http://arxiv.org/abs/quant-ph/0301052),[paywalled PRA](http://journals.aps.org/pra/abstract/10.1103/PhysRevA.68.022312)) and show that a fanout gate is nothing else than a parity gate “sandwiched” between two layers of Hadamard gates, and can therefore be simulated in constant depth.

Therefore, your question

> Is there any experimental evidence to suggest whether such constant-latency quantum fanout unitary operations are feasible?

is equivalent to

> Is there any experimental evidence to suggest whether Measurent Based Quantum Computing is feasible?

I personally think the answer to the latter question is “yes”, but the opinions on the feasibility of a given quantum computing architecture tend to be subjective...


---

