12
votes
Accepted
Is the Solovay-Kitaev theorem relevant for modern hardware?
I think you'll find that most hardware, at the hardware level, gives you arbitrary single qubit rotations. So, in that sense, it is true that Solovay-Kitaev is not directly applicable to current ...
- 61.8k
12
votes
Transpilation into custom gate set in qiskit
The Qiskit standard gate list
You can find the full list of Qiskit standard gates in the module qiskit.circuit.library.standard_gates (documentation).
The matrix ...
- 5,969
9
votes
Would IBM's "compiler" turn my identity circuit into nothing?
Any compilation/circuit optimization happens transparently by Qiskit. As a user you have control over what happens via the optimization_level argument passed to <...
- 1,632
6
votes
Software tools to train quantum circuits with parameters
So this answer depends a bit on the size of the unitary, but if you're building a compiler chances are that they are only a few qubits large.
A simple approach would just be to define a function that ...
- 2,973
6
votes
Accepted
How are quantum circuits run on real quantum computers?
I like to think of many quantum gates as essentially opcodes that instruct a (classical) controller how to tune and send the microwave or laser pulses to the qubits.
Many simple quantum circuits, then,...
- 14.4k
5
votes
How are quantum circuits run on real quantum computers?
A quantum circuit is just a model for representing computations and evolution of a closed quantum system with time.
For running a quantum circuit on a real quantum device, we first need to transpile ...
- 1,809
5
votes
Is there a way to decompose a quantum circuit into a Clifford subcircuit and a non-Clifford subcircuit?
You can make it even stronger than that. Any circuit can be approximated using the Clifford+T gate set. Then you can replace every T gate with gate teleportation through a T state. So any circuit can ...
- 42.1k
3
votes
Accepted
How could compiler optimisations be used with fault-tolerant quantum circuits?
The compilation is, indeed, currently one of the best ways to increase the fidelity of a run. Also under the assumpution of fault-tolerant computation, compilation would eventually reduce the depth of ...
- 2,058
3
votes
Complexity of translation between Measurement Based and Circuit Based with Error Correction
Accourding to Browne et al. it seems the translation from GBQC to MBQC is of size O(N^3) and from MBQC to GBQC the translation is of size ...
3
votes
Accepted
Computing the Bloch sphere representation of an arbitrary operator in $U(2)$
Looking at the right hand side Eq (12) of the linked paper, you should not assume that
$$
U Y U^\dagger = nP\,, \, P \in \{ X, Y, Z \} \,.
$$
Such an equality should hold true only when the second ...
3
votes
Accepted
How do I compile a circuit to the native gateset of Quantinuum's trapped-ion devices?
You can do this with the pytket-quantinuum extension. This is installed as a separate python package.
I'll show an example. First I'll build a quantum circuit and then compile it to the native gateset....
- 1,225
3
votes
Accepted
What are the available compilers for Trapped-Ion Quantum Computing Architecture?
You can compile gates to native trapped ion gates via cirq.ion.ConvertToIonGates. For example:
...
- 1,993
3
votes
Accepted
Is it possible to approximately compile Toffoli using H and CSWAP?
TL;DR: Nope. The triple tensor product of the $+1$ eigenstate of the Hadamard gate is a $+1$ eigenstate of every product of the controlled-SWAP gate and the Hadamard. This is not the case for Toffoli, ...
- 24.9k
3
votes
Accepted
Is Controlled$(R_z(\theta))$ more expensive than Controlled$(Z^t)$ on the surface code?
TL;DR: We need at least two arbitrary-angle rotations to implement $CR_z(\theta):=\mathrm{diag}(1,1,e^{-i\theta/2},e^{i\theta/2})$ using unitary gates and auxiliary qubits. This follows from the ...
- 24.9k
2
votes
High level implementation of quantum oracles
HODL (Higher-Level Oracle Description Language) is a tool that makes it easy to write classical oracles using a C-style syntax. It compiles to OpenQASM 2.0, and more recently, Quantum Intermediate ...
- 171
2
votes
Accepted
Rigetti "Timeout on client tcp://127.0.0.1:5555, method name quil_to_native_quil" error
It seems indeed related with the size of circuit. If I interpret qiskit_rigetti.RigettiQCSProvider documentation correctly, you should be able to extend the timeout ...
- 5,969
2
votes
Accepted
How to get IonQ Task's Native Instructions/Decomposition (Amazon Braket)
According to the Braket documentation:
Verbatim compilation is currently supported on Rigetti and Oxford Quantum Circuits (OQC) devices and requires the use of native gates.
In other words, Braket ...
- 474
2
votes
Transpilation into custom gate set in qiskit
You can use BQSKit to accomplish this very easily. BQSKit is a powerful and portable quantum compiler/transpiler. You will need to calculate the unitary of your gate and you can just plug that into ...
- 96
2
votes
Software tools to train quantum circuits with parameters
If you're willing to modify the approach slightly, there are many options for you to approach this. Namely, by changing your optimization problem from $\text{argmin}_\theta ||U(\theta) - V||$ to
$$
\...
- 7,721
2
votes
Qiskit: 3 applications of identity with arbitrary SU(2) is universal?
The implementation currently available in TwoQubitBasisDecomposer assumes that the basis gate is supercontrolled (ie has Weyl coordinates $(\pi/4, \beta, 0)$) and ...
- 306
2
votes
What are the available compilers for Trapped-Ion Quantum Computing Architecture?
You can compile to the native gateset of the Quantinuum ion trap devices $\{\text{Rz}, \text{PhasedX}, \text{ZZPhase}\}$ using the pytket-quantinuum package.
See this answer for more details.
- 1,225
2
votes
What are the available compilers for Trapped-Ion Quantum Computing Architecture?
I believe that you can do this actually can be done with Qiskit as well. You just need to specify the basis gates sets you want to use under the transpile function.
For example: If I have the ...
- 14.1k
2
votes
Complexity of translation between Measurement Based and Circuit Based with Error Correction
Stabilizer simulation can be done in $O(gq + rq^2)$ time, where $g$ is the total number of operations, $q$ is the number of qubits, and $r$ is the number of measurements that needed random results. ...
- 42.1k
2
votes
How could compiler optimisations be used with fault-tolerant quantum circuits?
A good strategy is to optimize the macroscopic and microscopic details of fault tolerance separately. At the microscopic level you focus on "how do I make a fault tolerant H gate available?" ...
- 42.1k
2
votes
How does the cirq compilation process work?
Circuit compilation is done with cirq.optimize_for_target_gateset. the method takes as an input a target gate set (e.g. cirq.CZTargetGateset) which dictates the flow of translation. Generally the ...
- 131
2
votes
Is it possible to approximately compile Toffoli using H and CSWAP?
You can exactly implement a Toffoli using CSWAPs catalyzed by a singlet state:
The singlet state is the -1 eigenstate of the swap gate, and you can get phase kickback from a swap by using cswap, so ...
- 42.1k
1
vote
How to get IonQ Task's Native Instructions/Decomposition (Amazon Braket)
Update: The IonQ gate decomposition is not available, but Amazon Braket now supports native programming on the IonQ device (see cell 23). The new version of the SDK, 1.30.0, adds three native gates.
...
- 1,273
1
vote
Pytket's SquashTK1 pass changes symbolic parameters of gates into complicated expressions
Squashing symbolic gates with optimisation passes like SquashTK1 frequently leads to lengthy trigometric expresions. See the pytket user manual for some background.
However in this case its possible ...
- 1,225
1
vote
Accepted
How to specify custom gate set for the optimization in pytket?
Yes it is possible to get pytket to give you a circuit in the desired gateset.
The simple case
In certain cases this can be done automatically with the auto_rebase_pass. This auto rebase depends on a ...
- 1,225
1
vote
How is randomized compiling actually helpful: experimentally, a gate is not "perfect" followed by some noise acting "after"
Randomized compiling does not depend on whether you model the errors in the gate as occurring before, after, or during the gate. The important part is that you sandwich the target gate (which includes ...
Only top scored, non community-wiki answers of a minimum length are eligible