Optimal fidelity in implementing Grover's search algorithm on open quantum system

• URL: http://arxiv.org/abs/2303.01759v1
• Date: Fri, 3 Mar 2023 07:48:26 GMT
• Title: Optimal fidelity in implementing Grover's search algorithm on open quantum system
• Authors: Nilanjana Chanda and Rangeet Bhattacharyya
• Abstract summary: We investigate the fidelity of Grover's search algorithm by implementing it on an open quantum system. We include the environmental effects on the system dynamics by using a recently reported fluctuation-regulated quantum master equation (FRQME) We find that the fidelity is found to depend on both the drive-induced dissipative terms and the relaxation terms.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We investigate the fidelity of Grover's search algorithm by implementing it on an open quantum system. In particular, we study with what accuracy one can estimate that the algorithm would deliver the searched state. In reality, every system has some influence of its environment. We include the environmental effects on the system dynamics by using a recently reported fluctuation-regulated quantum master equation (FRQME). The FRQME indicates that in addition to the regular relaxation due to system-environment coupling, the applied drive also causes dissipation in the system dynamics. As a result, the fidelity is found to depend on both the drive-induced dissipative terms and the relaxation terms and we find that there exists a competition between them, leading to an optimum value of the drive amplitude for which the fidelity becomes maximum. For efficient implementation of the search algorithm, precise knowledge of this optimum drive amplitude is essential.

Related papers

• MG-Net: Learn to Customize QAOA with Circuit Depth Awareness [51.78425545377329]
  Quantum Approximate Optimization Algorithm (QAOA) and its variants exhibit immense potential in tackling optimization challenges. The requisite circuit depth for satisfactory performance is problem-specific and often exceeds the maximum capability of current quantum devices. We introduce the Mixer Generator Network (MG-Net), a unified deep learning framework adept at dynamically formulating optimal mixer Hamiltonians.
  arXiv  Detail & Related papers  (2024-09-27T12:28:18Z)
• Amplitude Amplification and Estimation using a Floquet system [0.0]
  The quantum kicked rotor (QKR) is a fundamental model of time-dependent quantum chaos. It is used to implement a quantum algorithm to perform unstructured search.
  arXiv  Detail & Related papers  (2024-06-19T04:44:12Z)
• Quantum search in a non-Markovian environment [0.0]
  This thesis explores the effects and origins of a 'noise with memory' in the dynamics of an open quantum system. We show that a Markovian-correlated noise can enhance the efficiency of the algorithm over a time correlation-less noise. A 'collisional model' is constructed that exactly reproduces the noisy evolution of the open system.
  arXiv  Detail & Related papers  (2023-03-23T13:17:42Z)
• Quantum bandit with amplitude amplification exploration in an adversarial environment [9.563657204041682]
  We propose a quantum-inspired bandit learning approach for the learning-and-adapting-based offloading problem. A new action update strategy and novel probabilistic action selection are adopted, provoked by the amplitude amplification and collapse in quantum theory. The proposed algorithm is generalized, via the devised mapping, for better learning weight adjustments on favourable/unfavourable actions.
  arXiv  Detail & Related papers  (2022-08-15T12:40:34Z)
• Optimal quantum control via genetic algorithms for quantum state engineering in driven-resonator mediated networks [68.8204255655161]
  We employ a machine learning-enabled approach to quantum state engineering based on evolutionary algorithms. We consider a network of qubits -- encoded in the states of artificial atoms with no direct coupling -- interacting via a common single-mode driven microwave resonator. We observe high quantum fidelities and resilience to noise, despite the algorithm being trained in the ideal noise-free setting.
  arXiv  Detail & Related papers  (2022-06-29T14:34:00Z)
• Large-Scale Sequential Learning for Recommender and Engineering Systems [91.3755431537592]
  In this thesis, we focus on the design of an automatic algorithms that provide personalized ranking by adapting to the current conditions. For the former, we propose novel algorithm called SAROS that take into account both kinds of feedback for learning over the sequence of interactions. The proposed idea of taking into account the neighbour lines shows statistically significant results in comparison with the initial approach for faults detection in power grid.
  arXiv  Detail & Related papers  (2022-05-13T21:09:41Z)
• Continuous-Time Fitted Value Iteration for Robust Policies [93.25997466553929]
  Solving the Hamilton-Jacobi-Bellman equation is important in many domains including control, robotics and economics. We propose continuous fitted value iteration (cFVI) and robust fitted value iteration (rFVI) These algorithms leverage the non-linear control-affine dynamics and separable state and action reward of many continuous control problems.
  arXiv  Detail & Related papers  (2021-10-05T11:33:37Z)
• Self-Guided Quantum State Learning for Mixed States [7.270980742378388]
  The salient features of our algorithm are efficient $O left( d3 right)$ post-processing in the infidelity dimension $d$ of the state. A higher resilience against measurement noise makes our algorithm suitable for noisy intermediate-scale quantum applications.
  arXiv  Detail & Related papers  (2021-06-11T04:40:26Z)
• Robust Value Iteration for Continuous Control Tasks [99.00362538261972]
  When transferring a control policy from simulation to a physical system, the policy needs to be robust to variations in the dynamics to perform well. We present Robust Fitted Value Iteration, which uses dynamic programming to compute the optimal value function on the compact state domain. We show that robust value is more robust compared to deep reinforcement learning algorithm and the non-robust version of the algorithm.
  arXiv  Detail & Related papers  (2021-05-25T19:48:35Z)
• Plug-And-Play Learned Gaussian-mixture Approximate Message Passing [71.74028918819046]
  We propose a plug-and-play compressed sensing (CS) recovery algorithm suitable for any i.i.d. source prior. Our algorithm builds upon Borgerding's learned AMP (LAMP), yet significantly improves it by adopting a universal denoising function within the algorithm. Numerical evaluation shows that the L-GM-AMP algorithm achieves state-of-the-art performance without any knowledge of the source prior.
  arXiv  Detail & Related papers  (2020-11-18T16:40:45Z)
• Incoherent quantum algorithm dynamics of an open system with near-term devices [0.0]
  Hybrid quantum-classical algorithms are among the most promising systems to implement quantum computing. We investigate a quantum dynamics algorithm for the density matrix obeying the von Neumann equation. We consider the dynamics of the ensemble-averaged of disordered quantum systems.
  arXiv  Detail & Related papers  (2020-08-12T14:22:42Z)

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.