Optimization in quantum metrology and entanglement theory using semidefinite programming

• URL: http://arxiv.org/abs/2206.02820v2
• Date: Mon, 03 Mar 2025 18:42:26 GMT
• Title: Optimization in quantum metrology and entanglement theory using semidefinite programming
• Authors: Árpád Lukács, Róbert Trényi, Tamás Vértesi, Géza Tóth,
• Abstract summary: We discuss efficient methods to optimize the metrological performance over local Hamiltonians in a bipartite quantum system.<n>We present the quantum Fisher information in a bilinear form and maximize it by an iterative see-saw (ISS) method.<n>We consider a number of other problems in quantum information theory that can be solved in a similar manner.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We discuss efficient methods to optimize the metrological performance over local Hamiltonians in a bipartite quantum system. For a given quantum state, our methods find the best local Hamiltonian for which the state outperforms separable states the most from the point of view of quantum metrology. We show that this problem can be reduced to maximize the quantum Fisher information over a certain set of Hamiltonians. We present the quantum Fisher information in a bilinear form and maximize it by an iterative see-saw (ISS) method, in which each step is based on semidefinite programming. We also solve the problem with the method of moments that works very well for smaller systems. We consider a number of other problems in quantum information theory that can be solved in a similar manner. For instance, we determine the bound entangled quantum states that maximally violate the Computable Cross Norm-Realignment (CCNR) criterion. Our approach is one of the efficient methods that can be applied for an optimization of the unitary dynamics in quantum metrology, the other methods being, for example, machine learning, variational quantum circuits, or neural networks. The advantage of our method is the fast and robust convergence due to the simple mathematical structure of the approach.

Related papers

• Optimizing random local Hamiltonians by dissipation [44.99833362998488]
  We prove that a simplified quantum Gibbs sampling algorithm achieves a $Omega(frac1k)$-fraction approximation of the optimum. Our results suggest that finding low-energy states for sparsified (quasi)local spin and fermionic models is quantumly easy but classically nontrivial.
  arXiv  Detail & Related papers  (2024-11-04T20:21:16Z)
• Quantum Natural Stochastic Pairwise Coordinate Descent [6.187270874122921]
  Quantum machine learning through variational quantum algorithms (VQAs) has gained substantial attention in recent years. This paper introduces the quantum natural pairwise coordinate descent (2QNSCD) optimization method. We develop a highly sparse unbiased estimator of the novel metric tensor using a quantum circuit with gate complexity $Theta(1)$ times that of the parameterized quantum circuit and single-shot quantum measurements.
  arXiv  Detail & Related papers  (2024-07-18T18:57:29Z)
• Coherence generation with Hamiltonians [44.99833362998488]
  We explore methods to generate quantum coherence through unitary evolutions. This quantity is defined as the maximum derivative of coherence that can be achieved by a Hamiltonian. We identify the quantum states that lead to the largest coherence derivative induced by the Hamiltonian.
  arXiv  Detail & Related papers  (2024-02-27T15:06:40Z)
• Truncation technique for variational quantum eigensolver for Molecular Hamiltonians [0.0]
  variational quantum eigensolver (VQE) is one of the most promising quantum algorithms for noisy quantum devices. We propose a physically intuitive truncation technique that starts the optimization procedure with a truncated Hamiltonian. This strategy allows us to reduce the required number of evaluations for the expectation value of Hamiltonian on a quantum computer.
  arXiv  Detail & Related papers  (2024-02-02T18:45:12Z)
• A Unitary Weights Based One-Iteration Quantum Perceptron Algorithm for Non-Ideal Training Sets [15.53642141764581]
  A novel efficient quantum perceptron algorithm based on unitary weights is proposed. The example validation of quantum gates H, S, T, CNOT, Toffoli, Fredkin shows that our algorithm can accurately implement arbitrary quantum gates within one iteration.
  arXiv  Detail & Related papers  (2023-09-23T15:24:41Z)
• Applicability of Measurement-based Quantum Computation towards Physically-driven Variational Quantum Eigensolver [17.975555487972166]
  Variational quantum algorithms are considered one of the most promising methods for obtaining near-term quantum advantages. The roadblock to developing quantum algorithms with the measurement-based quantum computation scheme is resource cost. We propose an efficient measurement-based quantum algorithm for quantum many-body system simulation tasks, called measurement-based Hamiltonian variational ansatz (MBHVA)
  arXiv  Detail & Related papers  (2023-07-19T08:07:53Z)
