Alessandro Bisio

Dr. Alessandro Bisio

Department of Physics, University of Pavia, via Bassi 6, 27100 Pavia, Italy
orcid

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
25 March 2010 in Physical Review A
Verified
Journal Article
Closed access
ABAlessandro Bisio
Alessandro Bisio
GCGiulio Chiribella
Giulio Chiribella
Giacomo Mauro D'ArianoGiacomo Mauro D'Ariano
Giacomo Mauro D'Ariano
SFStefano Facchini
Stefano Facchini
Paolo PerinottiPaolo Perinotti
Paolo Perinotti
We address the problem of learning an unknown unitary transformation from a finite number of examples. The problem consists in finding the learning machine that optimally emulates the examples, thus reproducing the unknown unitary with maximum fidelity. Learning a unitary is equivalent to storing it in the state of a quantum memory (the memory of the learning machine) and subsequently retrieving it. We prove that, whenever the unknown unitary is drawn from a group, the optimal strategy consists in a parallel call of the available uses followed by a ``measure-and-rotate'' retrieving. Differing from the case of quantum cloning, where the incoherent ``measure-and-prepare'' strategies are typically suboptimal, in the case of learning the ``measure-and-rotate'' strategy is optimal even when the learning machine is asked to reproduce a single copy of the unknown unitary. We finally address the problem of the optimal inversion of an unknown unitary evolution, showing also in this case the optimality of the ``measure-and-rotate'' strategies and applying our result to the optimal approximate realignment of reference frames for quantum communication.

8 May 2019 in Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
Verified
Journal Article
Closed access
ABAlessandro Bisio
Alessandro Bisio
Paolo PerinottiPaolo Perinotti
Paolo Perinotti
Higher-order quantum theory is an extension of quantum theory where one introduces transformations whose input and output are transformations, thus generalizing the notion of channels and quantum operations. The generalization then goes recursively, with the construction of a full hierarchy of maps of increasingly higher order. The analysis of special cases already showed that higher-order quantum functions exhibit features that cannot be tracked down to the usual circuits, such as indefinite causal structures, providing provable advantages over circuital maps. The present treatment provides a general framework where this kind of analysis can be carried out in full generality. The hierarchy of higher-order quantum maps is introduced axiomatically with a formulation based on the language of types of transformations. Complete positivity of higher-order maps is derived from the general admissibility conditions instead of being postulated as in previous approaches. The recursive characterization of convex sets of maps of a given type is used to prove equivalence relations between different types. The axioms of the framework do not refer to the specific mathematical structure of quantum theory, and can therefore be exported in the context of any operational probabilistic theory.

3 May 2019 in Physical Review Letters
Verified
Journal Article
Closed access
PDF file
MSMichal Sedlák
Michal Sedlák
ABAlessandro Bisio
Alessandro Bisio
MZMario Ziman
Mario Ziman
We address the question of quantum memory storage for quantum dynamics. In particular, we design an optimal protocol for N→1 probabilistic storage and retrieval of unitary channels on d-dimensional quantum systems. If we access the unknown unitary gate only N times, the optimal success probability of perfect single-use retrieval is N/(N−1+d2). The derived size of the memory system exponentially improves the known upper bound on the size of the program register needed for probabilistic programmable quantum processors. Our results are closely related to probabilistic perfect alignment of reference frames and probabilistic port-based teleportation.

1 March 2015 in Annals of Physics
Verified
Journal Article
Closed access
ABAlessandro Bisio
Alessandro Bisio
Giacomo Mauro D'ArianoGiacomo Mauro D'Ariano
Giacomo Mauro D'Ariano
ATAlesssandro Tosini
Alesssandro Tosini

9 January 2009 in Physical Review Letters
Verified
Journal Article
Closed access
PDF file
ABAlessandro Bisio
Alessandro Bisio
GCGiulio Chiribella
Giulio Chiribella
Giacomo Mauro D'ArianoGiacomo Mauro D'Ariano
Giacomo Mauro D'Ariano
SFS. Facchini
S. Facchini
Paolo PerinottiPaolo Perinotti
Paolo Perinotti
We present the first complete optimization of quantum tomography, for states, positive operator value measures, and various classes of transformations, for arbitrary prior ensemble and arbitrary representation, giving corresponding feasible experimental schemes in terms of random Bell measurements.

3 November 2009 in IEEE Journal of Selected Topics in Quantum Electronics
Verified
Journal Article
Closed access
ABAlessandro Bisio
Alessandro Bisio
GCGiulio Chiribella
Giulio Chiribella
Giacomo Mauro D'ArianoGiacomo Mauro D'Ariano
Giacomo Mauro D'Ariano
SFStefano Facchini
Stefano Facchini
Paolo PerinottiPaolo Perinotti
Paolo Perinotti
The present short review article illustrates the latest theoretical developments on quantum tomography, regarding general optimization methods for both data processing and setup. The basic theoretical tool is the informationally complete measurement. The optimization theory for the setup is based on the new theoretical approach of quantum combs.