اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOptimal Qubit Mapping with Simultaneous Gate Absorption
209
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Before quantum error correction (QEC) is achieved, quantum computers focus on noisy intermediate-scale quantum (NISQ) applications. Compared to the well-known quantum algorithms requiring QEC, like Shors or Grovers algorithm, NISQ applications have different structures and properties to exploit in compilation. A key step in compilation is mapping the qubits in the program to physical qubits on a given quantum computer, which has been shown to be an NP-hard problem. In this paper, we present OLSQ-GA, an optimal qubit mapper with a key feature of simultaneous SWAP gate absorption during qubit mapping, which we show to be a very effective optimization technique for NISQ applications. For the class of quantum approximate optimization algorithm (QAOA), an important NISQ application, OLSQ-GA reduces depth by up to 50.0% and SWAP count by 100% compared to other state-of-the-art methods, which translates to 55.9% fidelity improvement. The solution optimality of OLSQ-GA is achieved by the exact SMT formulation. For better scalability, we augment our approach with additional constraints in the form of initial mapping or alternating matching, which speeds up OLSQ-GA by up to 272X with no or little loss of optimality.
قيم البحث
اقرأ أيضاً
Due to little consideration in the hardware constraints, e.g., limited connections between physical qubits to enable two-qubit gates, most quantum algorithms cannot be directly executed on the Noisy Intermediate-Scale Quantum (NISQ) devices. Dynamica
lly remapping logical qubits to physical qubits in the compiler is needed to enable the two-qubit gates in the algorithm, which introduces additional operations and inevitably reduces the fidelity of the algorithm. Previous solutions in finding such remapping suffer from high complexity, poor initial mapping quality, and limited flexibility and controllability. To address these drawbacks mentioned above, this paper proposes a SWAP-based BidiREctional heuristic search algorithm SABRE, which is applicable to NISQ devices with arbitrary connections between qubits. By optimizing every search attempt,globally optimizing the initial mapping using a novel reverse traversal technique, introducing the decay effect to enable the trade-off between the depth and the number of gates of the entire algorithm, SABRE outperforms the best known algorithm with exponential speedup and comparable or better results on various benchmarks.
We present an algorithm for compiling arbitrary unitaries into a sequence of gates native to a quantum processor. As accurate CNOT gates are hard for the foreseeable Noisy- Intermediate-Scale Quantum devices era, our A* inspired algorithm attempts to
minimize their count, while accounting for connectivity. We discuss the search strategy together with metrics to expand the solution frontier. For a workload of circuits with complexity appropriate for the NISQ era, we produce solutions well within the best upper bounds published in literature and match or exceed hand tuned implementations, as well as other existing synthesis alternatives. In particular, when comparing against state-of-the-art available synthesis packages we show 2.4x average (up to 5.3x) reduction in CNOT count. We also show how to re-target the algorithm for a different chip topology and native gate set, while obtaining similar quality results. We believe that empirical tools like ours can facilitate algorithmic exploration, gate set discovery for quantum processor designers, as well as providing useful optimization blocks within the quantum compilation tool-chain.
The rapid progress of physical implementation of quantum computers paved the way for the design of tools to help users write quantum programs for any given quantum device. The physical constraints inherent in current NISQ architectures prevent most q
uantum algorithms from being directly executed on quantum devices. To enable two-qubit gates in the algorithm, existing works focus on inserting SWAP gates to dynamically remap logical qubits to physical qubits. However, their schemes lack consideration of the execution time of generated quantum circuits. In this work, we propose a slack-aware SWAP insertion scheme for the qubit mapping problem in the NISQ era. Our experiments show performance improvement by up to 2.36X at maximum, by 1.62X on average, over 106 representative benchmarks from RevLib, IBM Qiskit , and ScaffCC.
Quantum computation requires qubits that can be coupled and realized in a scalable manner, together with universal and high-fidelity one- and two-qubit logic gates cite{DiVincenzo2000, Loss1998}. Strong effort across several fields have led to an imp
ressive array of qubit realizations, including trapped ions cite{Brown2011}, superconducting circuits cite{Barends2014}, single photonscite{Kok2007}, single defects or atoms in diamond cite{Waldherr2014, Dolde2014} and silicon cite{Muhonen2014}, and semiconductor quantum dots cite{Veldhorst2014}, all with single qubit fidelities exceeding the stringent thresholds required for fault-tolerant quantum computing cite{Fowler2012}. Despite this, high-fidelity two-qubit gates in the solid-state that can be manufactured using standard lithographic techniques have so far been limited to superconducting qubits cite{Barends2014}, as semiconductor systems have suffered from difficulties in coupling qubits and dephasing cite{Nowack2011, Brunner2011, Shulman2012}. Here, we show that these issues can be eliminated altogether using single spins in isotopically enriched siliconcite{Itoh2014} by demonstrating single- and two-qubit operations in a quantum dot system using the exchange interaction, as envisaged in the original Loss-DiVincenzo proposal cite{Loss1998}. We realize CNOT gates via either controlled rotation (CROT) or controlled phase (CZ) operations combined with single-qubit operations. Direct gate-voltage control provides single-qubit addressability, together with a switchable exchange interaction that is employed in the two-qubit CZ gate. The speed of the two-qubit CZ operations is controlled electrically via the detuning energy and we find that over 100 two-qubit gates can be performed within a two-qubit coherence time of 8 textmu s, thereby satisfying the criteria required for scalable quantum computation.
We propose an implementation of the two-qubit gate in a quantum dot spin qubit system which is immune to charge noise problems. Our proposed implementation, if it could be realized in a physical system, would have the advantage of being robust agains
t uncertainties and fluctuations in the tunnel coupling and barrier gate voltage pulse area. The key idea is to introduce an auxiliary dot and use an analog to the stimulated Raman adiabatic passage pulse sequence in three-level atomic systems, often referred to in the context of electron transport in quantum dot systems as Coherent Tunneling by Adiabatic Passage. Spin-dependent tunneling opens the possibility of performing two-qubit gate operations by this method.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