• Guidable Local Hamiltonian Problems with Implications to Heuristic Ansätze State Preparation and the Quantum PCP Conjecture [0.0]
  We study 'Merlinized' versions of the recently defined Guided Local Hamiltonian problem. These problems do not have a guiding state provided as a part of the input, but merely come with the promise that one exists. We show that guidable local Hamiltonian problems for both classes of guiding states are $mathsfQCMA$-complete in the inverse-polynomial precision setting.
  arXiv  Detail & Related papers  (2023-02-22T19:00:00Z)
• Sparse random Hamiltonians are quantumly easy [105.6788971265845]
  A candidate application for quantum computers is to simulate the low-temperature properties of quantum systems. This paper shows that, for most random Hamiltonians, the maximally mixed state is a sufficiently good trial state. Phase estimation efficiently prepares states with energy arbitrarily close to the ground energy.
  arXiv  Detail & Related papers  (2023-02-07T10:57:36Z)
• Constrained Optimization via Quantum Zeno Dynamics [23.391640416533455]
  We introduce a technique that uses quantum Zeno dynamics to solve optimization problems with multiple arbitrary constraints, including inequalities. We show that the dynamics of quantum optimization can be efficiently restricted to the in-constraint subspace on a fault-tolerant quantum computer.
  arXiv  Detail & Related papers  (2022-09-29T18:00:40Z)
• Clifford Circuit Initialisation for Variational Quantum Algorithms [0.0]
  We present an initialisation method for variational quantum algorithms applicable to intermediate scale quantum computers. We numerically demonstrate the effectiveness of the technique, and how it depends on Hamiltonian structure, number of qubits and circuit depth.
  arXiv  Detail & Related papers  (2022-07-04T15:59:33Z)
• Canonically consistent quantum master equation [68.8204255655161]
  We put forth a new class of quantum master equations that correctly reproduce the state of an open quantum system beyond the infinitesimally weak system-bath coupling limit. Our method is based on incorporating the knowledge of the reduced steady state into its dynamics.
  arXiv  Detail & Related papers  (2022-05-25T15:22:52Z)
• Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver [89.80359585967642]
  Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
  arXiv  Detail & Related papers  (2022-03-15T09:46:45Z)
• Quantum Optimization of Maximum Independent Set using Rydberg Atom Arrays [39.76254807200083]
  We experimentally investigate quantum algorithms for solving the Maximum Independent Set problem. We find the problem hardness is controlled by the solution degeneracy and number of local minima. On the hardest graphs, we observe a superlinear quantum speedup in finding exact solutions.
  arXiv  Detail & Related papers  (2022-02-18T19:00:01Z)
• Average-case Speedup for Product Formulas [69.68937033275746]
  Product formulas, or Trotterization, are the oldest and still remain an appealing method to simulate quantum systems. We prove that the Trotter error exhibits a qualitatively better scaling for the vast majority of input states. Our results open doors to the study of quantum algorithms in the average case.
  arXiv  Detail & Related papers  (2021-11-09T18:49:48Z)
• Near-term Efficient Quantum Algorithms for Entanglement Analysis [5.453850739960517]
  Entanglement plays a crucial role in quantum physics and is the key resource in quantum information processing. This work proposes three near-term efficient algorithms exploiting the hybrid quantum-classical technique to address this difficulty.
  arXiv  Detail & Related papers  (2021-09-22T15:15:58Z)
• Quantum mean value approximator for hard integer value problems [19.4417702222583]
  We show that an optimization can be improved substantially by using an approximation rather than the exact expectation. Together with efficient classical sampling algorithms, a quantum algorithm with minimal gate count can thus improve the efficiency of general integer-value problems.
  arXiv  Detail & Related papers  (2021-05-27T13:03:52Z)
• Iterative Quantum Assisted Eigensolver [0.0]
  We provide a hybrid quantum-classical algorithm for approximating the ground state of a Hamiltonian. Our algorithm builds on the powerful Krylov subspace method in a way that is suitable for current quantum computers.
  arXiv  Detail & Related papers  (2020-10-12T12:25:16Z)
• Roadmap for quantum simulation of the fractional quantum Hall effect [0.0]
  A major motivation for building a quantum computer is that it provides a tool to efficiently simulate strongly correlated quantum systems. In this work, we present a detailed roadmap on how to simulate a two-dimensional electron gas---cooled to absolute zero and pierced by a strong magnetic field---on a quantum computer.
  arXiv  Detail & Related papers  (2020-03-05T10:17:21Z)

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.