Quantum noise can enhance algorithmic cooling

• URL: http://arxiv.org/abs/2107.07321v1
• Date: Thu, 15 Jul 2021 13:47:10 GMT
• Title: Quantum noise can enhance algorithmic cooling
• Authors: Zahra Farahmand, Reyhaneh Aghaei Saem, Sadegh Raeisi
• Abstract summary: Heat-Bath Algorithmic Cooling techniques are used to purify a target element in a quantum system. Noise can in some cases enhance the performance and improve the cooling limit of Heat-Bath Algorithmic Cooling techniques.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Heat-Bath Algorithmic Cooling techniques (HBAC) are techniques that are used to purify a target element in a quantum system. These methods compress and transfer entropy away from the target element into auxiliary elements of the system. The performance of Algorithmic Cooling has been investigated under ideal noiseless conditions. However, realistic implementations are imperfect and for practical purposes, noise should be taken into account. Here we analyze Heat-Bath Algorithmic Cooling techniques under realistic noise models. Surprisingly, we find that noise can in some cases enhance the performance and improve the cooling limit of Heat-Bath Algorithmic Cooling techniques. We numerically simulate the noisy algorithmic cooling for the two optimal strategies, the Partner Pairing, and the Two-sort algorithms. We find that for both of them, in the presence of the generalized amplitude damping noise, the process converges and the asymptotic purity can be higher than the noiseless process. This opens up new avenues for increasing the purity beyond the heat-bath algorithmic cooling.

Related papers

• Quantum algorithms for cooling: a simple case study [0.29998889086656577]
  Preparation of low-energy quantum many-body states has a wide range of applications in quantum information processing and condensed matter physics. Quantum cooling algorithms offer a promising alternative to other methods based on variational and adiabatic principles, or on dissipative state preparation.
  arXiv  Detail & Related papers  (2025-03-31T17:19:12Z)
• Multiview Point Cloud Registration Based on Minimum Potential Energy for Free-Form Blade Measurement [39.73816112194715]
  We propose a novel global registration method that is based on the minimum potential energy (MPE) method to address these problems. The proposed algorithm outperforms the other global methods in terms of both accuracy and noise resistance.
  arXiv  Detail & Related papers  (2025-02-11T16:30:14Z)
• Accelerated zero-order SGD under high-order smoothness and overparameterized regime [79.85163929026146]
  We present a novel gradient-free algorithm to solve convex optimization problems. Such problems are encountered in medicine, physics, and machine learning. We provide convergence guarantees for the proposed algorithm under both types of noise.
  arXiv  Detail & Related papers  (2024-11-21T10:26:17Z)
• Faster WIND: Accelerating Iterative Best-of-$N$ Distillation for LLM Alignment [81.84950252537618]
  This paper reveals a unified game-theoretic connection between iterative BOND and self-play alignment. We establish a novel framework, WIN rate Dominance (WIND), with a series of efficient algorithms for regularized win rate dominance optimization.
  arXiv  Detail & Related papers  (2024-10-28T04:47:39Z)
• Quasiparticle cooling algorithms for quantum many-body state preparation [0.050412210071344554]
  We develop a kinetic theory framework to describe quasiparticle cooling dynamics, and employ it to compare the efficiency of different cooling algorithms. This work establishes quasiparticle cooling algorithms as a practical, robust method for many-body state preparation on near-term quantum processors.
  arXiv  Detail & Related papers  (2024-04-18T13:31:30Z)
• Optimized Noise Suppression for Quantum Circuits [0.40964539027092917]
  Crosstalk noise is a severe error source in, e.g., cross-resonance based superconducting quantum processors. Intrepid programming algorithm extends previous work on optimized qubit routing by swap insertion. We evaluate the proposed method by characterizing crosstalk noise for two chips with up to 127 qubits.
  arXiv  Detail & Related papers  (2024-01-12T07:34:59Z)
• Layering and subpool exploration for adaptive Variational Quantum Eigensolvers: Reducing circuit depth, runtime, and susceptibility to noise [0.0]
  Adaptive variational quantum eigensolvers (ADAPT-VQEs) are promising candidates for simulations of strongly correlated systems. Recent efforts have been directed towards compactifying, or layering, their ansatz circuits. We show that layering leads to an improved noise resilience with respect to amplitude-damping and dephasing noise.
  arXiv  Detail & Related papers  (2023-08-22T18:00:02Z)
• Error-aware Quantization through Noise Tempering [43.049102196902844]
  Quantization-aware training (QAT) optimize model parameters with respect to the end task while simulating quantization error. In this work, we incorporate exponentially decaying quantization-error-aware noise together with a learnable scale of task loss gradient to approximate the effect of a quantization operator. Our method obtains state-of-the-art top-1 classification accuracy for uniform (non mixed-precision) quantization, out-performing previous methods by 0.5-1.2% absolute.
  arXiv  Detail & Related papers  (2022-12-11T20:37:50Z)
• Multiple Kernel Clustering with Dual Noise Minimization [56.009011016367744]
  Multiple kernel clustering (MKC) aims to group data by integrating complementary information from base kernels. In this paper, we rigorously define dual noise and propose a novel parameter-free MKC algorithm by minimizing them. We observe that dual noise will pollute the block diagonal structures and incur the degeneration of clustering performance, and C-noise exhibits stronger destruction than N-noise.
  arXiv  Detail & Related papers  (2022-07-13T08:37:42Z)
• Noise-Assisted Variational Quantum Thermalization [4.118741675173778]
  Variational circuits have been proposed for simulating thermal states on quantum computers. We propose a new algorithm for thermal state preparation by exploiting the noise of quantum circuits. We show that the ability for our algorithm to learn the thermal state strongly depends on the temperature.
  arXiv  Detail & Related papers  (2021-11-06T18:24:01Z)
• An Accelerated Variance-Reduced Conditional Gradient Sliding Algorithm for First-order and Zeroth-order Optimization [111.24899593052851]
  Conditional gradient algorithm (also known as the Frank-Wolfe algorithm) has recently regained popularity in the machine learning community. ARCS is the first zeroth-order conditional gradient sliding type algorithms solving convex problems in zeroth-order optimization. In first-order optimization, the convergence results of ARCS substantially outperform previous algorithms in terms of the number of gradient query oracle.
  arXiv  Detail & Related papers  (2021-09-18T07:08:11Z)
• Optimization and Noise Analysis of the Quantum Algorithm for Solving One-Dimensional Poisson Equation [17.65730040410185]
  We propose an efficient quantum algorithm for solving one-dimensional Poisson equation. We further develop this algorithm to make it closer to the real application on the noisy intermediate-scale quantum (NISQ) devices. We analyze the effect of common noise existing in the real quantum devices on our algorithm using the IBM Qiskit toolkit.
  arXiv  Detail & Related papers  (2021-08-27T09:44:41Z)
• Quadratic Unconstrained Binary Optimisation via Quantum-Inspired Annealing [58.720142291102135]
  We present a classical algorithm to find approximate solutions to instances of quadratic unconstrained binary optimisation. We benchmark our approach for large scale problem instances with tuneable hardness and planted solutions.
  arXiv  Detail & Related papers  (2021-08-18T09:26:17Z)
• Exploiting Higher Order Smoothness in Derivative-free Optimization and Continuous Bandits [99.70167985955352]
  We study the problem of zero-order optimization of a strongly convex function. We consider a randomized approximation of the projected gradient descent algorithm. Our results imply that the zero-order algorithm is nearly optimal in terms of sample complexity and the problem parameters.
  arXiv  Detail & Related papers  (2020-06-14T10:42:23Z)

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.