Katalog der UB Siegen
/ tqo / members / sentis /

Gael Sentís

Gael Sentís Postdoc

Room: B-110

Phone: +49 271 740 3799


See also arxiv

Gael Sentís
Dealing with ignorance: universal discrimination, learning and quantum correlations

The problem of discriminating the state of a quantum system among a number of hypothetical states is usually addressed under the assumption that one has perfect knowledge of the possible states of the system. In this thesis, I analyze the role of the prior information available in facing such problems, and consider scenarios where the information regarding the possible states is incomplete. In front of a complete ignorance of the possible states' identity, I discuss a quantum "programmable" discrimination machine for qubit states that accepts this information as input programs using a quantum encoding, rather than as a classical description. The optimal performance of these machines is studied for general qubit states when several copies are provided, in the schemes of unambiguous, minimum-error, and error-margin discrimination. Then, this type of automation in discrimination tasks is taken further. By realizing a programmable machine as a device that is trained through quantum information to perform a specific task, I propose a quantum "learning" machine for classifying qubit states that does not require a quantum memory to store the qubit programs and, nevertheless, performs as good as quantum mechanics permits. Such learning machine thus allows for several optimal uses with no need for retraining. A similar learning scheme is also discussed for coherent states of light. I present it in the context of the readout of a classical memory by means of classically correlated coherent signals, when these are produced by an imperfect source. I show that, in this case, the retrieval of information stored in the memory can be carried out more accurately when fully general quantum measurements are used. Finally, as a transversal topic, I propose an efficient algorithmic way of decomposing any quantum measurement into convex combinations of simpler (extremal) measurements.


Alex Monràs, Gael Sentís and Peter Wittek
Inductive Supervised Quantum Learning
Phys. Rev. Lett. 118 , 190503 ( 2017 ), arXiv:1605.07541

In supervised learning, an inductive learning algorithm extracts general rules from observed training instances, then the rules are applied to test instances. We show that this splitting of training and application arises naturally, in the classical setting, from a simple independence requirement with a physical interpretation of being nonsignaling. Thus, two seemingly different definitions of inductive learning happen to coincide. This follows from the properties of classical information that break down in the quantum setup. We prove a quantum de Finetti theorem for quantum channels, which shows that in the quantum case, the equivalence holds in the asymptotic setting, that is, for large numbers of test instances. This reveals a natural analogy between classical learning protocols and their quantum counterparts, justifying a similar treatment, and allowing us to inquire about standard elements in computational learning theory, such as structural risk minimization and sample complexity.

Gael Sentís, Emilio Bagan, John Calsamiglia, Giulio Chiribella and Ramon Muñoz-Tapia
Quantum Change Point
Phys. Rev. Lett. 117 , 150502 ( 2016 ), arXiv:1605.01916

Sudden changes are ubiquitous in nature. Identifying them is crucial for a number of applications in biology, medicine, and social sciences. Here we take the problem of detecting sudden changes to the quantum domain. We consider a source that emits quantum particles in a default state, until a point where a mutation occurs that causes the source to switch to another state. The problem is then to find out where the change occurred. We determine the maximum probability of correctly identifying the change point, allowing for collective measurements on the whole sequence of particles emitted by the source. Then, we devise online strategies where the particles are measured individually and an answer is provided as soon as a new particle is received. We show that these online strategies substantially underperform the optimal quantum measurement, indicating that quantum sudden changes, although happening locally, are better detected globally.

Gael Sentís, Christopher Eltschka and Jens Siewert
Quantitative bound entanglement in two-qutrit states
Phys. Rev. A 94 , 020302(R) ( 2016 ), arXiv:1609.01698

Among the many facets of quantum correlations, bound entanglement has remained one the most enigmatic phenomena, despite the fact that it was discovered in the early days of quantum information. Even its detection has proven to be difficult, let alone its precise quantitative characterization. In this work, we present the exact quantification of entanglement for a two-parameter family of highly symmetric two-qutrit mixed states, which contains a sizable part of bound entangled states. We achieve this by explicitly calculating the convex-roof extensions of the linear entropy as well as the concurrence for every state within the family. Our results provide a benchmark for future quantitative studies of bipartite entanglement in higher-dimensional systems.

Gael Sentís, Christopher Eltschka, Otfried Gühne, Marcus Huber and Jens Siewert
Quantifying entanglement of maximal dimension in bipartite mixed states
Phys. Rev. Lett. 117 , 190502 ( 2016 ), arXiv:1605.09783

The Schmidt coefficients capture all entanglement properties of a pure bipartite state and therefore determine its usefulness for quantum information processing. While the quantification of the corresponding properties in mixed states is important both from a theoretical and a practical point of view, it is considerably more difficult, and methods beyond estimates for the concurrence are elusive. In particular this holds for a quantitative assessment of the most valuable resource, the maximum possible Schmidt number of an arbitrary mixed state. We derive a framework for lower bounding the appropriate measure of entanglement, the so-called G-concurrence, through few local measurements. Moreover, we show that these bounds have relevant applications also for multipartite states.

