Optimally Fast Qubit Reset

• URL: http://arxiv.org/abs/2412.04883v1
• Date: Fri, 06 Dec 2024 09:25:13 GMT
• Title: Optimally Fast Qubit Reset
• Authors: Yue Liu, Chenlong Huang, Xingyu Zhang, Dahai He,
• Abstract summary: 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.
• Score: 7.2589497361729975
• License:
• Abstract: In practice, qubit reset must be operated in an extremely short time, which incurs a thermodynamic cost within multiple orders of magnitude above the Landauer bound. We present a general framework to determine the minimal thermodynamic cost and the optimal protocol for arbitrary resetting speeds. Our study reveals the divergent behavior of minimal entropy production in the short-time limit depends on the convergence and divergence of the jump operators. For the convergent class, an inherent trade-off exists between the minimal required time and the set error probability, which hinders the Moore's law continuing in such cases. Moreover, we find the optimal protocol exhibits the similarity in the fast-driving regime for different times. To demonstrate our findings, we empoly fermionic and bosonic baths as examples. Our results suggest that the super-Ohmic bosonic heat bath is a suitable choice for qubit reset.

Related papers

• 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)
• Model-based Optimization of Superconducting Qubit Readout [59.992881941624965]
  We demonstrate model-based readout optimization for superconducting qubits. We observe 1.5% error per qubit with a 500ns end-to-end duration and minimal excess reset error from residual resonator photons. This technique can scale to hundreds of qubits and be used to enhance the performance of error-correcting codes and near-term applications.
  arXiv  Detail & Related papers  (2023-08-03T23:30:56Z)
• Qubit Number Optimization for Restriction Terms of QUBO Hamiltonians [62.997667081978825]
  It is mathematically allowed to ask for fractional values of $R$. We show how they can reduce the number of qubits needed to implement the restriction hamiltonian even further. Finally, we characterize the response of DWave's Advantage$_$system4.1 Quantum Annealer (QA) when faced with the implementation of FRCs.
  arXiv  Detail & Related papers  (2023-06-12T08:25:56Z)
• 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)
• Inverse linear versus exponential scaling of work penalty in finite-time bit reset [0.0]
  Bit reset costs work and dissipates energy in the computer, creating a limit on speeds and energy efficiency of future irreversible computers. An important question is to understand under what protocol parameters, including bit reset error and maximum energy shift, this penalty decreases exponentially vs inverse linearly in the protocol time. Here we provide several analytical results to address this question, as well as numerical simulations of specific examples of protocols.
  arXiv  Detail & Related papers  (2021-12-20T11:21:05Z)
• Minibatch vs Local SGD with Shuffling: Tight Convergence Bounds and Beyond [63.59034509960994]
  We study shuffling-based variants: minibatch and local Random Reshuffling, which draw gradients without replacement. For smooth functions satisfying the Polyak-Lojasiewicz condition, we obtain convergence bounds which show that these shuffling-based variants converge faster than their with-replacement counterparts. We propose an algorithmic modification called synchronized shuffling that leads to convergence rates faster than our lower bounds in near-homogeneous settings.
  arXiv  Detail & Related papers  (2021-10-20T02:25:25Z)
• Universal Bound on Energy Cost of Bit Reset in Finite Time [0.0]
  We consider how the energy cost of bit reset scales with the time duration of the protocol. We derive a closed-form lower bound on the work penalty as a function of the time taken for the protocol and the bit reset error.
  arXiv  Detail & Related papers  (2021-06-01T15:47:38Z)
• The Variational Method of Moments [65.91730154730905]
  conditional moment problem is a powerful formulation for describing structural causal parameters in terms of observables. Motivated by a variational minimax reformulation of OWGMM, we define a very general class of estimators for the conditional moment problem. We provide algorithms for valid statistical inference based on the same kind of variational reformulations.
  arXiv  Detail & Related papers  (2020-12-17T07:21:06Z)
• Dissipative-coupling-assisted laser cooling: limitations and perspectives [91.3755431537592]
  We present a comprehensive analysis of a protocol which reveals its very high sensitivity to small imperfections such as an additional dissipation. A detailed comparison of the cooling protocol in question with the dispersive-coupling-assisted protocols which use the red sideband excitation or feedback is presented.
  arXiv  Detail & Related papers  (2020-07-27T16:02:16Z)
• Balancing Rates and Variance via Adaptive Batch-Size for Stochastic Optimization Problems [120.21685755278509]
  In this work, we seek to balance the fact that attenuating step-size is required for exact convergence with the fact that constant step-size learns faster in time up to an error. Rather than fixing the minibatch the step-size at the outset, we propose to allow parameters to evolve adaptively.
  arXiv  Detail & Related papers  (2020-07-02T16:02:02Z)
• Fundamental Bounds on Qubit Reset [6.474760227870046]
  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.
  arXiv  Detail & Related papers  (2020-01-24T17:18: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.