Questions tagged [gate-synthesis]
For questions about finding (short) gate sequences to implement a specific unitary operation, for example decomposing a complicated multi-qubit gate into a sequence of basic gates. It might apply to optimizing circuits with respect to length or depth or finding gate sequences to implement an algorithm.
2
votes
1answer
60 views
If CNOTs and single qubit gates are universal then why do we need to prove that controlled U operations can be composed by them as well?
In the book by Chuang and Nielsen they prove that controlled U operations can be made out of CNOTs and single qubit gates. But then they go on to prove that they are universal by showing that every n ...
2
votes
1answer
83 views
Decompose a general two-qubit gate into general controlled-qubit gates
We often seek to decompose multi-qubit unitaries into single-qubit rotations and controlled-rotations, minimising the latter or restricting to gates like CNOTs.
I'm interested in expressing a general ...
2
votes
1answer
51 views
How to implement a $\frac{\theta}{2}$ rotation from $\theta$ rotation?
Is there a way to create a rotation gate which has half the angle of some implementable gate?
I am looking to implement a gate on Quirk which allows for standard time-dependent rotations
$$R_x(\...
3
votes
0answers
24 views
Decomposition of any 2-level matrix into single qubit and CNOT gates
I saw an example which takes a 2 level matrix. Which is a $8\times8$ matrix that acts non trivially only on 2 levels of only states $|000\rangle$ and $|111\rangle$. The way they do it is by using a ...
3
votes
2answers
165 views
Composing the CNOT gate as a tensor product of two level matrices
I don't understand, why is the control not gate used so often. As far as I understand it, if you apply two 2 level operations on two qubits then you get a 4 x 4 matrix by the tensor product. So how ...
2
votes
1answer
60 views
Proof that $2^n \times 2^n$ operator be decomposed in terms of $2 \times 2$ operators
What is the proof that any $2^n\times 2^n$ quantum operator can be expressed in terms of the tensor product of $n$ number of $2\times 2$ quantum operators acting on a single qubit space each?
6
votes
3answers
392 views
Is there any method of adding two operators in a circuit?
I am trying to reconstruct the time evolution of a Hamiltonian on the quantum computing simulator, quirk. Ideally I would like to generalise this to any simulator. The unitary matrix is
$$U(t)=e^{-...
4
votes
3answers
66 views
Hadamard gate as a product of $R_x$, $R_z$ and a phase
I am having problems with this task.
Since the Hadamard gate rotates a state $180°$ about the $\hat{n} = \frac{\hat{x} + \hat{z}}{\sqrt{2}}$ axis, I imagine the solution can be found the following ...
1
vote
1answer
45 views
Creating a time dependent custom gate in Quirk
I have created a $16\times 16$ unitary operator using a Hamiltonian by finding its exponential
$$U=\exp(-iH\delta t)$$
If I set $\delta t=1$ then I can take this matrix and input it into quirk using ...
1
vote
1answer
36 views
Gate sequence for exponential of product of Pauli Z operators
I want to compile $$\exp(-i \theta \sigma_i^z \sigma_j^z)$$ down to a gate sequence of single qubit rotations and CNOTs. How do I do this? What is the general procedure for compiling a unitary $U$ to ...
10
votes
3answers
368 views
Approximating unitary matrices
I currently have 2 unitary matrices that I want to approximate to a good precision with the fewer quantum gates possible.
In my case the two matrices are:
$$G = \frac{-1}{\sqrt{2}}\begin{pmatrix} i &...
5
votes
4answers
163 views
How do I build a gate from a matrix on Qiskit?
I'm creating a gate for a project and need to test if it has the same results as the original circuit in a simulator, how do I build this gate on Qiskit? It's a 3 qubit gate, 8x8 matrix:
$$
\frac{1}{...
4
votes
1answer
106 views
Construction of ${R_n(\theta)}$ using only the Hadamard and ${\pi/8}$ gates
In the "Quantum Computation and Quantum Information 10th Anniversary textbook by Nielsen & Chuang", they claim that Eqn(4.75) is a rotation about the axis along the direction
( ${cos(\pi/8)}$, ${...
3
votes
2answers
98 views
Implementing gate with two parameters using Qiskit in Python
I am trying to implement the HHL algorithm (for solving $Ax=b$). I am assuming $A$ to be unitary and Hermitian so that I can find the Hamiltonian simulation for it easily.
For any $A$ to be Hermitian ...
5
votes
2answers
131 views
How to obtain Y rotation with only X and Z rotations gates?
Let's say you have a system with which you can perform arbitrary rotations around the X and Z axis. How would you then be able to use these rotations to obtain an arbitrary rotation around the Y axis?
...
4
votes
2answers
97 views
Measuring the Hamiltonian in the VQE
I am trying to implement VQE in pyQuil and am dumbfounded by how to measure the expectation value of a general Hamiltonian on $\mathbb{C}^{2^n}$ i.e. determine $\langle\psi , H \psi\rangle$ on a ...
5
votes
2answers
80 views
Clarification needed: “Simulation” of $e^{-iHt}$ and its time complexity
On page 3 here it is mentioned that:
However, building on prior works [32, 36, 38] recently it has been
shown in [39] that to simulate $e^{−iHt}$ for an $s$-sparse Hamiltonian
requires only $\...
3
votes
0answers
58 views
Circuit to construct a $n$-qubit state which is a superposition of states with only a single qubit being $\lvert1\rangle$ [duplicate]
So the question came up in a book I am working through. Given a circuit with $n$ qubits, construct a state with only $n$ possible measurement results, each of which has only $1$ of $n$ qubits as $1$, ...
2
votes
1answer
112 views
How to construct a quantum gate producing 1 if r divides x, 0 otherwise?
If you have two registers in the state $\frac{1}{2^{n/2}} \sum_{x = 0}^{2^{n/2} - 1} |x\rangle |0\rangle$, how could you construct a gate that produces a superposition of states $|x\rangle|1\rangle$ ...
1
vote
2answers
48 views
How does the stated Pauli decomposition for $\operatorname{CP\cdot A\cdot CP}$ arise?
I'm having a bit of trouble understand @DaftWullie's answer here.
I understood that the $4\times 4$ matrix $A$
$$ \frac{1}{4} \left[\begin{matrix}
15 & 9 & 5 & -3 \\
9 & 15 & 3 &...
5
votes
2answers
153 views
Simulation vs Construction of Fredkin gate with Toffoli gates
I'm working my way through the book "Quantum computation and quantum information" by Nielsen and Chuang. (EDIT: the 10th anniversary edition).
On chapter 3 (talking about reversibility of the ...
6
votes
2answers
129 views
Is there a general method to implement a 'greater than' quantum circuit?
I am interesting in finding a circuit to implement the operation $f(x) > y$ for an arbitrary value of $y$. Below is the circuit I would like to build:
I use the first three qubits to encode $|x⟩$, ...
2
votes
1answer
68 views
What quantum gate is XNOR equivalent to?
The standard way to implement a reversible XOR gate is by means of a controlled-NOT gate or CNOT; this is the "standard quantum XOR operation". Physics.Stackexchange
Is there a "standard quantum XNOR ...
5
votes
1answer
76 views
How can I decompose a gate into $\{\mathrm{CNOT}, \mathrm{H}, \mathrm{P}(\theta)\}$?
I am working with the set $\{\mathrm{CNOT}, \mathrm{H}, \mathrm{P}(\theta)\}$
where $\mathrm{H}$ is the Hadamard gate, and $\mathrm{P}(\theta)$ is the phase gate with angle $\theta$.
I want to build ...
10
votes
3answers
254 views
How to derive the CNOT matrix for a 3-qbit system where the control & target qbits are not adjacent?
In a three-qbit system, it's easy to derive the CNOT operator when the control & target qbits are adjacent in significance - you just tensor the 2-bit CNOT operator with the identity matrix in the ...
5
votes
1answer
179 views
Decomposition of an arbitrary 1-qubit gate into a specific gateset
Any 1-qubit special gate can be decomposed into a sequence of rotation gates ($R_z$, $R_y$ and $R_z$). This allows us to have the general 1-qubit special gate in matrix form:
$$
U\left(\theta,\phi,\...
7
votes
1answer
219 views
Decomposition of arbitrary 2 qubit operator
As you know, universal quantum computing is the ability to construct a circuit from a finite set of operations that can approximate to arbitrary accuracy any unitary operation.
There also exist some ...
14
votes
0answers
221 views
Explicit Conversion Between Universal Gate Sets
I'm interested in the conversion between different sets of universal gates. For example, it is known that each of the following sets is universal for quantum computation:
$\{T,H,\textrm{cNOT}\}$
$\{H,...
10
votes
2answers
303 views
Automatic compilation of quantum circuits
A recent question here asked how to compile the 4-qubit gate CCCZ (controlled-controlled-controlled-Z) into simple 1-qubit and 2-qubit gates, and the only answer given so far requires 63 gates!
The ...
9
votes
6answers
913 views
How to construct a multi-qubit controlled-Z from elementary gates?
For the implementation of a certain quantum algorithm, I need to construct a multi-qubit (in this case, a three-qubit) controlled-Z gate from a set of elementary gates, as shown in the figure below.
....
7
votes
2answers
141 views
Minimum number of CNOTs for Toffoli with non-adjacent controls
I want to decompose a Toffoli gate into CNOTs and arbitrary single-qubit gates. I want to minimize the number of CNOTs. I have a locality constraint: because the Toffoli is occurring in a linear array,...
6
votes
2answers
555 views
How do you implement the Toffoli gate using only single-qubit and CNOT gates?
I've been reading through "Quantum Computing: A Gentle Introduction", and I've been struggling with this particular problem. How would you create the circuit diagram, and what kind of reasoning would ...
4
votes
2answers
170 views
How do we code the matrix for a controlled operation knowing the control qubit, the target qubit and the $2\times 2$ unitary?
Having n qubits, I want to have the unitary described a controlled operation.
Say for example you get as input a unitary, an index for a controlled qubit and another for a target.
How would you code ...
6
votes
0answers
113 views
Number of gates required to approximate arbitrary unitaries
If I understand correctly, there must exist unitary operations that can be approximated to a distance $\epsilon$ only by an exponential number of quantum gates and no less.
However, by the Solovay-...
5
votes
1answer
87 views
Arbitrary powers of NOT and SWAP
The square-root of not and square-root of swap gates are often singled out for discussion of gates displaying important properties relating to quantum computers.
How do I define arbitrary (non-...
7
votes
2answers
169 views
Is it possible to realize CNOT gate in 3 dimension?
CNOT gates have been realized for states living in 2-dimensional spaces (qubits).
What about higher-dimensional (qudit) states? Can CNOT gates be defined in such case? In particular, is this possible ...
3
votes
1answer
97 views
Doing maths with controlled-half NOTs
In Quantum Computation with the simplest maths possible there is a section titled "Doing maths with a controlled-half NOT" which covers a reversible-(N)AND circuit with controlled-half NOTs.
What ...
6
votes
1answer
160 views
Basic approximation in Solovay-Kitaev algorithm
I read the Solovay-Kitaev algorithm for approximation of arbitrary single-qubit unitaries. However, while implementing the algorithm, I got stuck with the basic approximation of depth 0 of the ...
4
votes
1answer
123 views
Square root of NOT as a time-dependent unitary matrix
I want to express the square root of NOT as a time-dependent unitary matrix such that each $n$ units of time, the square root of NOT is produced.
More precisely, I want to find a $U(t_0,t_1)$ such ...
8
votes
1answer
290 views
How to implement a matrix exponential in a quantum circuit?
Maybe it is a naive question, but I cannot figure out how to actually exponentiate a matrix in a quantum circuit.
Assuming to have a generic square matrix A, if I want to obtain its exponential, $e^{A}...
3
votes
2answers
192 views
Components for realizing a photonic CNOT gate
In Realization of a photonic CNOT gate sufficient for quantum computation FIG. 1 there is a "scheme to obtain a photonic realization of a CNOT gate with two independent qubits."
What components are ...
6
votes
2answers
106 views
Construct Controlled-$G^{\dagger}$ from known Controlled-$G$
Let there be a known a scheme (quantum circuit) of Controlled-G, where unitary gate G has G$^†$ such that G≠G$^†$ and GG$^†$=I (for example S and S$^†$, T and T$^†$, V and V$^†$, but not Pauli and H ...
6
votes
2answers
497 views
Expressing “Square root of Swap” gate in terms of CNOT
How could a $\sqrt{SWAP}$ circuit be expressed in terms of CNOT gates & single qubit rotations?
CNOT & $\sqrt{SWAP}$ Gates
Any quantum circuit can be simulated to an arbitrary degree of ...
10
votes
1answer
620 views
Implementing a CCCNOT gate using only Toffoli gates
A CCCNOT gate is a four-bit reversible gate that flips its fourth bit if and only if the first three bits are all in the state $1$.
How would I implement a CCCNOT gate using Toffoli gates? Assume ...
6
votes
1answer
228 views
Quantum XOR Linked List Construction
After getting help here with XNOR & RCA gates I decided to dive into XOR Swaps & XOR linked lists. I was able to find this explanation for quantum XOR Swapping which seems sufficient for the ...
6
votes
1answer
157 views
Quantum Ripple Carry Adder Construction
There is an excellent answer to How do I add 1+1 using a quantum computer? that shows constructions of the half and full adders. In the answer, there is a source for the QRCA. I have also looked at ...
10
votes
2answers
252 views
Quantum XNOR Gate Construction
Tried asking here first, since a similar question had been asked on that site. Seems more relevant for this site however.
It is my current understanding that a quantum XOR gate is the CNOT gate. Is ...
9
votes
3answers
557 views
How to implement the “Square root of Swap gate” on the IBM Q (composer)?
I would like to simulate a quantum algorithm where one of the steps is "Square root of Swap gate" between 2 qubits.
How can I implement this step using the IBM composer?
9
votes
2answers
551 views
Implementation of the oracle of Grover's algorithm on IBM Q using three qubits
I am trying to get used to IBM Q by implementing three qubits Grover's algorithm but having difficulty to implement the oracle.
Could you show how to do that or suggest some good resources to get ...
8
votes
2answers
151 views
Why is the decomposition of a qubit-qutrit Hamiltonian in terms of Pauli and Gell-Mann matrices not unique?
If I have the $X$ gate acting on a qubit and the $\lambda_6$ gate acting on a qutrit, where $\lambda_6$ is a Gell-Mann matrix, the system is subjected to the Hamiltonian:
$\lambda_6X=
\begin{pmatrix}...
