Fundamental Bounds on Qubit Reset
- URL: http://arxiv.org/abs/2001.09107v2
- Date: Wed, 23 Sep 2020 10:46:00 GMT
- Title: Fundamental Bounds on Qubit Reset
- Authors: Daniel Basilewitsch, Jonas Fischer, Daniel M. Reich, Dominique Sugny,
Christiane P. Koch
- Abstract summary: We derive fundamental bounds on qubit reset in terms of maximum fidelity and minimum time.
We find the maximally achievable fidelity to increase with the size of the ancilla Hilbert space.
- Score: 6.474760227870046
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Qubit reset is a basic prerequisite for operating quantum devices, requiring
the export of entropy. The fastest and most accurate way to reset a qubit is
obtained by coupling the qubit to an ancilla on demand. Here, we derive
fundamental bounds on qubit reset in terms of maximum fidelity and minimum
time, assuming control over the qubit and no control over the ancilla. Using
the Cartan decomposition of the Lie algebra of qubit plus two-level ancilla, we
identify the types of interaction and controls for which the qubit can be
purified. For these configurations, we show that a time-optimal protocol
consists of purity exchange between qubit and ancilla brought into resonance,
where the maximum fidelity is identical for all cases but the minimum time
depends on the type of interaction and control. Furthermore, we find the
maximally achievable fidelity to increase with the size of the ancilla Hilbert
space, whereas the reset time remains constant.
Related papers
- Optimally Fast Qubit Reset [7.2589497361729975]
We determine the minimal thermodynamic cost and the optimal protocol for arbitrary resetting speeds.
Our results suggest that the super-Ohmic bosonic heat bath is a suitable choice for qubit reset.
arXiv Detail & Related papers (2024-12-06T09:25:13Z) - High-fidelity gates in a transmon using bath engineering for passive leakage reset [65.46249968484794]
Leakage, the occupation of any state not used in the computation, is one of the most devastating errors in quantum error correction.
We demonstrate a device which reduces the lifetimes of the leakage states in the transmon by three orders of magnitude.
arXiv Detail & Related papers (2024-11-06T18:28:49Z) - Collective advantages in qubit reset: effect of coherent qubits [7.2589497361729975]
We explore the collective advantage of qubit reset of coherent qubits in three aspects.
For the quasistatic process, the thermodynamic cost of collective reset is remarkably lower than parallel reset.
We show that qubit reset performance enhances with the increase in the number of qubits.
arXiv Detail & Related papers (2024-07-03T13:35:29Z) - 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) - Quantum state preparation via engineered ancilla resetting [0.0]
We study a protocol that incorporates periodic quantum resetting to prepare ground states of frustration-free parent Hamiltonians.
This protocol uses a steering Hamiltonian that enables local coupling between the system and ancillary degrees of freedom.
Our numerical results show that ancilla system entanglement is essential for faster convergence.
arXiv Detail & Related papers (2023-05-15T13:34:07Z) - Qubit readouts enabled by qubit cloaking [49.1574468325115]
Time-dependent drives play a crucial role in quantum computing efforts.
They enable single-qubit control, entangling logical operations, as well as qubit readout.
Qubit cloaking was introduced in Lled'o, Dassonneville, et al.
arXiv Detail & Related papers (2023-05-01T15:58:25Z) - 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) - Quantum Speed Limit for Change of Basis [55.500409696028626]
We extend the notion of quantum speed limits to collections of quantum states.
For two-qubit systems, we show that the fastest transformation implements two Hadamards and a swap of the qubits simultaneously.
For qutrit systems the evolution time depends on the particular type of the unbiased basis.
arXiv Detail & Related papers (2022-12-23T14:10:13Z) - On Fault Tolerance of Circuits with Intermediate Qutrit-assisted Gate
Decomposition [3.452050192629253]
An intermediate qutrit implies that a qubit is operated as a qutrit in a particular execution cycle.
We study the challenges of including fault-tolerance in such a decomposition.
arXiv Detail & Related papers (2022-12-15T14:33:45Z) - Optimal Quantum Transfer from Input Flying Qubit to Lossy Quantum Memory [0.0]
In a quantum network, a key challenge is to minimize the direct reflection of flying qubits as they couple to stationary, resonator-based memory qubits.
We show that a state transfer fidelity of around 99.9% can be reached for practical intrinsic losses of resonators used as quantum memories.
arXiv Detail & Related papers (2020-11-11T09:56:35Z) - Bayesian Bits: Unifying Quantization and Pruning [73.27732135853243]
We introduce Bayesian Bits, a practical method for joint mixed precision quantization and pruning through gradient based optimization.
We experimentally validate our proposed method on several benchmark datasets and show that we can learn pruned, mixed precision networks.
arXiv Detail & Related papers (2020-05-14T16:00:34Z)
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.