Time-Efficient Qudit Gates through Incremental Pulse Re-seeding
- URL: http://arxiv.org/abs/2206.14975v2
- Date: Tue, 27 Feb 2024 15:33:10 GMT
- Title: Time-Efficient Qudit Gates through Incremental Pulse Re-seeding
- Authors: Lennart Maximilian Seifert, Jason Chadwick, Andrew Litteken, Frederic
T. Chong, Jonathan M. Baker
- Abstract summary: Current efforts to build quantum computers focus on the two-state qubit, which often involves suppressing readily-available higher states.
In this work, we break this abstraction and synthesize short-duration control pulses for gates on generalized d-state qudits.
We find a near-linear relationship between Hilbert space dimension and gate duration through explicit pulse optimization for one- and two-qudit gates on transmons.
- Score: 4.2698418800007865
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Current efforts to build quantum computers focus mainly on the two-state
qubit, which often involves suppressing readily-available higher states. In
this work, we break this abstraction and synthesize short-duration control
pulses for gates on generalized d-state qudits. We present Incremental Pulse
Re-seeding, a practical scheme to guide optimal control software to the
lowest-duration pulse by iteratively seeding the optimizer with previous
results. We find a near-linear relationship between Hilbert space dimension and
gate duration through explicit pulse optimization for one- and two-qudit gates
on transmons. Our results suggest that qudit operations are much more efficient
than previously expected in the practical regime of interest and have the
potential to significantly increase the computational power of current
hardware.
Related papers
- EPOC: A Novel Pulse Generation Framework Incorporating Advanced Synthesis Techniques for Quantum Circuits [5.42802616500974]
EPOC is an efficient pulse generation framework for quantum circuits.
It combines ZX-Calculus, circuit partitioning, and circuit synthesis to accelerate pulse generation.
arXiv Detail & Related papers (2024-05-06T19:20:32Z) - Optimal Control of Spin Qudits Subject to Decoherence Using Amplitude-and-Frequency-Constrained Pulses [44.99833362998488]
We introduce a formulation that allows us to bound the maximum amplitude and frequency of the signals.
The pulses we obtain consistently enhance operation fidelities compared to those achieved with Schr"odinger's equation.
arXiv Detail & Related papers (2024-03-23T10:10:38Z) - Enhancing Dispersive Readout of Superconducting Qubits Through Dynamic
Control of the Dispersive Shift: Experiment and Theory [47.00474212574662]
A superconducting qubit is coupled to a large-bandwidth readout resonator.
We show a beyond-state-of-the-art two-state-readout error of only 0.25,%$ in 100 ns integration time.
The presented results are expected to further boost the performance of new and existing algorithms and protocols.
arXiv Detail & Related papers (2023-07-15T10:30:10Z) - 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) - Efficient control pulses for continuous quantum gate families through
coordinated re-optimization [3.7845912794054337]
We find that interpolating between optimized control pulses for different quantum operations does not immediately yield a high-fidelity intermediate operation.
We pick several reference operations in the gate family of interest and optimize pulses that implement these operations, then iteratively re-optimize the pulses to guide their shapes to be similar for operations that are closely related.
Our technique generalizes to any number of gate parameters and could easily be used with advanced pulse optimization algorithms to allow for better translation from simulation to experiment.
arXiv Detail & Related papers (2023-02-03T05:23:16Z) - Speed limits for two-qubit gates with weakly anharmonic qubits [0.6738135972929344]
We use optimal control theory to determine the maximum achievable gate speed for two-qubit gates.
We analyze the effect of the additional quantum states on the gate speed.
arXiv Detail & Related papers (2021-09-03T12:07:59Z) - Accurate methods for the analysis of strong-drive effects in parametric
gates [94.70553167084388]
We show how to efficiently extract gate parameters using exact numerics and a perturbative analytical approach.
We identify optimal regimes of operation for different types of gates including $i$SWAP, controlled-Z, and CNOT.
arXiv Detail & Related papers (2021-07-06T02:02:54Z) - Control optimization for parametric hamiltonians by pulse reconstruction [21.723487348914958]
We propose a method to reduce the computational time required to generate the control pulse for a Hamiltonian.
We use simple schemes to accurately reconstruct the control pulses from a set of pulses obtained in advance for a discrete set of predetermined parameter values.
arXiv Detail & Related papers (2021-02-24T14:47:09Z) - Fast and differentiable simulation of driven quantum systems [58.720142291102135]
We introduce a semi-analytic method based on the Dyson expansion that allows us to time-evolve driven quantum systems much faster than standard numerical methods.
We show results of the optimization of a two-qubit gate using transmon qubits in the circuit QED architecture.
arXiv Detail & Related papers (2020-12-16T21:43:38Z) - Scalable quantum computation with fast gates in two-dimensional
microtrap arrays of trapped ions [68.8204255655161]
We investigate the use of fast pulsed two-qubit gates for trapped ion quantum computing in a two-dimensional microtrap architecture.
We demonstrate that fast pulsed gates are capable of implementing high-fidelity entangling operations between ions in neighbouring traps faster than the trapping period.
arXiv Detail & Related papers (2020-05-01T13:18: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.