Clifford Assisted Optimal Pass Selection for Quantum Transpilation

• URL: http://arxiv.org/abs/2306.15020v1
• Date: Mon, 26 Jun 2023 19:21:45 GMT
• Title: Clifford Assisted Optimal Pass Selection for Quantum Transpilation
• Authors: Siddharth Dangwal, Gokul Subramanian Ravi, Lennart Maximilian Seifert, and Frederic T. Chong
• Abstract summary: We propose OPTRAN, a framework for Choosing an Optimal Pass Set for Quantum Transpilation. We show that OPTRAN improves fidelity by 87.66% of the maximum possible limit over the baseline used by IBM Qiskit. We also propose low-cost variants of OPTRAN, called OPTRAN-E-3 and OPTRAN-E-1 that improve fidelity by 78.33% and 76.66% of the maximum permissible limit over the baseline at a 58.33% and 69.44% reduction in cost compared to OPTRAN respectively.
• Score: 2.8192289321660153
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: The fidelity of quantum programs in the NISQ era is limited by high levels of device noise. To increase the fidelity of quantum programs running on NISQ devices, a variety of optimizations have been proposed. These include mapping passes, routing passes, scheduling methods and standalone optimisations which are usually incorporated into a transpiler as passes. Popular transpilers such as those proposed by Qiskit, Cirq and Cambridge Quantum Computing make use of these extensively. However, choosing the right set of transpiler passes and the right configuration for each pass is a challenging problem. Transpilers often make critical decisions using heuristics since the ideal choices are impossible to identify without knowing the target application outcome. Further, the transpiler also makes simplifying assumptions about device noise that often do not hold in the real world. As a result, we often see effects where the fidelity of a target application decreases despite using state-of-the-art optimisations. To overcome this challenge, we propose OPTRAN, a framework for Choosing an Optimal Pass Set for Quantum Transpilation. OPTRAN uses classically simulable quantum circuits composed entirely of Clifford gates, that resemble the target application, to estimate how different passes interact with each other in the context of the target application. OPTRAN then uses this information to choose the optimal combination of passes that maximizes the target application's fidelity when run on the actual device. Our experiments on IBM machines show that OPTRAN improves fidelity by 87.66% of the maximum possible limit over the baseline used by IBM Qiskit. We also propose low-cost variants of OPTRAN, called OPTRAN-E-3 and OPTRAN-E-1 that improve fidelity by 78.33% and 76.66% of the maximum permissible limit over the baseline at a 58.33% and 69.44% reduction in cost compared to OPTRAN respectively.

Related papers

• Quantum Approximate Optimization Algorithm with Fixed Number of Parameters [0.0]
  We introduce a novel quantum optimization paradigm: the Fixed--Count Approximate Quantum Optimization Algorithm (FPC-QAOA)<n>It is a scalable variational framework that maintains a constant number of trainable parameters regardless of the number of qubits, Hamiltonian complexity, or circuit depth.<n>We benchmark FPC-QAOA on random MaxCut instances and the Tail Assignment Problem, achieving performance comparable to or better than standard QAOA.
  arXiv  Detail & Related papers  (2025-12-24T14:02:31Z)
• Modeling Wavelet Transformed Quantum Support Vector for Network Intrusion Detection [9.036718544324573]
  We present a novel quantum-classical framework integrating an enhanced Quantum Support Vector Machine (QSVM) with the Quantum Haar Wavelet Packet Transform (QWPT)<n>Our methodology employs amplitude-encoded quan-tum state preparation, multi-level QWPT feature extraction, and behavioral analysis via Shannon Entropy profiling and Chi-square testing.<n> Evaluation under noiseless and depolarizing noise conditions demonstrates exceptional performance: 96.67% accuracy on BoT-IoT and 89.67% on IoT-23 datasets, surpassing quantum autoencoder approaches by over 7 percentage points.
  arXiv  Detail & Related papers  (2025-12-01T07:23:20Z)
• Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz [3.5773675235837974]
  Quantum Random Access Optimization (QRAO) has been proposed to reduce the space requirements of quantum optimization. We show that instance-independent 'fixed' parameters achieve good performance, removing the need for variational parameter optimization. Our results pave the way for the practical execution of QRAO on early fault-tolerant quantum computers.
  arXiv  Detail & Related papers  (2025-02-06T18:25:31Z)
• BOSS: Blocking algorithm for optimizing shuttling scheduling in Ion Trap [33.720436732911644]
  Ion traps stand at the forefront of quantum hardware technology, presenting unparalleled benefits for quantum computing. We develop BOSS, an efficient blocking algorithm tailored to enhance shuttling efficiency. Our method significantly reduces the number of shuttles on most applications, with a maximum reduction of 96.1%.
  arXiv  Detail & Related papers  (2024-12-04T16:31:17Z)
