Exploiting Structure in Quantum Relative Entropy Programs
- URL: http://arxiv.org/abs/2407.00241v1
- Date: Fri, 28 Jun 2024 21:37:45 GMT
- Title: Exploiting Structure in Quantum Relative Entropy Programs
- Authors: Kerry He, James Saunderson, Hamza Fawzi,
- Abstract summary: We show how common structures arising from applications in quantum information theory can be exploited to improve the efficiency of solving quantum relative entropy programs.
Our numerical results show that these techniques improve computation times by up to several orders of magnitude, and allow previously intractable problems to be solved.
- Score: 6.281229317487581
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Quantum relative entropy programs are convex optimization problems which minimize a linear functional over an affine section of the epigraph of the quantum relative entropy function. Recently, the self-concordance of a natural barrier function was proved for this set. This has opened up the opportunity to use interior-point methods for nonsymmetric cone programs to solve these optimization problems. In this paper, we show how common structures arising from applications in quantum information theory can be exploited to improve the efficiency of solving quantum relative entropy programs using interior-point methods. First, we show that the natural barrier function for the epigraph of the quantum relative entropy composed with positive linear operators is optimally self-concordant, even when these linear operators map to singular matrices. Second, we show how we can exploit a catalogue of common structures in these linear operators to compute the inverse Hessian products of the barrier function more efficiently. This step is typically the bottleneck when solving quantum relative entropy programs using interior-point methods, and therefore improving the efficiency of this step can significantly improve the computational performance of the algorithm. We demonstrate how these methods can be applied to important applications in quantum information theory, including quantum key distribution, quantum rate-distortion, quantum channel capacities, and estimating the ground state energy of Hamiltonians. Our numerical results show that these techniques improve computation times by up to several orders of magnitude, and allow previously intractable problems to be solved.
Related papers
- 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) - Characterizing randomness in parameterized quantum circuits through expressibility and average entanglement [39.58317527488534]
Quantum Circuits (PQCs) are still not fully understood outside the scope of their principal application.
We analyse the generation of random states in PQCs under restrictions on the qubits connectivities.
We place a connection between how steep is the increase on the uniformity of the distribution of the generated states and the generation of entanglement.
arXiv Detail & Related papers (2024-05-03T17:32:55Z) - Efficient Quantum Circuits for Non-Unitary and Unitary Diagonal Operators with Space-Time-Accuracy trade-offs [1.0749601922718608]
Unitary and non-unitary diagonal operators are fundamental building blocks in quantum algorithms.
We introduce a general approach to implement unitary and non-unitary diagonal operators with efficient-adjustable-depth quantum circuits.
arXiv Detail & Related papers (2024-04-03T15:42:25Z) - Reliable optimization of arbitrary functions over quantum measurements [0.3902497155525132]
Given an arbitrary function of quantum measurements, how to obtain its optimal value is often considered as a basic yet important problem in various applications.
We propose reliable arbitrary functions over the space of quantum measurements by combining the so-called Gilbert's algorithm for convex optimization with certain algorithms.
arXiv Detail & Related papers (2023-02-15T09:07:15Z) - Efficient estimation of trainability for variational quantum circuits [43.028111013960206]
We find an efficient method to compute the cost function and its variance for a wide class of variational quantum circuits.
This method can be used to certify trainability for variational quantum circuits and explore design strategies that can overcome the barren plateau problem.
arXiv Detail & Related papers (2023-02-09T14:05:18Z) - Automatic and effective discovery of quantum kernels [43.702574335089736]
Quantum computing can empower machine learning models by enabling kernel machines to leverage quantum kernels for representing similarity measures between data.
We present a different approach, which employs optimization techniques, similar to those used in neural architecture search and AutoML.
The results obtained by testing our approach on a high-energy physics problem demonstrate that, in the best-case scenario, we can either match or improve testing accuracy with respect to the manual design approach.
arXiv Detail & Related papers (2022-09-22T16:42:14Z) - Orders of magnitude reduction in the computational overhead for quantum
many-body problems on quantum computers via an exact transcorrelated method [0.0]
We show that the Hamiltonian becomes non-Hermitian, posing problems for quantum algorithms based on the variational principle.
We overcome these limitations with the ansatz-based quantum imaginary time evolution algorithm.
Our work paves the way for the use of exact transcorrelated methods for the simulations of ab initio systems on quantum computers.
arXiv Detail & Related papers (2022-01-09T16:37:32Z) - Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state.
In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
arXiv Detail & Related papers (2021-12-27T21:15:35Z) - Quantum Causal Unravelling [44.356294905844834]
We develop the first efficient method for unravelling the causal structure of the interactions in a multipartite quantum process.
Our algorithms can be used to identify processes that can be characterized efficiently with the technique of quantum process tomography.
arXiv Detail & Related papers (2021-09-27T16:28:06Z) - Polynomial unconstrained binary optimisation inspired by optical
simulation [52.11703556419582]
We propose an algorithm inspired by optical coherent Ising machines to solve the problem of unconstrained binary optimization.
We benchmark the proposed algorithm against existing PUBO algorithms, and observe its superior performance.
The application of our algorithm to protein folding and quantum chemistry problems sheds light on the shortcomings of approxing the electronic structure problem by a PUBO problem.
arXiv Detail & Related papers (2021-06-24T16:39:31Z)
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.