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 maximizing 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 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. 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. We also 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 criterion.
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 maximizing 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 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. 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. We also 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 criterion.
Quantum metrology is a rapidly developing branch of quantum technologies. While various theories have been established on quantum metrology for Markovian processes, i.e., quantum channel estimation, quantum metrology for non-Markovian processes is much less explored. In this Letter, we establish a general framework of non-Markovian quantum metrology. For any parametrized non-Markovian process on a finite-dimensional system, we derive a formula for the maximal amount of quantum Fisher information that can be extracted from it by an optimally controlled probe state. In addition, we design an algorithm that evaluates this quantum Fisher information via semidefinite programming. We apply our framework to noisy frequency estimation, where we find that the optimal performance of quantum metrology is better in the non-Markovian scenario than in the Markovian scenario and explore the possibility of efficient sensing via simple variational circuits.
Many fundamental problems in quantum information theory can be formulated as optimization tasks over quantum states and measurements. While the convex structure of quantum theory often enables powerful semidefinite programming formulations, a major challenge persists: the exponential growth of Hilbert space dimension with system size. This dissertation discusses techniques to address these and related obstacles across several core problems in quantum information. We first study optimization over separable quantum states. Such problems are typically NP-hard and standard semidefinite programming hierarchies suffer from the curse of dimensionality. We introduce a hybrid algorithm that leverages a quantum co-processor to reduce the effective dimension of the problem. While several existing approaches provide only a numerical bound on the optimal value, our method is guaranteed to return an explicit feasible solution: a valid separable state, even in instances where it is not optimal. We apply this framework to approximate the minimum separable energy of many-body Hamiltonians, define an entanglement measure for their ground spaces, and demonstrate numerical scalability to systems of up to 28 qubits. We next consider the general Bayes framework, as introduced by Helstrom, for state discrimination when, instead of a classical description of the candidate states, one has access to their source code: the quantum circuit that prepares them. We show that the typical semidefinite program for the discrimination problem can be reformulated in terms of the Gram matrix of these states, reducing the variable dimensions from dL to NL, where d is the Hilbert space dimension, N is the number of candidate states, and L is the number of possible guesses. Importantly, we further introduce a quantum pre-processing procedure which efficiently constructs the reduced problem from the source code, enabling our method to operate directly on quantum data. We consider two applications. First, we characterize the optimal identifications for quantum changepoint problems under several reward structures whose associated discrimination problems were previously computationally inaccessible. Second, we consider a quantum error classification problem and show how our reduction makes it tractable for systems of hundreds of qubits. We also analyze structural measurement strategies. As a counterpart to the well-known pretty good measurement for minimum-error state discrimination, we introduce the pretty bad measurement for the exclusion variant, in which the goal is to identify a state that was not sent, rather than to identify the one that was, and prove that both are guaranteed to perform at least as well as blind guessing in their respective objectives. Finally, we consider evaluating Boolean functions under severe memory constraints and prove that a simple local "greedy" measurement strategy is globally optimal precisely for affine Boolean functions, while more generally achieving at least the square of the optimal global success probability. Together, these results demonstrate that high-dimensional quantum optimization problems often admit hidden structure enabling dimension reduction, hybrid computation, and provable approximation guarantees.
The problem of reconstructing a quantum channel from a sample of classical data is considered. When the total fidelity can be represented as a ratio of two quadratic forms (e.g., in the case of mapping a mixed state to a pure state, projective operators, unitary learning, and others), Semidefinite Programming (SDP) can be applied to solve the fidelity optimization problem with respect to the Choi matrix. A remarkable feature of SDP is that the optimization is convex, which allows the problem to be efficiently solved by a variety of numerical algorithms. We have tested several commercially available SDP solvers, all of which allowed for the reconstruction of quantum channels of different forms. A notable feature is that the Kraus rank of the obtained quantum channel typically comprises less than a few percent of its maximal possible value. This suggests that a relatively small Kraus rank quantum channel is typically sufficient to describe experimentally observed classical data. The theory was also applied to the problem of reconstructing projective operators from data. Finally, we discuss a classical computational model based on quantum channel transformation, performed and calculated on a classical computer, possibly hardware-optimized.
We consider bipartite entangled states that cannot outperform separable states in any linear interferometer. Then, we show that these states can still be more useful metrologically than separable states if several copies of the state are provided or an ancilla is added to the quantum system. We present a general method to find the local Hamiltonian for which a given quantum state performs the best compared to separable states. We obtain analytically the optimal Hamiltonian for some quantum states with a high symmetry. We show that all bipartite entangled pure states outperform separable states in metrology. Some potential applications of the results are also suggested.
We study optimization programs given by a bilinear form over noncommutative variables subject to linear inequalities. Problems of this form include the entangled value of two-prover games, entanglement-assisted coding for classical channels, and quantum-proof randomness extractors. We introduce an asymptotically converging hierarchy of efficiently computable semidefinite programming (SDP) relaxations for this quantum optimization. This allows us to give upper bounds on the quantum advantage for all of these problems. Compared to previous work of Pironio, Navascués, and Acín [SIAM J. Optim., 20 (2010), pp. 2157--2180], our hierarchy has additional constraints. By means of examples, we illustrate the importance of these new constraints both in practice and for analytical properties. Moreover, this allows us to give a hierarchy of SDP outer approximations for the completely positive semidefinite cone introduced by Laurent and Piovesan.
We propose a sufficient entanglement criterion for the multipartite systems based on quantum Fisher information. It complements the well-established positive partial transpose criterion in the sense that it is also able to detect bound entangled states. Moreover, it improves the well-known upper bound on the quantum Fisher information of separable multiqudit states introduced by Toth et al. [G. Toth and T. Vertesi, Phys. Rev. Lett. 120, 020506 (2018)] and hence detects a greater number of metrologically useful entangled states. This criterion is formulated as a simple inequality which must be fulfilled by the quantum Fisher information of separable states of multipartite systems. Violation of this inequality by a state reveals its entanglement and accordingly confirms its usefulness for quantum metrology. The efficiency of this criterion for detection of entanglement is illustrated through some examples.