Quantum circuit

<h2 id="reversible-classical-logic-gates">Reversible classical logic gates</h2>
Most elementary <a href="/facts/Logic_gate/RHLulvKI">logic gates</a> of a classical computer are not <a href="/facts/Reversible_computing/yEum13Vs">reversible</a>. Thus, for instance, for an <a href="/facts/AND_gate/tVKQD0w1">AND gate</a> one cannot always recover the two input bits from the output bit; for example, if the output bit is 0, we cannot tell from this whether the input bits are 01 or 10 or 00.
However, reversible gates in classical computers are easily constructed for bit strings of any length; moreover, these are actually of practical interest, since irreversible gates must always increase physical <a href="/facts/Entropy/s52IXeFz">entropy</a>. A reversible gate is a reversible function on n-bit data that returns n-bit data, where an n-bit data is a <a href="/facts/String_(computer_science)/4ChJu5WS">string</a> of bits x1,x2, ...,xn of length n. The set of n-bit data is the space {0,1}n, which consists of 2n strings of 0's and 1's.
More precisely: an n-bit reversible gate is a <a href="/facts/Bijective/j4gTuTmW">bijective</a> mapping f from the set {0,1}n of n-bit data onto itself.
An example of such a reversible gate f is a mapping that applies a fixed permutation to its inputs.
For reasons of practical engineering, one typically studies gates only for small values of n, e.g. n=1, n=2 or n=3. These gates can be easily described by tables.

<h2 id="quantum-logic-gates">Quantum logic gates</h2>
The <a href="/facts/Quantum_logic_gate/EFV5sPCU">quantum logic gates</a> are <a href="/facts/Reversible_computation/yEum13Vs">reversible</a> <a href="/facts/Unitary_transformation/DyvU0nms">unitary transformations</a> on at least one qubit. Multiple qubits taken together are referred to as <a href="/facts/Quantum_register/SKE6E55m">quantum registers</a>. To define quantum gates, we first need to specify the quantum replacement of an n-bit datum. The quantized version of classical n-bit space {0,1}n is the <a href="/facts/Hilbert_space/aDFMh4lV">Hilbert space</a>

H
          
            QB
            ⁡
            (
            n
            )
          
        
        =
        
          ℓ
          
            2
          
        
        (
        {
        0
        ,
        1
        
          }
          
            n
          
        
        )
        .
      
    
    {\displaystyle H_{\operatorname {QB} (n)}=\ell ^{2}(\{0,1\}^{n}).}

This is by definition the space of complex-valued functions on {0,1}n and is naturally an <a href="/facts/Inner_product_space/HoyjElEy">inner product space</a>. 
 
 
 
 
 ℓ
 
 2
 
 
 
 
 {\displaystyle \ell ^{2}}
 
 means the function is a <a href="/facts/Square-integrable_function/IASblcJJ">square-integrable function</a>. This space can also be regarded as consisting of <a href="/facts/Linear_combination/CVjL6kuN">linear combinations</a>, or <a href="/facts/Quantum_superposition/4z1UJg9o">superpositions</a>, of classical bit strings. Note that HQB(n) is a vector space over the <a href="/facts/Complex_number/2w7mqI7e">complex numbers</a> of <a href="/facts/Dimension/0ktmUyac">dimension</a> 2n. The elements of this <a href="/facts/Vector_space/M1pxMLx2">vector space</a> are the possible state-vectors of n-<a href="/facts/Qubit/WveeEubw">qubit</a> quantum registers.
Using Dirac <a href="/facts/Bra-ket/NDlKsaRh">ket</a> notation, if x1,x2, ...,xn is a classical bit string, then

|
        
        
          x
          
            1
          
        
        ,
        
          x
          
            2
          
        
        ,
        ⋯
        ,
        
          x
          
            n
          
        
        ⟩
        
      
    
    {\displaystyle |x_{1},x_{2},\cdots ,x_{n}\rangle \quad }

