1887
banner image
No data available.
Please log in to see this content.
You have no subscription access to this content.
No metrics data to plot.
The attempt to load metrics for this article has failed.
The attempt to plot a graph for these metrics has failed.
Universal programmable quantum circuit schemes to emulate an operator
Rent:
Rent this article for
USD
10.1063/1.4772185
/content/aip/journal/jcp/137/23/10.1063/1.4772185
http://aip.metastore.ingenta.com/content/aip/journal/jcp/137/23/10.1063/1.4772185

Figures

Image of FIG. 1.
FIG. 1.

The number of qubits on the ancilla determines the number of V i s and hence the size of V in Eq. (2).

Image of FIG. 2.
FIG. 2.

Block circuit diagram to simulate U by modifying the input |0⟩|ψ⟩ to and constructing V in two steps: the formation of the elements of U in V and bringing the same row elements in U to the first rows of V i s in V, combination. The necessary gates to form V and to also transform |0⟩|ψ⟩ to will generate the circuit.

Image of FIG. 3.
FIG. 3.

The first circuit design for a given general matrix: the initial Hadamards and the SWAPs are to modify the input, and the last Hadamards carry the elements to the first rows of V i s (combination step). The uniformly controlled quantum gates in the middle form all elements of U on the diagonal of V (formation step).

Image of FIG. 4.
FIG. 4.

The second circuit with 4 × 4 initial blocks: The differently controlled quantum gates in the networks, after the V i blocks, combine small blocks and build the N × N blocks at the end. The initial Hadamards are for the modification of the input. The V i blocks are for the formation step.

Image of FIG. 5.
FIG. 5.

(a) A gray-coded multi-control network. (b) The decomposition of the gray-coded network in (a) into CNOT and single quantum gates.

Image of FIG. 6.
FIG. 6.

The circuit in (a) with 4 × 4 initial blocks can be represented as in (b) by using the circuit given in Fig. (7). Without changing the order of the gates having the same control state, the gates can be moved to form uniformly controlled networks as in (c): If a gate has the same angle value for all control states such as the control X gates in the circuit, they are equal to a single gate (in the case of X gates in the circuit, only one CNOT is required).

Image of FIG. 7.
FIG. 7.

Quantum circuit which is found by following the Schmidt decomposition and can generate any vector of dimension 4 as the first row of its matrix representation.

Image of FIG. 8.
FIG. 8.

The circuit for the simulation of the hydrogen molecule. The angle values for the rotation gates are determined to create the elements of : There are only 19 rotation gates, the rest are X gates in order to get the right order for the elements after the combination. For diagonal elements of , these rotations are only around z-axis. For nonzero-diagonal elements, rotation about z-axis followed by rotations about y-axis. The angles for these gates are given in Table I.

Tables

Generic image for table
Table I.

Parameters for the rotation gates.

Loading

Article metrics loading...

/content/aip/journal/jcp/137/23/10.1063/1.4772185
2012-12-21
2014-04-23
Loading

Full text loading...

This is a required field
Please enter a valid email address
752b84549af89a08dbdd7fdb8b9568b5 journal.articlezxybnytfddd
Scitation: Universal programmable quantum circuit schemes to emulate an operator
http://aip.metastore.ingenta.com/content/aip/journal/jcp/137/23/10.1063/1.4772185
10.1063/1.4772185
SEARCH_EXPAND_ITEM