Quantum Computing Stack Exchange
Quantum Computing Stack Exchange

Questions tagged [compiling]

For questions about compiling problems on quantum hardware. For annealing devices, this can include minor-embedding, quadratization, and other types of gadgetization; while for circuit-based devices this can include anything necessary to get a circuit running on a particular hardware.

36 questions
11
votes
2 answers

Transpilation into custom gate set in qiskit

In qiskit, I can transpile a given circuit into a some predefined gate set as follows (just an example) from qiskit import QuantumCircuit from qiskit.compiler import transpile from qiskit.circuit.random import random_circuit basis_gates = ['id',…
Nikita Nemkov
  • 1,725
  • 6
  • 22
8
votes
1 answer

Is the Solovay-Kitaev theorem relevant for modern hardware?

The Solovay-Kitaev theorem (and more recent improvements) explains how to efficiently compile any 2-qubit unitary into any universal (dense) finite set of gates. My question is if this theorem is relevant for modern hardware? Take, for example,…
Nikita Nemkov
  • 1,725
  • 6
  • 22
7
votes
2 answers

How are quantum circuits run on real quantum computers?

Sorry if this question sounds trivial, however I'm struggling to get the intuition of how quantum circuits are actually run on real quantum hardware. As far as I know, in a simulated environment, circuits are transpiled, compiled and assembled so…
mpro
  • 527
  • 2
  • 12
7
votes
1 answer

Would IBM's "compiler" turn my identity circuit into nothing?

If I were to create a circuit with the following gate: $$\tag{1}R_\phi = \begin{bmatrix} 1 & 0 \\ 0 & e^{i \phi} \end{bmatrix},$$ with $\phi$ specified to be equal to 0, then the gate that I am running is just the identity gate, and the circuit is…
user1271772 No more free time
  • 14,286
  • 2
  • 26
  • 76
6
votes
0 answers

Can we obfuscate the identity?

Motivated by Aaronson's call to find simple, verifiable proofs of quantumness, suppose we start off with a random polynomial-length circuit $U$ of, say, Hadamard+CCNOT (Toffoli) or CSWAP (Fredkin) gates, and attach $U^\dagger$ to it, can we then use…
Mark Spinelli
  • 15,378
  • 3
  • 26
  • 83
6
votes
1 answer

How is randomized compiling actually helpful: experimentally, a gate is not "perfect" followed by some noise acting "after"

I am currently learning randomized compiling with this paper which seems to be the "main" reference on this topic (at least many papers refer to this one). However, I do not understand how this technique can help "in practice": from my understanding…
Marco Fellous-Asiani
  • 2,220
  • 2
  • 15
  • 42
6
votes
4 answers

Software tools to train quantum circuits with parameters

I want to play with the following problem. Given a unitary $U$ with parameters $\theta$ I want to optimize these parameters to make $U$ match some target unitary $V$, i.e. to find $\operatorname{argmin}_{\theta}||U(\theta)-V||$. This is in spirit of…
Nikita Nemkov
  • 1,725
  • 6
  • 22
5
votes
2 answers

How to get IonQ Task's Native Instructions/Decomposition (Amazon Braket)

When you run something on one of IBM's free computers, you can look up what it actually ran; i.e. it gives you the decomposition of the circuit you told it to run. When running on IonQ with Amazon's braket I can't find that. I can call up the task…
Ken Robbins
  • 474
  • 2
  • 8
5
votes
1 answer

Two qubit gate decomposition using Qiskit

I am writing some python code to be able to optimise the total error in two qubit gate decomposition. I am using the Qiskit module qiskit.quantum_info.synthesis.two_qubit_decompose My question relates to the difference between the two classes given…
mikeshubrook
  • 151
  • 3
4
votes
1 answer

Computing the Bloch sphere representation of an arbitrary operator in $U(2)$

Computing the Matsumoto-Amano normal form of an operator in $U(2)$ involves finding the Bloch sphere representation of said operator, see Remarks on Matsumoto and Amano’s normal form for single-qubit Clifford+T operators, Theorem 4.1. I've been…
Ntwali B.
  • 453
  • 2
  • 9
4
votes
1 answer

Is there a way to decompose a quantum circuit into a Clifford subcircuit and a non-Clifford subcircuit?

Is there any way of decomposing a arbitrary quantum circuit into two sub circuits, first of them being composed only of Clifford gates and the second one only of non-Clifford gates? Thank you!
q_man
  • 136
  • 5
4
votes
3 answers

What are the available compilers for Trapped-Ion Quantum Computing Architecture?

I am looking for a compiler to compile a high-level quantum circuit for the Trapped-Ion Quantum Computing architecture, i.e. a compiler that can translate a high-level circuit to native gates of the TI hardware (single-qubit rotations and 2-qubit MS…
Edifice
  • 429
  • 2
  • 10
3
votes
1 answer

Is Controlled$(R_z(\theta))$ more expensive than Controlled$(Z^t)$ on the surface code?

There are (at least) two conventions for single-qubit, arbitrary-angle Z rotations in quantum computing, which I will call Rz(theta) and Z^t. $$ R_Z(\theta) = \exp(-i \theta Z/2) = \mathrm{diag}(e^{-i \theta/2}, e^{i \theta/2}) \\ Z^t =…
Matt Harrigan
  • 33
  • 4
3
votes
2 answers

Is it possible to approximately compile Toffoli using H and CSWAP?

Question: Given all controlled-SWAP (CSWAP) and Hadamard (H) gates on 3 qubits, is it possible to approximately compile the Toffoli (CCX) gate? Discussion From basic simulations, it appears that all $\text{CSWAP}$s and $H$s on 3 qubits generate an…
Jonas Anderson
  • 671
  • 3
  • 8
3
votes
1 answer

How do I compile a circuit to the native gateset of Quantinuum's trapped-ion devices?

Suppose I have a quantum circuit defined in pytket, qiskit or some other quantum SDK. How do I compile my circuit to be in the native gateset of the Quantinuum trapped ion device/emulators?
Callum
  • 1,260
  • 1
  • 5
  • 24
1
2 3