is a special n-qubit register corresponding to the function which maps this classical bit string to 1 and maps all other bit strings to 0; these 2n special n-qubit registers are called computational basis states. All n-qubit registers are complex linear combinations of these computational basis states.
Quantum logic gates, in contrast to classical logic gates, are always reversible. One requires a special kind of reversible function, namely a <a href="/facts/Unitarity_(physics)/x2gXDAsS">unitary</a> mapping, that is, a linear transformation of a complex <a href="/facts/Inner_product_space/HoyjElEy">inner product space</a> that preserves the <a href="/facts/Hermitian_inner_product/HoyjElEy">Hermitian inner product</a>. An n-qubit (reversible) quantum gate is a <a href="/facts/Unitary_operators/rkypfQQ9">unitary mapping</a> U from the space HQB(n) of n-qubit registers onto itself.
Typically, we are only interested in gates for small values of n.
A reversible n-bit classical logic gate gives rise to a reversible n-bit quantum gate as follows: to each reversible n-bit logic gate f corresponds a quantum gate Wf defined as follows:

W
          
            f
          
        
        (
        
          |
        
        
          x
          
            1
          
        
        ,
        
          x
          
            2
          
        
        ,
        ⋯
        ,
        
          x
          
            n
          
        
        ⟩
        )
        =
        
          |
        
        f
        (
        
          x
          
            1
          
        
        ,
        
          x
          
            2
          
        
        ,
        ⋯
        ,
        
          x
          
            n
          
        
        )
        ⟩
        .
      
    
    {\displaystyle W_{f}(|x_{1},x_{2},\cdots ,x_{n}\rangle )=|f(x_{1},x_{2},\cdots ,x_{n})\rangle .}

Note that Wf permutes the computational basis states.
Of particular importance is the controlled NOT gate (also called <a href="/facts/Controlled_NOT_gate/hP1y4K6d">CNOT</a> gate) WCNOT defined on a quantized 2 qubit. Other examples of quantum logic gates derived from classical ones are the <a href="/facts/Toffoli_gate/WLaIv0qS">Toffoli gate</a> and the <a href="/facts/Fredkin_gate/mFmf5gqb">Fredkin gate</a>.
However, the Hilbert-space structure of the qubits permits many quantum gates that are not induced by classical ones. For example, a relative phase shift is a 1 qubit gate given by multiplication by the <a href="/facts/Quantum_logic_gate/EFV5sPCU">phase shift operator</a>:

P
        (
        φ
        )
        =
        
          
            [
            
              
                
                  1
                
                
                  0
                
              
              
                
                  0
                
                
                  
                    e
                    
                      i
                      φ
                    
                  
                
              
            
            ]
          
        
        ,
      
    
    {\displaystyle P(\varphi )={\begin{bmatrix}1&0\\0&e^{i\varphi }\end{bmatrix}},}

so

P
        (
        φ
        )
        
          |
        
        0
        ⟩
        =
        
          |
        
        0
        ⟩
        
        P
        (
        φ
        )
        
          |
        
        1
        ⟩
        =
        
          e
          
            i
            φ
          
        
        
          |
        
        1
        ⟩
        .
      
    
    {\displaystyle P(\varphi )|0\rangle =|0\rangle \quad P(\varphi )|1\rangle =e^{i\varphi }|1\rangle .}

<h2 id="reversible-logic-circuits">Reversible logic circuits</h2>
Main article: <a href="/facts/Reversible_computing/yEum13Vs">reversible computing</a>
Again, we consider first reversible classical computation. Conceptually, there is no difference between a reversible n-bit circuit and a reversible n-bit logic gate: either one is just an invertible function on the space of n bit data. However, as mentioned in the previous section, for engineering reasons we would like to have a small number of simple reversible gates, that can be put together to assemble any reversible circuit.
To explain this assembly process, suppose we have a reversible n-bit gate f and a reversible m-bit gate g. Putting them together means producing a new circuit by connecting some set of k outputs of f to some set of k inputs of g as in the figure below. In that figure, n=5, k=3 and m=7. The resulting circuit is also reversible and operates on n+m−k bits.

