Pulse-level Scheduling of Quantum Circuits for Neutral-Atom Devices
- URL: http://arxiv.org/abs/2206.05144v1
- Date: Fri, 10 Jun 2022 14:37:09 GMT
- Title: Pulse-level Scheduling of Quantum Circuits for Neutral-Atom Devices
- Authors: Richard Bing-Shiun Tsai, Henrique Silv\'erio, Loic Henriet
- Abstract summary: We show how a pulse-level implementation of the multi-qubit gates in neutral-atom device architectures allows for the simultaneous execution of single- and multi-qubit gates.
We present an algorithm to schedule the execution of a quantum circuit as a pulse sequence on a neutral-atom device with a single channel for single- and multi-qubit gate execution.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We show how a pulse-level implementation of the multi-qubit gates in
neutral-atom device architectures allows for the simultaneous execution of
single- and multi-qubit gates acting on overlapping sets of qubits, in a
mechanism we name absorption. With absorption as a foundation, we present an
algorithm to schedule the execution of a quantum circuit as a pulse sequence on
a neutral-atom device with a single channel for single- and multi-qubit gate
execution. For any quantum circuit of practical relevance, we observe that the
algorithm results in an optimal utilization of the available resources that
cannot be surpassed by a different scheduling strategy. Our benchmarks against
a custom scheduler attempting to maximize parallelization at the gate level
show the time gained by the pulse-level scheduler is proportional to the depth
and is most pronounced for quantum circuits with fewer qubits.
Related papers
- Resource-aware scheduling of multiple quantum circuits on a hardware device [0.0]
We consider an optimization problem which schedules as many circuits as possible for execution in parallel on the hardware.
An integer linear programming formulation to ensure maximum fidelity while preserving the nearest neighbor arrangement among interacting qubits is presented.
arXiv Detail & Related papers (2024-07-12T02:33:07Z) - Multi-qubit Lattice Surgery Scheduling [3.7126786554865774]
A quantum circuit can be transpiled into a sequence of solely non-Clifford multi-qubit gates.
We show that the transpilation significantly reduces the circuit length on the set of circuits tested.
The resulting circuit of multi-qubit gates has a further reduction in the expected circuit execution time compared to serial execution.
arXiv Detail & Related papers (2024-05-27T22:41:41Z) - Pulse-controlled qubit in semiconductor double quantum dots [57.916342809977785]
We present a numerically-optimized multipulse framework for the quantum control of a single-electron charge qubit.
A novel control scheme manipulates the qubit adiabatically, while also retaining high speed and ability to perform a general single-qubit rotation.
arXiv Detail & Related papers (2023-03-08T19:00:02Z) - Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs)
We propose a new protocol for approximating TN states using realistic quantum circuits.
Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
arXiv Detail & Related papers (2022-09-01T17:08:41Z) - Simulating quantum circuits using efficient tensor network contraction
algorithms with subexponential upper bound [0.0]
We show that quantum circuits of single-qubit and finite-ranged two-qubit gates can be classically simulated in subexponential time.
We implement an algorithm guaranteed to meet our bound and which finds contraction orders with vastly lower computational times in practice.
arXiv Detail & Related papers (2022-08-02T14:46:52Z) - Approximate quantum gates compiling with self-navigation algorithm [0.0]
We propose an algorithm to approximately compile single-qubit gates with arbitrary accuracy.
Evaluation results show that the overall rotation distance generated by our algorithm is significantly shorter than the commonly used $U3$ gate.
arXiv Detail & Related papers (2022-04-06T03:07:17Z) - Effective non-local parity-dependent couplings in qubit chains [0.0]
We harness the simultaneous coupling of qubits on a chain and engineer a set of non-local parity-dependent quantum operations.
The resulting effective long-range couplings directly implement a parametrizable Trotter-step for Jordan-Wigner fermions.
We present numerical simulations of the gate operation in a superconducting quantum circuit architecture.
arXiv Detail & Related papers (2022-03-14T17:33:40Z) - Fast Swapping in a Quantum Multiplier Modelled as a Queuing Network [64.1951227380212]
We propose that quantum circuits can be modeled as queuing networks.
Our method is scalable and has the potential speed and precision necessary for large scale quantum circuit compilation.
arXiv Detail & Related papers (2021-06-26T10:55:52Z) - Improving the Performance of Deep Quantum Optimization Algorithms with
Continuous Gate Sets [47.00474212574662]
Variational quantum algorithms are believed to be promising for solving computationally hard problems.
In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances.
Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
arXiv Detail & Related papers (2020-05-11T17:20:51Z) - Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling.
We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
arXiv Detail & Related papers (2020-05-05T20:11:53Z) - Programming a quantum computer with quantum instructions [39.994876450026865]
We use a density matrixiation protocol to execute quantum instructions on quantum data.
A fixed sequence of classically-defined gates performs an operation that uniquely depends on an auxiliary quantum instruction state.
The utilization of quantum instructions obviates the need for costly tomographic state reconstruction and recompilation.
arXiv Detail & Related papers (2020-01-23T22:43:29Z)
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.