Leonardo Banchi

Leonardo Banchi

Auto-generated profile, based on publicly available information

Leonardo Banchi

University of Florence

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
26 April 2017 in Nature Communications
Verified
Journal Article
Open access
PDF file
SPStefano Pirandola
Stefano Pirandola
RLRiccardo Laurenza
Riccardo Laurenza
Carlo OttavianiCarlo Ottaviani
Carlo Ottaviani
LBLeonardo Banchi
Leonardo Banchi
Quantum communications promises reliable transmission of quantum information, efficient distribution of entanglement and generation of completely secure keys. For all these tasks, we need to determine the optimal point-to-point rates that are achievable by two remote parties at the ends of a quantum channel, without restrictions on their local operations and classical communication, which can be unlimited and two-way. These two-way assisted capacities represent the ultimate rates that are reachable without quantum repeaters. Here, by constructing an upper bound based on the relative entropy of entanglement and devising a dimension-independent technique dubbed ‘teleportation stretching’, we establish these capacities for many fundamental channels, namely bosonic lossy channels, quantum-limited amplifiers, dephasing and erasure channels in arbitrary dimension. In particular, we exactly determine the fundamental rate-loss tradeoff affecting any protocol of quantum key distribution. Our findings set the limits of point-to-point quantum communications and provide precise and general benchmarks for quantum repeaters.

22 December 2015 in Physical Review Letters
Verified
Journal Article
Closed access
PDF file
LBLeonardo Banchi
Leonardo Banchi
SBSamuel L. Braunstein
Samuel L. Braunstein
SPStefano Pirandola
Stefano Pirandola
We derive a computable analytical formula for the quantum fidelity between two arbitrary multimode Gaussian states which is simply expressed in terms of their first- and second-order statistical moments. We also show how such a formula can be written in terms of symplectic invariants and used to derive closed forms for a variety of basic quantities and tools, such as the Bures metric, the quantum Fisher information, and various fidelity-based bounds. Our result can be used to extend the study of continuous-variable protocols, such as quantum teleportation and cloning, beyond the current one-mode or two-mode analyses, and paves the way to solve general problems in quantum metrology and quantum hypothesis testing with arbitrary multimode Gaussian resources.

9 February 2023 in Nature Reviews Physics
Verified
Journal Article
Closed access
PDF file
VGValentin Gebhart
Valentin Gebhart
RSRaffaele Santagati
Raffaele Santagati
AGAntonio Andrea Gentile
Antonio Andrea Gentile
EGErik M. Gauger
Erik M. Gauger
DCDavid Craig
David Craig
CBCristian Bonato
Cristian Bonato

22 January 2025 in Nature
Verified
Journal Article
Open access
PDF file
HRH. Aghaee Rad
H. Aghaee Rad
TAT. Ainsworth
T. Ainsworth
RAR. N. Alexander
R. N. Alexander
BAB. Altieri
B. Altieri
MAM. F. Askarani
M. F. Askarani
YZY. Zhang
Y. Zhang
Photonics offers a promising platform for quantum computing1,2,3,4, owing to the availability of chip integration for mass-manufacturable modules, fibre optics for networking and room-temperature operation of most components. However, experimental demonstrations are needed of complete integrated systems comprising all basic functionalities for universal and fault-tolerant operation5. Here we construct a (sub-performant) scale model of a quantum computer using 35 photonic chips to demonstrate its functionality and feasibility. This combines all the primitive components as discrete, scalable rack-deployed modules networked over fibre-optic interconnects, including 84 squeezers6 and 36 photon-number-resolving detectors furnishing 12 physical qubit modes at each clock cycle. We use this machine, which we name Aurora, to synthesize a cluster state7 entangled across separate chips with 86.4 billion modes, and demonstrate its capability of implementing the foliated distance-2 repetition code with real-time decoding. The key building blocks needed for universality and fault tolerance are demonstrated: heralded synthesis of single-temporal-mode non-Gaussian resource states, real-time multiplexing actuated on photon-number-resolving detection, spatiotemporal cluster-state formation with fibre buffers, and adaptive measurements implemented using chip-integrated homodyne detectors with real-time single-clock-cycle feedforward. We also present a detailed analysis of our architecture’s tolerances for optical loss, which is the dominant and most challenging hurdle to crossing the fault-tolerant threshold. This work lays out the path to cross the fault-tolerant threshold and scale photonic quantum computers to the point of addressing useful applications.

1 November 2021 in PRX Quantum
Verified
Journal Article
Open access
PDF file
LBLeonardo Banchi
Leonardo Banchi
JPJason Pereira
Jason Pereira
SPStefano Pirandola
Stefano Pirandola
Quantum classification and hypothesis testing (state and channel discrimination) are two tightly related subjects, the main difference being that the former is data driven: how to assign to quantum states ρ(x) the corresponding class c (or hypothesis) is learnt from examples during training, where x can be either tunable experimental parameters or classical data “embedded” into quantum states. Does the model generalize? This is the main question in any data-driven strategy, namely the ability to predict the correct class even of previously unseen states. Here we establish a link between quantum classification and quantum information theory, by showing that the accuracy and generalization capability of quantum classifiers depend on the (Rényi) mutual information I(C:Q) and I2(X:Q) between the quantum state space Q and the classical parameter space X or class space C. Based on the above characterization, we then show how different properties of Q affect classification accuracy and generalization, such as the dimension of the Hilbert space, the amount of noise, and the amount of neglected information from X via, e.g., pooling layers. Moreover, we introduce a quantum version of the information bottleneck principle that allows us to explore the various trade-offs between accuracy and generalization. Finally, in order to check our theoretical predictions, we study the classification of the quantum phases of an Ising spin chain, and we propose the variational quantum information bottleneck method to optimize quantum embeddings of classical data to favor generalization.

5 June 2020 in Science Advances
Verified
Journal Article
Open access
PDF file
LBLeonardo Banchi
Leonardo Banchi
MFMark Fingerhuth
Mark Fingerhuth
TBTomas Babej
Tomas Babej
CIChristopher Ing
Christopher Ing
JAJuan Miguel Arrazola
Juan Miguel Arrazola
Photonic quantum devices called Gaussian Boson Samplers can be programmed to predict molecular docking configurations.