We will refer to this scheme as a classical assemblage (This concept corresponds to a technical definition in <a href="/facts/Alexei_Kitaev/yF6fPcey">Kitaev</a>'s pioneering paper cited below). In composing these reversible machines, it is important to ensure that the intermediate machines are also reversible. This condition assures that intermediate "garbage" is not created (the net physical effect would be to increase entropy, which is one of the motivations for going through this exercise).
Note that each horizontal line on the above picture represents either 0 or 1, not these probabilities. Since quantum computations are reversible, at each 'step' the number of lines must be the same number of input lines. Also, each input combination must be mapped to a single combination at each 'step'. This means that each intermediate combination in a quantum circuit is a bijective function of the input.<a class="footnote-ref" id="fnref:5" href="#fn:5">5</a>
Now it is possible to show that the <a href="/facts/Toffoli_gate/WLaIv0qS">Toffoli gate</a> is a universal gate. This means that given any reversible classical n-bit circuit h, we can construct a classical assemblage of Toffoli gates in the above manner to produce an (n+m)-bit circuit f such that

f
        (
        
          x
          
            1
          
        
        ,
        …
        ,
        
          x
          
            n
          
        
        ,
        
          
            
              0
              ,
              …
              ,
              0
            
            ⏟
          
        
        )
        =
        (
        
          y
          
            1
          
        
        ,
        …
        ,
        
          y
          
            n
          
        
        ,
        
          
            
              0
              ,
              …
              ,
              0
            
            ⏟
          
        
        )
      
    
    {\displaystyle f(x_{1},\ldots ,x_{n},\underbrace {0,\dots ,0} )=(y_{1},\ldots ,y_{n},\underbrace {0,\ldots ,0} )}

where there are m underbraced zeroed inputs and

(
 
 y
 
 1
 
 
 ,
 …
 ,
 
 y
 
 n
 
 
 )
 =
 h
 (
 
 x
 
 1
 
 
 ,
 …
 ,
 
 x
 
 n
 
 
 )
 
 
 {\displaystyle (y_{1},\ldots ,y_{n})=h(x_{1},\ldots ,x_{n})}
 
.
Notice that the result always has a string of m zeros as the <a href="/facts/Ancilla_(quantum_computing)/pDfqX9DJ">ancilla</a> bits. No "rubbish" is ever produced, and so this computation is indeed one that, in a physical sense, generates no entropy. This issue is carefully discussed in Kitaev's article.
More generally, any function f (bijective or not) can be simulated by a circuit of Toffoli gates. Obviously, if the mapping fails to be <a href="/facts/Injective/5ES6tqf5">injective</a>, at some point in the simulation (for example as the last step) some "garbage" has to be produced.
For quantum circuits a similar composition of qubit gates can be defined. That is, associated to any classical assemblage as above, we can produce a reversible quantum circuit when in place of f we have an n-qubit gate U and in place of g we have an m-qubit gate W. See illustration below:

The fact that connecting gates this way gives rise to a unitary mapping on n+m−k qubit space is easy to check. In a real quantum computer the physical connection between the gates is a major engineering challenge, since it is one of the places where <a href="/facts/Decoherence/mngM3rxy">decoherence</a> may occur.
There are also <a href="/facts/Quantum_gate/EFV5sPCU">universality theorems</a> for certain sets of well-known gates; such a universality theorem exists, for instance, for the pair consisting of the single qubit phase gate Uθ mentioned above (for a suitable value of θ), together with the 2-qubit <a href="/facts/Controlled_NOT_gate/hP1y4K6d">CNOT gate</a> WCNOT. However, the universality theorem for the quantum case is somewhat weaker than the one for the classical case; it asserts only that any reversible n-qubit circuit can be approximated arbitrarily well by circuits assembled from these two elementary gates. Note that there are <a href="/facts/Uncountable/zl2WqyJQ">uncountably</a> many possible single qubit phase gates, one for every possible angle θ, so they cannot all be represented by a finite circuit constructed from {Uθ, WCNOT}.

<h2 id="quantum-computations">Quantum computations</h2>
So far we have not shown how quantum circuits are used to perform computations. Since many important numerical problems reduce to computing a unitary transformation U on a finite-dimensional space (the celebrated <a href="/facts/Discrete_Fourier_transform/uK9Tjsbl">discrete Fourier transform</a> 
being a prime example), one might expect that some quantum circuit could be designed to carry out the transformation U. In principle, one needs only to prepare an n qubit state ψ as an appropriate superposition of computational basis states for the input and measure the output Uψ. Unfortunately, there are two problems with this:

<ul><li>One cannot measure the phase of ψ at any computational basis state so there is no way of reading out the complete answer. This is in the nature of measurement in quantum mechanics.</li>
<li>There is no way to efficiently prepare the input state ψ.</li></ul>
This does not prevent quantum circuits for the discrete Fourier transform from being used as intermediate steps in other quantum circuits, but the use is more subtle. In fact quantum computations are probabilistic.
We now provide a mathematical model for how quantum circuits can simulate
probabilistic but classical computations. Consider an r-qubit circuit U with
register space HQB(r). U is thus a unitary map

H
          
            QB
            ⁡
            (
            r
            )
          
        
        →
        
          H
          
            QB
            ⁡
            (
            r
            )
          
        
        .
      
    
    {\displaystyle H_{\operatorname {QB} (r)}\rightarrow H_{\operatorname {QB} (r)}.}

In order to associate this circuit to a classical mapping on bitstrings, we specify

<ul><li>An input register X = {0,1}m of m (classical) bits.</li>
<li>An output register Y = {0,1}n of n (classical) bits.</li></ul>
The contents x = x1, ..., xm of
the classical input register are used to initialize the qubit
register in some way. Ideally, this would be done with the computational basis
state

|
        
        
          
            
              x
              →
            
          
        
        ,
        0
        ⟩
        =
        
          |
        
        
          x
          
            1
          
        
        ,
        
          x
          
            2
          
        
        ,
        ⋯
        ,
        
          x
          
            m
          
        
        ,
        
          
            
              0
              ,
              …
              ,
              0
            
            ⏟
          
        
        ⟩
        ,
      
    
    {\displaystyle |{\vec {x}},0\rangle =|x_{1},x_{2},\cdots ,x_{m},\underbrace {0,\dots ,0} \rangle ,}

where there are r-m underbraced zeroed inputs. Nevertheless,
this perfect initialization is completely unrealistic. Let us assume
therefore that the initialization is a mixed state given by some density operator S which is near the idealized input in some appropriate metric, e.g.

Tr
        ⁡
        
          (
          
            
              
                |
              
            
            
              |
            
            
              
                
                  x
                  →
                
              
            
            ,
            0
            ⟩
            ⟨
            
              
                
                  x
                  →
                
              
            
            ,
            0
            
              |
            
            −
            S
            
              
                |
              
            
          
          )
        
        ≤
        δ
        .
      
    
    {\displaystyle \operatorname {Tr} \left({\big |}|{\vec {x}},0\rangle \langle {\vec {x}},0|-S{\big |}\right)\leq \delta .}

Similarly, the output register space is related to the qubit register, by a Y
valued observable A. Note that observables in quantum mechanics are usually defined in
terms of projection valued measures on R; if the variable
happens to be discrete, the projection valued measure reduces to a
family {Eλ} indexed on some parameter λ
ranging over a countable set. Similarly, a Y valued observable,
can be associated with a family of pairwise orthogonal projections
{Ey} indexed by elements of Y. such that

I
        =
        
          ∑
          
            y
            ∈
            Y
          
        
        
          E
          
            y
          
        
        .
      
    
    {\displaystyle I=\sum _{y\in Y}\operatorname {E} _{y}.}

Given a mixed state S, there corresponds a probability measure on Y
given by

Pr
        ⁡
        {
        y
        }
        =
        Tr
        ⁡
        (
        S
        
          E
          
            y
          
        
        )
        .
      
    
    {\displaystyle \operatorname {Pr} \{y\}=\operatorname {Tr} (S\operatorname {E} _{y}).}

The function F:X → Y is computed by a circuit
U:HQB(r) → HQB(r) to within ε if and only if
for all bitstrings x of length m

⟨
          
            
              
                
                  x
                  →
                
              
            
            ,
            0
            
              
                |
              
            
            
              U
              
                ∗
              
            
            
              E
              
                F
                (
                x
                )
              
            
            ⁡
            U
            
              
                |
              
            
            
              
                
                  x
                  →
                
              
            
            ,
            0
          
          ⟩
        
        =
        
          ⟨
          
            
              E
              
                F
                (
                x
                )
              
            
            ⁡
            U
            (
            
              |
            
            
              
                
                  x
                  →
                
              
            
            ,
            0
            ⟩
            )
            
              
                |
              
            
            U
            (
            
              |
            
            
              
                
                  x
                  →
                
              
            
            ,
            0
            ⟩
            )
          
          ⟩
        
        ≥
        1
        −
        ϵ
        .
      
    
    {\displaystyle \left\langle {\vec {x}},0{\big |}U^{*}\operatorname {E} _{F(x)}U{\big |}{\vec {x}},0\right\rangle =\left\langle \operatorname {E} _{F(x)}U(|{\vec {x}},0\rangle ){\big |}U(|{\vec {x}},0\rangle )\right\rangle \geq 1-\epsilon .}

Now

|
          
            Tr
            ⁡
            (
            S
            
              U
              
                ∗
              
            
            
              E
              
                F
                (
                x
                )
              
            
            ⁡
            U
            )
            −
            
              ⟨
              
                
                  
                    
                      x
                      →
                    
                  
                
                ,
                0
                
                  
                    |
                  
                
                
                  U
                  
                    ∗
                  
                
                
                  E
                  
                    F
                    (
                    x
                    )
                  
                
                ⁡
                U
                
                  
                    |
                  
                
                
                  
                    
                      x
                      →
                    
                  
                
                ,
                0
              
              ⟩
            
          
          |
        
        ≤
        Tr
        ⁡
        (
        
          
            |
          
        
        
          |
        
        
          
            
              x
              →
            
          
        
        ,
        0
        ⟩
        ⟨
        
          
            
              x
              →
            
          
        
        ,
        0
        
          |
        
        −
        S
        
          
            |
          
        
        )
        ‖
        
          U
          
            ∗
          
        
        
          E
          
            F
            (
            x
            )
          
        
        ⁡
        U
        ‖
        ≤
        δ
      
    
    {\displaystyle \left|\operatorname {Tr} (SU^{*}\operatorname {E} _{F(x)}U)-\left\langle {\vec {x}},0{\big |}U^{*}\operatorname {E} _{F(x)}U{\big |}{\vec {x}},0\right\rangle \right|\leq \operatorname {Tr} ({\big |}|{\vec {x}},0\rangle \langle {\vec {x}},0|-S{\big |})\|U^{*}\operatorname {E} _{F(x)}U\|\leq \delta }

so that

Tr
        ⁡
        (
        S
        
          U
          
            ∗
          
        
        
          E
          
            F
            (
            x
            )
          
        
        ⁡
        U
        )
        ≥
        1
        −
        ϵ
        −
        δ
        .
      
    
    {\displaystyle \operatorname {Tr} (SU^{*}\operatorname {E} _{F(x)}U)\geq 1-\epsilon -\delta .}

Theorem. If ε + δ < 1/2, then the probability distribution

Pr
        ⁡
        {
        y
        }
        =
        Tr
        ⁡
        (
        S
        
          U
          
            ∗
          
        
        
          E
          
            y
          
        
        ⁡
        U
        )
      
    
    {\displaystyle \operatorname {Pr} \{y\}=\operatorname {Tr} (SU^{*}\operatorname {E} _{y}U)}

on Y can be used to determine F(x) with an arbitrarily small probability of error by majority sampling, for a sufficiently large sample size. Specifically, take k independent samples from the probability distribution Pr on Y and choose a value on which more than half of the samples agree. The probability that the value F(x) is sampled more than k/2 times is at least

1
        −
        
          e
          
            −
            2
            
              γ
              
                2
              
            
            k
          
        
        ,
      
    
    {\displaystyle 1-e^{-2\gamma ^{2}k},}

where γ = 1/2 - ε - δ.
This follows by applying the <a href="/facts/Chernoff_bound/RLC6VlRU">Chernoff bound</a>.

<h2 id="accelerating-quantum-computing-simulations-with-fpgas">Accelerating Quantum Computing Simulations with FPGAs</h2>
With the advent of quantum computing, there has been a significant surge in both the number of developers and available tools.<a class="footnote-ref" id="fnref:6" href="#fn:6">6</a> However, the slow pace of technological advancement and the high maintenance costs associated with quantum computers have limited broader participation in this field. In response, developers have turned to simulators, such as IBM's <a href="/facts/Qiskit/ND9psKTQ">Qiskit</a>, to model quantum behavior without relying solely on real quantum hardware. Nevertheless, simulators, being classical computers, are constrained by computation speed. The fundamental advantage of quantum computers lies in their ability to process qubits, leveraging properties like entanglement and superposition simultaneously. By running quantum simulations on classical computers, the inherent parallelism of quantum computing is taken away. Moreover, as the number of simulated qubits increases, the simulation's speed decreases proportionally.
In a quantum circuit, the vectors are used to represent the state of the qubits and different matrices are used to represent the gate that is applied on the qubits. Since linear algebra is a major component of the quantum simulation, Field Programmable Gate Arrays (<a href="/facts/FPGAs/M8LSGcAU">FPGAs</a>) could be used to accelerate the simulation of quantum computing. FPGA is a kind of hardware that excels at executing operations in parallel, supports pipelining, has on-chip memory resources with low access latency, and offers the flexibility to reconfigure the hardware architecture on-the-fly which make it a well suited tool to handle matrix multiplication. 
The main idea of accelerating quantum computing simulations is to offload some of the heavy computation to special hardware like FPGA in order to speed up the whole simulation process. And the bigger quantum circuits (more qubits and more gates) we simulate, the more speedup we gain from offloading to FPGA compared with software simulations on CPU. The data flow of the simulation is explained below. First, the user inputs all the information of the quantum circuit including initial state and various gates through the user interface. Then, all this information is compressed and sent to the FPGA through some hardware communication protocols like AXI. Then, all the information is stored in the on-chip memory in the FPGA. And the simulation starts when the data is read from the memory and sent to the Matrix multiplication module. After all the calculation is done, the result will be sent back to the memory and to the CPU. 
Suppose we are simulating 5-qubit circuits, then we need to store the vector that holds 32 (2⁵) 16-bit values, each of which represents the square-root probability of a possible existing state. We also need to store the 32x32 matrix that represents the gate. In order to parallel this computation, we can store the 32 rows of the matrix separately and replicate 32 row_vec_mult hardware such that each row can calculate the multiplication in parallel. This will dramatically speed up the simulation with a price of more hardware and memory usage in FPGA. <a class="footnote-ref" id="fnref:7" href="#fn:7">7</a>
It has been discovered that with careful hardware design, it's possible to achieve a hardware architecture with O(n) time complexity, where 'n' denotes the number of qubits. In contrast, the runtime of Numpy approaches O(2^2^n). This finding underscores the feasibility of leveraging FPGAs to accelerate quantum computing simulations. <a class="footnote-ref" id="fnref:8" href="#fn:8">8</a>

<h2 id="see-also">See also</h2>

Wikimedia Commons has media related to Quantum circuit.

<ul><li><a href="/facts/Abstract_index_notation/GjuskCay">Abstract index notation</a></li>
<li><a href="/facts/Angular_momentum_diagrams_(quantum_mechanics)/aDHfF24K">Angular momentum diagrams (quantum mechanics)</a></li>
<li><a href="/facts/Circuit_complexity/6EzA9Tty">Circuit complexity</a> and <a href="/facts/BQP/whjD9eyf">BQP</a></li>
<li><a href="/facts/Matrix_product_state/amohgody">Matrix product state</a> uses <a href="/facts/Penrose_graphical_notation/VUA7KLpm">Penrose graphical notation</a></li>
<li><a href="/facts/Quantum_register/SKE6E55m">Quantum register</a></li>
<li><a href="/facts/Spin_network/EEE1kUfI">Spin networks</a></li>
<li><a href="/facts/Trace_diagram/y32UApwR">Trace diagram</a></li></ul>

<ul><li><a href="/facts/Eli_Biham/FvcYV6bd">Biham, Eli</a>; <a href="/facts/Gilles_Brassard/sBxLIE3P">Brassard, Gilles</a>; Kenigsberg, Dan; Mor, Tal (2004), "Quantum computing without entanglement", Theoretical Computer Science, 320 (1): 15–33, <a href="/facts/ArXiv_(identifier)/H6EtgnBe">arXiv</a>:<a href="https://arxiv.org/abs/quant-ph/0306182">quant-ph/0306182</a>, <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1016%2Fj.tcs.2004.03.041">10.1016/j.tcs.2004.03.041</a>, <a href="/facts/MR_(identifier)/uP137L11">MR</a> <a href="https://mathscinet.ams.org/mathscinet-getitem?mr=2060181">2060181</a>, <a href="/facts/S2CID_(identifier)/ldJsHa2Y">S2CID</a> <a href="https://api.semanticscholar.org/CorpusID:295103">295103</a>.</li>
<li><a href="/facts/Michael_Freedman/FxESCuA7">Freedman, Michael H.</a>; <a href="/facts/Alexei_Kitaev/yF6fPcey">Kitaev, Alexei</a>; <a href="/facts/Michael_J._Larsen/UqqdS6JE">Larsen, Michael J.</a>; Wang, Zhenghan (2003), "Topological quantum computation", Bulletin of the American Mathematical Society, 40 (1): 31–38, <a href="/facts/ArXiv_(identifier)/H6EtgnBe">arXiv</a>:<a href="https://arxiv.org/abs/quant-ph/0101025">quant-ph/0101025</a>, <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1090%2FS0273-0979-02-00964-3">10.1090/S0273-0979-02-00964-3</a>, <a href="/facts/MR_(identifier)/uP137L11">MR</a> <a href="https://mathscinet.ams.org/mathscinet-getitem?mr=1943131">1943131</a>.</li>
<li>Hirvensalo, Mika (2001), Quantum Computing, Natural Computing Series, Berlin: Springer-Verlag, <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 3-540-66783-0, <a href="/facts/MR_(identifier)/uP137L11">MR</a> <a href="https://mathscinet.ams.org/mathscinet-getitem?mr=1931238">1931238</a>.</li>
<li><a href="/facts/Alexei_Kitaev/yF6fPcey">Kitaev, A. Yu.</a> (1997), "Quantum computations: algorithms and error correction", Uspekhi Mat. Nauk (in Russian), 52 (6(318)): 53–112, <a href="/facts/Bibcode_(identifier)/9HtdQSGB">Bibcode</a>:<a href="https://ui.adsabs.harvard.edu/abs/1997RuMaS..52.1191K">1997RuMaS..52.1191K</a>, <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1070%2FRM1997v052n06ABEH002155">10.1070/RM1997v052n06ABEH002155</a>, <a href="/facts/MR_(identifier)/uP137L11">MR</a> <a href="https://mathscinet.ams.org/mathscinet-getitem?mr=1611329">1611329</a>, <a href="/facts/S2CID_(identifier)/ldJsHa2Y">S2CID</a> <a href="https://api.semanticscholar.org/CorpusID:250816585">250816585</a>.</li>
<li><a href="/facts/Michael_Nielsen/hedbpYkS">Nielsen, Michael A.</a>; Chuang, Isaac L. (2000), Quantum Computation and Quantum Information, Cambridge: Cambridge University Press, <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 0-521-63235-8, <a href="/facts/MR_(identifier)/uP137L11">MR</a> <a href="https://mathscinet.ams.org/mathscinet-getitem?mr=1796805">1796805</a>.</li></ul>
<h2 id="external-links">External links</h2>
<ul><li><a href="https://cquic.unm.edu/resources/">Q-circuit</a> <a href="https://web.archive.org/web/20190323101451/https://cquic.unm.edu/resources/">Archived</a> 2019-03-23 at the <a href="/facts/Wayback_Machine/nmQ3a6JC">Wayback Machine</a> is a macro package for drawing quantum circuit diagrams in LaTeX.</li>
<li><a href="https://qcsimulator.github.io/">Quantum Circuit Simulator (Davy Wybiral)</a> (<a href="https://github.com/qcsimulator/qcsimulator.github.io">qcsimulator.github.io</a> on <a href="/facts/GitHub/n1hNCsc3">GitHub</a>) a browser-based quantum circuit diagram editor and simulator.</li>
<li><a href="https://www.quantumplayground.net/">Quantum Computing Playground</a> (<a href="https://github.com/gwroblew/Quantum-Computing-Playground">Quantum-Computing-Playground</a> on <a href="/facts/GitHub/n1hNCsc3">GitHub</a>) a browser-based quantum scripting environment.</li>
<li><a href="https://algassert.com/quirk">Quirk - Quantum Circuit Toy</a> (<a href="https://github.com/Strilanc/Quirk">Quirk</a> on <a href="/facts/GitHub/n1hNCsc3">GitHub</a>) a browser-based quantum circuit diagram editor and simulator.</li></ul>

<h2 id="references">References</h2>

<ol>
<li id="fn:1">Colin P. Williams (2011). Explorations in Quantum Computing. Springer. pp. 123–200. ISBN 978-1-84628-887-6. <a href="978-1-84628-887-6" target="_blank">978-1-84628-887-6</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></li>
<li id="fn:2">Nielsen, Michael A.; Chuang, Isaac (2010). Quantum Computation and Quantum Information. Cambridge: Cambridge University Press. pp. 171–215. ISBN 978-1-10700-217-3. OCLC 43641333. <a href="978-1-10700-217-3" target="_blank">978-1-10700-217-3</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></li>
<li id="fn:3">Ömer, Bernhard (2000-01-20). Quantum Programming in QCL (PDF) (Thesis). Institute for Theoretical Physics, Vienna University of Technology. pp. 37–38. Retrieved 2021-10-12. <a href="http://tph.tuwien.ac.at/~oemer/doc/quprog.pdf" target="_blank">http://tph.tuwien.ac.at/~oemer/doc/quprog.pdf</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></li>
<li id="fn:4">Feynman, Richard P. (1986). "Quantum mechanical computers". Foundations of Physics. 16 (6). Springer Science and Business Media LLC: 507–531. Bibcode:1986FoPh...16..507F. doi:10.1007/bf01886518. ISSN 0015-9018. S2CID 122076550. <a href="/wiki/Bibcode_(identifier)" target="_blank">/wiki/Bibcode_(identifier)</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></li>
<li id="fn:5">"Introduction to the Quantum Circuit Model" (PDF). <a href="https://www.cs.cmu.edu/~odonnell/quantum15/QuantumComputationScribeNotesByRyanODonnellAndJohnWright.pdf" target="_blank">https://www.cs.cmu.edu/~odonnell/quantum15/QuantumComputationScribeNotesByRyanODonnellAndJohnWright.pdf</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></li>
<li id="fn:6">"Accelerating Quantum Simulations w/ FPGAs". 19 August 2020. <a href="https://medium.com/@josephmeng96/accelerating-quantum-simulations-w-fpgas-84b09569ad0f" target="_blank">https://medium.com/@josephmeng96/accelerating-quantum-simulations-w-fpgas-84b09569ad0f</a> <a href="#fnref:6" class="footnote-back-ref">↩</a></li>
<li id="fn:7">"Accelerating Quantum Simulations w/ FPGAs". 19 August 2020. <a href="https://medium.com/@josephmeng96/accelerating-quantum-simulations-w-fpgas-84b09569ad0f" target="_blank">https://medium.com/@josephmeng96/accelerating-quantum-simulations-w-fpgas-84b09569ad0f</a> <a href="#fnref:7" class="footnote-back-ref">↩</a></li>
<li id="fn:8">"Accelerating Quantum Simulations w/ FPGAs". 19 August 2020. <a href="https://medium.com/@josephmeng96/accelerating-quantum-simulations-w-fpgas-84b09569ad0f" target="_blank">https://medium.com/@josephmeng96/accelerating-quantum-simulations-w-fpgas-84b09569ad0f</a> <a href="#fnref:8" class="footnote-back-ref">↩</a></li>
</ol>

Quantum circuit open-in-new

Quantum circuit