Gael Sentís, Madalin Guta and Gerardo Adesso
Quantum learning of coherent states
EPJ Quantum Technology 2 , 17 ( 2015 ), arXiv:1410.8700

We develop a quantum learning scheme for binary discrimination of coherent states of light. This is a problem of technological relevance for the reading of information stored in a digital memory. In our setting, a coherent light source is used to illuminate a memory cell and retrieve its encoded bit by determining the quantum state of the reflected signal. We consider a situation where the amplitude of the states produced by the source is not fully known, but instead this information is encoded in a large training set comprising many copies of the same coherent state. We show that an optimal global measurement, performed jointly over the signal and the training set, provides higher successful identification rates than any learning strategy based on first estimating the unknown amplitude by means of Gaussian measurements on the training set, followed by an adaptive discrimination procedure on the signal. By considering a simplified variant of the problem, we argue that this is the case even for non-Gaussian estimation measurements. Our results show that, even in absence of entanglement, collective quantum measurements yield an enhancement in the readout of classical information, which is particularly relevant in the operating regime of low-energy signals.

G. Sentís, E. Bagan, J. Calsamiglia and R. Muñoz-Tapia
Programmable discrimination with an error margin
Phys. Rev. A 88 , 052304 ( 2013 ), arXiv:1308.1378

The problem of optimally discriminating between two completely unknown qubit states is generalized by allowing an error margin. It is visualized as a device---the programmable discriminator---with one data and two program ports, each fed with a number of identically prepared qubits---the data and the programs. The device aims at correctly identifying the data state with one of the two program states. This scheme has the unambiguous and the minimum-error schemes as extremal cases, when the error margin is set to zero or it is sufficiently large, respectively. Analytical results are given in the two situations where the margin is imposed on the average error probability---weak condition---or it is imposed separately on the two probabilities of assigning the state of the data to the wrong program---strong condition. It is a general feature of our scheme that the success probability rises sharply as soon as a small error margin is allowed, thus providing a significant gain over the unambiguous scheme while still having high confidence results.

G. Sentís, B. Gendra, S. D. Bartlett and A. C. Doherty
Decomposition of any quantum measurement into extremals
J. Phys. A: Math. Theor. 46 , 375302 ( 2013 ), arXiv:1306.0349

We design an efficient and constructive algorithm to decompose any generalized quantum measurement into a convex combination of extremal measurements. We show that if one allows for a classical post-processing step only extremal rank-1 POVMs are needed. For a measurement with $N$ elements on a $d$-dimensional space, our algorithm will decompose it into at most $(N-1)d+1$ extremals, whereas the best previously known upper bound scaled as $d^2$. Since the decomposition is not unique, we show how to tailor our algorithm to provide particular types of decompositions that exhibit some desired property.

G. Sentís, J. Calsamiglia, R. Munoz-Tapia and E. Bagan
Robust optimal quantum learning without quantum memory
Sci. Rep. 2 , 708 ( 2012 ), arXiv:1208.0663

A quantum learning machine for binary classification of qubit states that does not require quantum memory is introduced and shown to perform with the minimum error rate allowed by quantum mechanics for any size of the training set. This result is shown to be robust under (an arbitrary amount of) noise and under (statistical) variations in the composition of the training set, provided it is large enough. This machine can be used an arbitrary number of times without retraining. Its required classical memory grows only logarithmically with the number of training qubits, while its excess risk decreases as the inverse of this number, and twice as fast as the excess risk of an estimate-and-discriminate machine, which estimates the states of the training qubits and classifies the data qubit with a discrimination protocol tailored to the obtained estimates.

G. Sentís, E. Bagan, J. Calsamiglia and R. Munoz-Tapia
Multi-copy programmable discrimination of general qubit states
Phys. Rev. A 82 , 042312 ( 2010 ), arXiv:1007.5497

Quantum state discrimination is a fundamental primitive in quantum statistics where one has to correctly identify the state of a system that is in one of two possible known states. A programmable discrimination machine performs this task when the pair of possible states is not a priori known, but instead the two possible states are provided through two respective program ports. We study optimal programmable discrimination machines for general qubit states when several copies of states are available in the data or program ports. Two scenarios are considered: one in which the purity of the possible states is a priori known, and the fully universal one where the machine operates over generic mixed states of unknown purity. We find analytical results for both, the unambiguous and minimum error, discrimination strategies. This allows us to calculate the asymptotic performance of programmable discrimination machines when a large number of copies is provided, and to recover the standard state discrimination and state comparison values as different limiting cases.