• Adaptive quantum optimization algorithms for programmable atom-cavity systems [6.508793834090864]
  We show cold atoms in an optical cavity can be built as a universal quantum with programmable all-to-all interactions. We find the success probability of the standard quantum approximate algorithm (QAOA) decays rapidly with the problem size. Inspired by the counterdiabatic driving, we propose an adaptive ansatz of QAOA which releases the parameter freedom of the NPP Hamiltonian to match higher-order counterdiabatic terms.
  arXiv  Detail & Related papers  (2024-06-11T08:37:31Z)
• Bayesian Parameterized Quantum Circuit Optimization (BPQCO): A task and hardware-dependent approach [49.89480853499917]
  Variational quantum algorithms (VQA) have emerged as a promising quantum alternative for solving optimization and machine learning problems. In this paper, we experimentally demonstrate the influence of the circuit design on the performance obtained for two classification problems. We also study the degradation of the obtained circuits in the presence of noise when simulating real quantum computers.
  arXiv  Detail & Related papers  (2024-04-17T11:00:12Z)
• Reconfigurable Intelligent Surface (RIS)-Assisted Entanglement Distribution in FSO Quantum Networks [62.87033427172205]
  Quantum networks (QNs) relying on free-space optical (FSO) quantum channels can support quantum applications in environments where establishing an optical fiber infrastructure is challenging and costly. A reconfigurable intelligent surface (RIS)-assisted FSO-based QN is proposed as a cost-efficient framework providing a virtual line-of-sight between users for entanglement distribution.
  arXiv  Detail & Related papers  (2024-01-19T17:16:40Z)
• Toward Consistent High-fidelity Quantum Learning on Unstable Devices via Efficient In-situ Calibration [5.0854551390284]
  In the near-term noisy intermediate-scale quantum (NISQ) era, high noise will significantly reduce the fidelity of quantum computing. In this paper, we propose a novel quantum pulse-based noise adaptation framework, namely QuPAD. Experiments show that the runtime on quantum devices of QuPAD with 8-10 qubits is less than 15 minutes, which is up to 270x faster than the parameter-shift approach.
  arXiv  Detail & Related papers  (2023-09-12T15:39:06Z)
• Scaling Limits of Quantum Repeater Networks [62.75241407271626]
  Quantum networks (QNs) are a promising platform for secure communications, enhanced sensing, and efficient distributed quantum computing. Due to the fragile nature of quantum states, these networks face significant challenges in terms of scalability. In this paper, the scaling limits of quantum repeater networks (QRNs) are analyzed.
  arXiv  Detail & Related papers  (2023-05-15T14:57:01Z)
• Tuning Particle Accelerators with Safety Constraints using Bayesian Optimization [73.94660141019764]
  tuning machine parameters of particle accelerators is a repetitive and time-consuming task. We propose and evaluate a step size-limited variant of safe Bayesian optimization.
  arXiv  Detail & Related papers  (2022-03-26T02:21:03Z)
• Quantum Error Mitigation Relying on Permutation Filtering [84.66087478797475]
  We propose a general framework termed as permutation filters, which includes the existing permutation-based methods as special cases. We show that the proposed filter design algorithm always converges to the global optimum, and that the optimal filters can provide substantial improvements over the existing permutation-based methods.
  arXiv  Detail & Related papers  (2021-07-03T16:07:30Z)
• Randomized Benchmarking with Stabilizer Verification and Gate Synthesis [0.0]
  We modify the standard Clifford randomized benchmarking (RB) and interleaved RB schemes targeting them to hardware limitations. We also develop a technique for characterising a variety of non-Clifford gates, by combining tools from gate synthesis with interleaved RB.
  arXiv  Detail & Related papers  (2021-02-25T17:54:47Z)
• Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
  Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices. We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT) Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
  arXiv  Detail & Related papers  (2020-10-01T18:14:11Z)
• Classical Optimizers for Noisy Intermediate-Scale Quantum Devices [1.43494686131174]
  We present a collection of tunings tuned for usage on Noisy Intermediate-Scale Quantum (NISQ) devices. We analyze the efficiency and effectiveness of different minimizes in a VQE case study. While most results to date concentrated on tuning the quantum VQE circuit, we show that, in the presence of quantum noise, the classical minimizer step needs to be carefully chosen to obtain correct results.
  arXiv  Detail & Related papers  (2020-04-06T21:31:22Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.