Quantum process discrimination with restricted strategies
- URL: http://arxiv.org/abs/2104.09038v3
- Date: Tue, 14 Dec 2021 01:29:47 GMT
- Title: Quantum process discrimination with restricted strategies
- Authors: Kenji Nakahira
- Abstract summary: We present a general formulation of the task of finding the maximum success probability for discriminating quantum processes.
We derive necessary and sufficient conditions for an optimal restricted strategy to be optimal within the set of all strategies.
This finding has the potential to provide a deeper insight into the discrimination performance of various restricted strategies.
- Score: 2.030567625639093
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The discrimination of quantum processes, including quantum states, channels,
and superchannels, is a fundamental topic in quantum information theory. It is
often of interest to analyze the optimal performance that can be achieved when
discrimination strategies are restricted to a given subset of all strategies
allowed by quantum mechanics. In this paper, we present a general formulation
of the task of finding the maximum success probability for discriminating
quantum processes as a convex optimization problem whose Lagrange dual problem
exhibits zero duality gap. The proposed formulation can be applied to any
restricted strategy. We also derive necessary and sufficient conditions for an
optimal restricted strategy to be optimal within the set of all strategies. We
provide a simple example in which the dual problem given by our formulation can
be much easier to solve than the original problem. We also show that the
optimal performance of each restricted process discrimination problem can be
written in terms of a certain robustness measure. This finding has the
potential to provide a deeper insight into the discrimination performance of
various restricted strategies.
Related papers
- Fully-Optimized Quantum Metrology: Framework, Tools, and Applications [8.98216737402976]
The tutorial consists of a pedagogic introduction to the background and mathematical tools of optimal quantum metrology.
The approach can identify the optimal precision for different sets of strategies, including parallel, sequential, quantum SWITCH-enhanced, causally superposed, and generic indefinite-causal-order strategies.
arXiv Detail & Related papers (2024-09-11T07:36:40Z) - Quantum algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
The anticipated applications of quantum computers span across science and industry.
We present a survey of several potential application areas of quantum algorithms.
We outline the challenges and opportunities in each area in an "end-to-end" fashion.
arXiv Detail & Related papers (2023-10-04T17:53:55Z) - Quantum Gate Optimization for Rydberg Architectures in the Weak-Coupling
Limit [55.05109484230879]
We demonstrate machine learning assisted design of a two-qubit gate in a Rydberg tweezer system.
We generate optimal pulse sequences that implement a CNOT gate with high fidelity.
We show that local control of single qubit operations is sufficient for performing quantum computation on a large array of atoms.
arXiv Detail & Related papers (2023-06-14T18:24:51Z) - 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) - Optimal Strategies of Quantum Metrology with a Strict Hierarchy [3.706744588098214]
We identify the ultimate precision limit of different families of strategies, including the parallel, the sequential, and the indefinite-causal-order strategies.
We provide an efficient algorithm that determines an optimal strategy within the family of strategies under consideration.
arXiv Detail & Related papers (2022-03-18T06:14:56Z) - 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) - Experimental multi-state quantum discrimination through a Quantum
network [63.1241529629348]
We have experimentally implemented two discrimination schemes in a minimum-error scenario based on a receiver featured by a network structure and a dynamical processing of information.
The first protocol achieves binary optimal discrimination, while the second one provides a novel approach to multi-state quantum discrimination, relying on the dynamical features of the network-like receiver.
arXiv Detail & Related papers (2021-07-21T09:26:48Z) - Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions.
Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
arXiv Detail & Related papers (2021-06-24T20:16:02Z) - Generalized quantum process discrimination problems [2.538209532048866]
We study a broad class of quantum process discrimination problems that can handle many optimization strategies.
Our task is to find a discrimination strategy, which may be adaptive and/or entanglement-assisted, that maximizes a given objective function.
We show that if a problem has a certain symmetry and at least one optimal solution exists, then there also exists an optimal solution with the same type of symmetry.
arXiv Detail & Related papers (2021-04-20T04:46:57Z) - Simple upper and lower bounds on the ultimate success probability for
discriminating arbitrary finite-dimensional quantum processes [2.538209532048866]
We present a simple upper bound on the ultimate success probability for discriminating arbitrary quantum processes.
In the special case of multi-shot channel discrimination, it can be shown that the ultimate success probability increases by at most a constant factor determined by the given channels.
We also present a lower bound based on Bayesian updating, which has a low computational cost.
arXiv Detail & Related papers (2020-12-27T01:14:23Z) - Space-efficient binary optimization for variational computing [68.8204255655161]
We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem.
We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
arXiv Detail & Related papers (2020-09-15T18:17:27Z)
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.