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.

13 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
6
votes
0answers
64 views

Reducing the depth of quantum circuits with ancilla qubits

This question is two-fold and considers general $n$-qubit operations on a quantum computer. First, can a general $n$-qubit operation be implemented on a quantum computer without the use of ancilla ...
5
votes
0answers
41 views

Equivalence checking of quantum circuits up to error

Suppose you are given two circuit descriptions $A$ and $B$ where by a circuit description I mean a sequence of gates (in the order they are applied) and the qubits they are applied on. (For the sake ...
4
votes
0answers
67 views

Universality for reversible classical computation

Is there any way to check whether a set of gates (for example, take the set comprising of the CNOT gate and the Hadamard gate) is universal for reversible classical computation? I can think of trial ...
3
votes
0answers
71 views

How exactly does the QuantumCircuit.decompose() method work?

From what I can understand from the source code, the circuit is converted into a DAG before the decomposition transpiler is performed onto the DAG circuit. How does converting to a DAG circuit help us ...
3
votes
0answers
47 views

Reducing an ansatz to a shallower circuit

Given a very general hardware efficient ansatz as in Figure: and say that you already know all the rotation parameter for the gates in the red box, is there any way to build a gate sequence that ...
3
votes
0answers
49 views

Cost of controlled-$U_i$

What is the cost (number of gates) of $\sum_{i=0}^{N-1}| i \rangle \langle i|\otimes U_i$ in terms of $N$ and the costs of the unitaries $U_i$? Say the gate set consists of arbitrary one-qubit gates ...
2
votes
0answers
57 views

Representation of multiple qubit matrices in Dirac notation

Imagine one wants to represent the and function for any number of qubits in Dirac notation. The and gate flips the target qubit if all the control qubits are in state 1. This is its matrix ...
2
votes
0answers
166 views

Decompose Toffoli gate with minimum cost for IBM quantum computer

The known decomposition of toffoli gate that can be used on IBM quantum computer is : I want to know any other Toffoli gate decompositions that can be used on IBM quantum computer and have a cost ...
1
vote
0answers
48 views

How can I prove the universality of this set of gates?

I was reading this article. A brief explanation: Here we have a circuit, the registers are a stepfunction state, an single photon state and a function state. The first two have position operators $X$ ...
1
vote
0answers
730 views

How to implement controlled u3 gate from Qiskit using simpler gates?

I am trying to implement the u3 controlled gate (able to rotate the qubit in any specified direction in 3 dimensions if the control is 1, for two qubits) using simpler gates. The simpler gates ...
1
vote
0answers
66 views

Controlled controlled adder gates involved

Let's say I have a circuit that given in the figure As we can see that this circuit consists of $2$-Toffoli gates and $4$ C-NOT gates, and to construct this entire circuit using only single qubit ...
1
vote
0answers
249 views

Transferring classical OR gate in a quantum gate

I would be interested to know how to transform the classic OR gate into a quantum gate. I thought a little about myself. The OR gate can also be rewritten as a NAND gate: So, I have now tried to ...
0
votes
0answers
19 views

Compiling Quantum Circuits using the Palindrome Transform

This paper shows a way to produce optimal circuits. I haver verified most of them and they are correct except this procedure: procedure ProduceArray(n) I cannot ...