How Parallel Circuit Execution Can Be Useful for NISQ Computing?
- URL: http://arxiv.org/abs/2112.00387v1
- Date: Wed, 1 Dec 2021 10:12:35 GMT
- Title: How Parallel Circuit Execution Can Be Useful for NISQ Computing?
- Authors: Siyuan Niu, Aida Todri-Sanial
- Abstract summary: Quantum computing is performed on Noisy Intermediate-Scale Quantum (NISQ) hardware in the short term.
Only small circuits can be executed reliably on a quantum machine due to the unavoidable noisy quantum operations on NISQ devices.
A parallel circuit execution technique has been proposed to address this problem by executing multiple programs on hardware simultaneously.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Quantum computing is performed on Noisy Intermediate-Scale Quantum (NISQ)
hardware in the short term. Only small circuits can be executed reliably on a
quantum machine due to the unavoidable noisy quantum operations on NISQ
devices, leading to the under-utilization of hardware resources. With the
growing demand to access quantum hardware, how to utilize it more efficiently
while maintaining output fidelity is becoming a timely issue. A parallel
circuit execution technique has been proposed to address this problem by
executing multiple programs on hardware simultaneously. It can improve the
hardware throughput and reduce the overall runtime. However, accumulative
noises such as crosstalk can decrease the output fidelity in parallel workload
execution. In this paper, we first give an in-depth overview of stateof-the-art
parallel circuit execution methods. Second, we propose a Quantum
Crosstalk-aware Parallel workload execution method (QuCP) without the overhead
of crosstalk characterization. Third, we investigate the trade-off between
hardware throughput and fidelity loss to explore the hardware limitation with
parallel circuit execution. Finally, we apply parallel circuit execution to VQE
and zero-noise extrapolation error mitigation method to showcase its various
applications on advancing NISQ computing.
Related papers
- Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
We develop a reinforcement learning-based quantum compiler for a superconducting processor.
We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths.
Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
arXiv Detail & Related papers (2024-06-18T01:49:48Z) - On Reducing the Execution Latency of Superconducting Quantum Processors via Quantum Program Scheduling [48.142860424323395]
We introduce the Quantum Program Scheduling Problem (QPSP) to improve the utility efficiency of quantum resources.
Specifically, a quantum program scheduling method concerning the circuit width, number of measurement shots, and submission time of quantum programs is proposed to reduce the execution latency.
arXiv Detail & Related papers (2024-04-11T16:12:01Z) - Estimating the Effect of Crosstalk Error on Circuit Fidelity Using Noisy Intermediate-Scale Quantum Devices [0.0]
Crosstalk between parallel instructions can corrupt quantum states and cause incorrect program execution.
We present a necessary analysis of the crosstalk error effect on NISQ devices.
Our results demonstrate the crosstalk error model of three different IBM quantum devices over the experimental week.
arXiv Detail & Related papers (2024-02-10T13:42:14Z) - QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum
Circuits [82.50620782471485]
QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits.
It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness.
Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
arXiv Detail & Related papers (2024-01-10T22:33:00Z) - Parallelizing Quantum-Classical Workloads: Profiling the Impact of
Splitting Techniques [4.741651490006498]
We evaluate two workload splitting techniques on IBM's Quantum Cloud.
We see that (1) VQE with circuit cutting is 39% better in ground state estimation than the uncut version, and (2) QSVM that combines data parallelization with reduced feature set yields upto 3x improvement in quantum workload execution time.
arXiv Detail & Related papers (2023-05-11T05:46:55Z) - QParallel: Explicit Parallelism for Programming Quantum Computers [62.10004571940546]
We present a language extension for parallel quantum programming.
QParallel removes ambiguities concerning parallelism in current quantum programming languages.
We introduce a tool that guides programmers in the placement of parallel regions by identifying the subroutines that profit most from parallelization.
arXiv Detail & Related papers (2022-10-07T16:35:16Z) - Iterative Qubits Management for Quantum Index Searching in a Hybrid
System [56.39703478198019]
IQuCS aims at index searching and counting in a quantum-classical hybrid system.
We implement IQuCS with Qiskit and conduct intensive experiments.
Results demonstrate that it reduces qubits consumption by up to 66.2%.
arXiv Detail & Related papers (2022-09-22T21:54:28Z) - Simultaneous execution of quantum circuits on current and near-future
NISQ systems [1.0312968200748118]
We introduce palloq (parallel allocation of QCs) for improving the performance of quantum multi-programming on NISQ processors.
We also propose a software-based crosstalk detection protocol that efficiently and successfully characterizes the hardware's suitability for multi-programming.
arXiv Detail & Related papers (2021-12-14T01:18:49Z) - Enabling Multi-programming Mechanism for Quantum Computing in the NISQ
Era [0.0]
NISQ devices have several physical limitations and unavoidable noisy quantum operations.
Only small circuits can be executed on a quantum machine to get reliable results.
We propose a Quantum Multi-programming Compiler (QuMC) to execute multiple quantum circuits on quantum hardware simultaneously.
arXiv Detail & Related papers (2021-02-10T08:46:16Z) - Parallelising the Queries in Bucket Brigade Quantum RAM [69.43216268165402]
Quantum algorithms often use quantum RAMs (QRAM) for accessing information stored in a database-like manner.
We show a systematic method to significantly reduce the effective query time by using Clifford+T gate parallelism.
We conclude that, in theory, fault-tolerant bucket brigade quantum RAM queries can be performed approximately with the speed of classical RAM.
arXiv Detail & Related papers (2020-02-21T14:50:03Z)
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.