Compiling SU(4) quantum circuits to IBM QX architectures

Zulehner, Alwin; Wille, Robert

doi:10.1145/3287624.3287704

Cited by 84 publications

(54 citation statements)

References 24 publications

(47 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Most prominently, this can be observed in the domain of quantum simulation, where random circuits are used to show quantum supremacy. But also the "big players" in the field frequently rely on random benchmarks as can, e.g., be seen by the recent competitions conducted by IBM [38,46].…”

Section: Resultsmentioning

confidence: 99%

Advanced exact synthesis of Clifford+T circuits

Niemann

Wille

Drechsler

2020

Quantum Inf Process

Self Cite

View full text Add to dashboard Cite

Quantum systems provide a new way of conducting computations based on the so-called qubits. Due to the potential for significant speed-ups, this field received significant research attention in recent years. The Clifford+T library is a very promising and popular gate library for these kinds of computations. Unlike other libraries considered so far, it consists of only a small number of gates for all of which robust, fault-tolerant realizations are known for many technologies that seem to be promising for large-scale quantum computing. As a consequence, (logic) synthesis of Clifford+T quantum circuits became an important research problem. However, previous work in this area has several drawbacks: Corresponding approaches are either only applicable to very small quantum systems or lead to circuits that are far from being optimal. The latter is mainly caused by the fact that current synthesis realizes the desired circuit by a local, i.e., column-wise, consideration of the underlying unitary transformation matrix to be synthesized. In this paper, we analyze the conceptual drawbacks of this approach and propose to overcome them by taking a global view of the matrices and perform a separation of concerns regarding individual synthesis steps. We precisely describe a corresponding algorithm as well as its efficient implementation on top of decision diagrams. Experimental results confirm the resulting benefits and show improvements of up to several orders of magnitudes in costs compared to previous work.

show abstract

Section: Resultsmentioning

confidence: 99%

Advanced exact synthesis of Clifford+T circuits

Niemann

Wille

Drechsler

2020

Quantum Inf Process

Self Cite

View full text Add to dashboard Cite

show abstract

“…We did not perform a comparison against the IBM challenge winner, because it would not have been a fair one. The challenge winner uses information about the internals of the circuits (two qubit arbitrary gates are decomposed with the KAK algorithm [9]) in order to partially recompile subcircuits. The herein proposed cost model and search method are agnostic to quantum circuit internals or other previous circuit decomposition techniques.…”

Section: Resultsmentioning

confidence: 99%

On the Influence of Initial Qubit Placement During NISQ Circuit Compilation

Paler

2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Noisy Intermediate-Scale Quantum (NISQ) machines are not fault-tolerant, operate few qubits (currently, less than hundred), but are capable of executing interesting computations. Above the quantum supremacy threshold (approx. 60 qubits), NISQ machines are expected to be more powerful than existing classical computers. One of the most stringent problems is that computations (expressed as quantum circuits) have to be adapted (compiled) to the NISQ hardware, because the hardware does not support arbitrary interactions between the qubits. This procedure introduces additional gates (e.g. SWAP gates) into the circuits while leaving the implemented computations unchanged. Each additional gate increases the failure rate of the adapted (compiled) circuits, because the hardware and the circuits are not fault-tolerant. It is reasonable to expect that the placement influences the number of additionally introduced gates. Therefore, a combinatorial problem arises: how are circuit qubits allocated (placed) initially to the hardware qubits? The novelty of this work relies on the methodology used to investigate the influence of the initial placement. To this end, we introduce a novel heuristic and cost model to estimate the number of gates necessary to adapt a circuit to a given NISQ architecture. We implement the heuristic (source code available on github) and benchmark it using a standard compiler (e.g. from IBM Qiskit) treated as a black box. Preliminary results indicate that cost reductions of up to 10% can be achieved for practical circuit instances on realistic NISQ architectures only by placing qubits differently than default (trivial placement).

show abstract

“…If there is a subgraph monomorphism p : t|ket solves the problem in two steps: finding an initial placement of logical qubits to physical qubits and subsequent addition of SWAP operations to the circuit. We consider this to be a dynamic approach, in contrast to static approaches [78,79,80], that partition circuits into parallelised slices of two-qubit interactions, and then use SWAP networks to permute logical qubits between placements that satisfy these slices.…”

Section: Mapping To Physical Qubitsmentioning

confidence: 99%

t|ket⟩: a retargetable compiler for NISQ devices

Sivarajah

Dilkes

Cowtan

et al. 2020

Quantum Sci. Technol.

284

208

View full text Add to dashboard Cite

We present t|ket , a quantum software development platform produced by Cambridge Quantum Computing Ltd. The heart of t|ket is a language-agnostic optimising compiler designed to generate code for a variety of NISQ devices, which has several features designed to minimise the influence of device error. The compiler has been extensively benchmarked and outperforms most competitors in terms of circuit optimisation and qubit routing. User Runtime GPU Classical HPC Logging Task Manager Scheduler Real-Time Controller Control Device Control Device Readout Device … Figure 2: Idealised system architecture for a NISQ Computerprogrammable devices which drive the evolution of the qubits and read out their states. An example of this kind of device is an arbitrary waveform generator, as found in many superconducting architectures. The microwave pulse sequences output by these devices are generated by simple low-level programs optimised for speed of execution. These devices, and the real-time controller which synchronises them, operate in a hard real-time environment where the computation takes place on the time-scale of the coherence time of the qubits. These components combine to execute a single instance of a quantum circuit, possibly with some classical control. By analogy with GPU computing, we refer to this layer as a kernel. One level higher, the scheduler is responsible for dispatching circuits to be run and packaging the results for the higher layers. It is also likely to be heavily involved in the device calibration process. (Calibration data are an important input to the compiler.) This layer and those below may be thought of as the low-level system software of the quantum computer, and must normally be physically close to the device. In the layer above we find service-oriented middleware, principally the task manager, which may distribute jobs to different quantum devices or simulators, GPUs, and perhaps conventional HPC resources, to perform the various subroutines of the quantum algorithm. This layer may also allocate access to the quantum system among multiple users. Finally, at the highest level is the user runtime, which defines the overall algorithm and integrates the results of the subcomputations to produce the final answer.

show abstract

Compiling SU(4) quantum circuits to IBM QX architectures

Cited by 84 publications

References 24 publications

Advanced exact synthesis of Clifford+T circuits

Advanced exact synthesis of Clifford+T circuits

On the Influence of Initial Qubit Placement During NISQ Circuit Compilation

t|ket⟩: a retargetable compiler for NISQ devices

Contact Info

Product

Resources

About