arXiv subjects

Marco Fanizza

Publications and source records attributed to Marco Fanizza.

36 records · Page 2Linked to original sources

arXiv2025

Optical fibres with memory effects and their quantum communication capacities

The development of quantum repeaters poses significant challenges in terms of cost and maintenance, prompting the exploration of alternative approaches for achieving long-distance quantum communication. In the absence of quantum repeaters and under the memoryless (iid) approximation, it has been established that some fundamental quantum communication tasks are impossible if the transmissivity of an optical fibre falls below a known critical value, resulting in a severe constraint on the achievable distance for quantum communication. However, if the memoryless assumption does not hold -- e.g. when input signals are separated by a sufficiently short time interval -- the validity of this limitation is put into question. In this paper we introduce a model of optical fibre that can describe memory effects for long transmission lines. We then solve its quantum capacity, two-way quantum capacity, and secret-key capacity exactly. By doing so, we show that -- due to the memory cross-talk between the transmitted signals -- reliable quantum communication is attainable even for highly noisy regimes where it was previously considered impossible. As part of our solution, we find the critical time interval between subsequent signals below which quantum communication, two-way entanglement distribution, and quantum key distribution become achievable.

quant-ph↗

arXiv2024

Low-ground/High ground capacity regions analysis for Bosonic Gaussian Channels

We present a comprehensive characterization of the interconnections between single-mode, phaseinsensitive Gaussian Bosonic Channels resulting from channel concatenation. This characterization enables us to identify, in the parameter space of these maps, two distinct regions: low-ground and high-ground. In the low-ground region, the information capacities are smaller than a designated reference value, while in the high-ground region, they are provably greater. As a direct consequence, we systematically outline an explicit set of upper bounds for the quantum and private capacity of these maps, which combine known upper bounds and composition rules, improving upon existing results.

quant-ph↗

arXiv2023

Ultimate limits for quickest quantum change-point detection

Detecting abrupt changes in data streams is crucial because they are often triggered by events that have important consequences if left unattended. Quickest change point detection has become a vital sequential analysis primitive that aims at designing procedures that minimize the expected detection delay of a change subject to a bounded expected false alarm time. We put forward the quantum counterpart of this fundamental primitive on streams of quantum data. We give a lower-bound on the mean minimum delay when the expected time of a false alarm is asymptotically large, under the most general quantum detection strategy, which is given by a sequence of adaptive collective (potentially weak) measurements on the growing string of quantum data. In addition, we give particular strategies based on repeated measurements on independent blocks of samples, that asymptotically attain the lower-bound, and thereby establish the ultimate quantum limit for quickest change point detection. Finally, we discuss online change point detection in quantum channels.

quant-ph↗

arXiv2023

Testing identity of collections of quantum states: sample complexity analysis

We study the problem of testing identity of a collection of unknown quantum states given sample access to this collection, each state appearing with some known probability. We show that for a collection of $d$-dimensional quantum states of cardinality $N$, the sample complexity is $O(\sqrt{N}d/ε^2)$, {with a matching lower bound, up to a multiplicative constant}. The test is obtained by estimating the mean squared Hilbert-Schmidt distance between the states, thanks to a suitable generalization of the estimator of the Hilbert-Schmidt distance between two unknown states by Bădescu, O'Donnell, and Wright (https://dl.acm.org/doi/10.1145/3313276.3316344).

quant-ph↗

arXiv2023

Quantum theory in finite dimension cannot explain every general process with finite memory

Arguably, the largest class of stochastic processes generated by means of a finite memory consists of those that are sequences of observations produced by sequential measurements in a suitable generalized probabilistic theory (GPT). These are constructed from a finite-dimensional memory evolving under a set of possible linear maps, and with probabilities of outcomes determined by linear functions of the memory state. Examples of such models are given by classical hidden Markov processes, where the memory state is a probability distribution, and at each step it evolves according to a non-negative matrix, and hidden quantum Markov processes, where the memory state is a finite dimensional quantum state, and at each step it evolves according to a completely positive map. Here we show that the set of processes admitting a finite-dimensional explanation do not need to be explainable in terms of either classical probability or quantum mechanics. To wit, we exhibit families of processes that have a finite-dimensional explanation, defined manifestly by the dynamics of explicitly given GPT, but that do not admit a quantum, and therefore not even classical, explanation in finite dimension. Furthermore, we present a family of quantum processes on qubits and qutrits that do not admit a classical finite-dimensional realization, which includes examples introduced earlier by Fox, Rubin, Dharmadikari and Nadkarni as functions of infinite dimensional Markov chains, and lower bound the size of the memory of a classical model realizing a noisy version of the qubit processes.

quant-ph↗

arXiv2022

Universal algorithms for quantum data learning

Operating quantum sensors and quantum computers would make data in the form of quantum states available for purely quantum processing, opening new avenues for studying physical processes and certifying quantum technologies. In this Perspective, we review a line of works dealing with measurements that reveal structural properties of quantum datasets given in the form of product states. These algorithms are universal, meaning that their performances do not depend on the reference frame in which the dataset is provided. Requiring the universality property implies a characterization of optimal measurements via group representation theory.

quant-ph↗

arXiv2022

Bounding the quantum capacity with flagged extensions

In this article we consider flagged extensions of convex combination of quantum channels, and find general sufficient conditions for the degradability of the flagged extension. An immediate application is a bound on the quantum $Q$ and private $P$ capacities of any channel being a mixture of a unitary map and another channel, with the probability associated to the unitary component being larger than $1/2$. We then specialize our sufficient conditions to flagged Pauli channels, obtaining a family of upper bounds on quantum and private capacities of Pauli channels. In particular, we establish new state-of-the-art upper bounds on the quantum and private capacities of the depolarizing channel, BB84 channel and generalized amplitude damping channel. Moreover, the flagged construction can be naturally applied to tensor powers of channels with less restricting degradability conditions, suggesting that better upper bounds could be found by considering a larger number of channel uses.

quant-ph↗

arXiv2021

Squeezing-enhanced communication without a phase reference

We study the problem of transmitting classical information using quantum Gaussian states on a family of phase-noise channels with a finite decoherence time, such that the phase-reference is lost after $m$ consecutive uses of the transmission line. This problem is relevant for long-distance communication in free space and optical fiber, where phase noise is typically considered as a limiting factor. The Holevo capacity of these channels is always attained with photon-number encodings, challenging with current technology. Hence for coherent-state encodings the optimal rate depends only on the total-energy distribution and we provide upper and lower bounds for all $m$, the latter attainable at low energies with on/off modulation and photodetection. We generalize this lower bound to squeezed-coherent encodings, exhibiting for the first time to our knowledge an unconditional advantage with respect to any coherent encoding for $m=1$ and a considerable advantage with respect to its direct coherent counterpart for $m>1$. This advantage is robust with respect to moderate attenuation, and persists in a regime where Fock encodings with up to two-photon states are also suboptimal. Finally, we show that the use of part of the energy to establish a reference frame is sub-optimal even at large energies. Our results represent a key departure from the case of phase-covariant Gaussian channels and constitute a proof-of-principle of the advantages of using non-classical, squeezed light in a motivated communication setting.

quant-ph↗

arXiv2021

Asymptotics of $\mathrm{SL}(2,\mathbb{C})$ coherent invariant tensors

We study the semiclassical limit of a class of invariant tensors for infinite-dimensional unitary representations of $\mathrm{SL}(2,\mathbb{C})$ of the principal series, corresponding to generalized Clebsch-Gordan coefficients with $n\geq3$ legs. We find critical configurations of the quantum labels with a power-law decay of the invariants. They describe 3d polygons that can be deformed into one another via a Lorentz transformation. This is defined viewing the edge vectors of the polygons are the electric part of bivectors satisfying a (frame-dependent) relation between their electric and magnetic parts known as $γ$-simplicity in the loop quantum gravity literature. The frame depends on the SU(2) spin labelling the basis elements of the invariants. We compute a saddle point approximation using the critical points and provide a leading-order approximation of the invariants. The power-law is universal if the SU(2) spins have their lowest value, and $n$-dependent otherwise. As a side result, we provide a compact formula for $γ$-simplicity in arbitrary frames. The results have applications to the current EPRL model, but also to future research aiming at going beyond the use of fixed time gauge in spin foam models.

gr-qc↗

arXiv2021

Estimating Quantum and Private capacities of Gaussian channels via degradable extensions

We present upper bounds on the quantum and private capacity of single-mode, phase-insentitive Bosonic Gaussian Channels based on degradable extensions. Our findings are state-of-the-art in the following parameter regions: low temperature and high transmissivity for the thermal attenuator, low temperature for additive Gaussian noise, high temperature and intermediate amplification for the thermal amplifier.

quant-ph↗

arXiv2021

An agnostic-Dolinar receiver for coherent states classification

We consider the problem of discriminating quantum states, where the task is to distinguish two different quantum states with a complete classical knowledge about them, and the problem of classifying quantum states, where the task is to distinguish two classes of quantum states where no prior classical information is available but a finite number of physical copies of each classes are given. In the case the quantum states are represented by coherent states of light, we identify intermediate scenarios where partial prior information is available. We evaluate an analytical expression for the minimum error when the quantum states are opposite and a prior on the amplitudes is known. Such a threshold is attained by complex POVM that involve highly non-linear optical procedure. A suboptimal procedure that can be implemented with current technology is presented that is based on a modification of the conventional Dolinar receiver. We study and compare the performance of the scheme under different assumptions on the prior information available.

quant-ph↗

arXiv2020

Beyond the swap test: optimal estimation of quantum state overlap

We study the estimation of the overlap between two unknown pure quantum states of a finite dimensional system, given $M$ and $N$ copies of each type. This is a fundamental primitive in quantum information processing that is commonly accomplished from the outcomes of $N$ swap-tests, a joint measurement on one copy of each type whose outcome probability is a linear function of the squared overlap. We show that a more precise estimate can be obtained by allowing for general collective measurements on all copies. We derive the statistics of the optimal measurement and compute the optimal mean square error in the asymptotic pointwise and finite Bayesian estimation settings. Besides, we consider two strategies relying on the estimation of one or both the states, and show that, although they are suboptimal, they outperform the swap test. In particular, the swap test is extremely inefficient for small values of the overlap, which become exponentially more likely as the dimension increases. Finally, we show that the optimal measurement is less invasive than the swap test and study the robustness to depolarizing noise for qubit states.

quant-ph↗

arXiv2020

SU(2) graph invariants, Regge actions and polytopes

We revisit the the large spin asymptotics of 15j symbols in terms of cosines of the 4d Euclidean Regge action, as derived by Barrett and collaborators using a saddle point approximation. We bring it closer to the perspective of area-angle Regge calculus and twisted geometries, and compute explicitly the Hessian and phase offsets. We then extend it to more general SU(2) graph invariants, showing that saddle points still exist and have a similar structure. For graphs dual to 4d polytopes we find again two distinct saddle points leading to a cosine asymptotic formula, however a conformal shape-mismatch is allowed by these configurations, and the asymptotic action is thus a generalisation of the Regge action. The allowed mismatch correspond to angle-matched twisted geometries, 3d polyhedral tessellations with adjacent faces matching areas and 2d angles, but not their diagonals. We study these geometries, identify the relevant subsets corresponding to 3d Regge data and flat polytope data, and discuss the corresponding Regge actions emerging in the asymptotics. Finally, we also provide the first numerical confirmation of the large spin asymptotics of the 15j symbol. We show that the agreement is accurate to the per cent level already at spins of order 10, and the next-to-leading order oscillates with the same frequency and same global phase.

gr-qc↗

arXiv2020

Numerical study of the Lorentzian Engle-Pereira-Rovelli-Livine spin foam amplitude

The Lorentzian EPRL spin foam amplitude for loop quantum gravity is a multi-dimensional non-compact integral of highly oscillating functions. Using a method based on the decomposition of Clebsch-Gordan coefficients for the unitary infinite-dimensional representations of SL(2,C) in terms of those of SU(2), we are able to provide for the first time numerical evaluations of the vertex amplitude. The values obtained support the asymptotic formula obtained by Barrett and collaborators with a saddle point approximation, showing, in particular, a power-law decay and oscillations related to the Regge action. The comparison offers a test of the efficiency of the method. Truncating the decomposition to the first few terms provides a qualitative matching of the power-law decay and oscillations. For vector and Euclidean Regge boundary data, a qualitative matching is obtained with just the first term, which corresponds to the simplified EPRL model. We comment on future developments for the numerics and extension to higher vertices. We complete our work with some analytic results: We provide an algorithm and explicit configurations for the different geometries that can arise as boundary data, and explain the geometric consequences of the decomposition used.

gr-qc↗

arXiv2020

Quantum flags, and new bounds on the quantum capacity of the depolarizing channel

A new bound for the quantum capacity of the $d$-dimensional depolarizing channels is presented. Our derivation makes use of a flagged extension of the map where the receiver obtains a copy of a state $σ_0$ whenever the messages are transmitted without errors, and a copy of a state $σ_1$ when instead the original state gets fully depolarized. By varying the overlap between the flags states, the resulting transformation nicely interpolates between the depolarizing map (when $σ_0=σ_1$), and the $d$-dimensional erasure channel (when $σ_0$ and $σ_1$ have orthogonal support). In our analysis we compute the product-state classical capacity, the entanglement assisted capacity and, under degradability conditions, the quantum capacity of the flagged channel. From this last result we get the upper bound for the depolarizing channel, which by a direct comparison appears to be tighter than previous available results for $d>2$, and for $d=2$ it is tighter in an intermediate regime of noise. In particular, in the limit of large $d$ values, our findings presents a previously unnoticed $\mathcal O(1)$ correction.

quant-ph↗

arXiv2019

Quantum-capacity bounds in spin-network communication channels

Using the Lieb-Robinson inequality and the continuity property of the quantum capacities in terms of the diamond norm, we derive an upper bound on the values that these capacities can attain in spin-network communication i.i.d. models of arbitrary topology. Differently from previous results we make no assumptions on the encoding mechanisms that the sender of the messages adopts in loading information on the network.

quant-ph↗

arXiv2019

Optimal Quantum Subtracting Machine

The impossibility of undoing a mixing process is analysed in the context of quantum information theory. The optimal machine to undo the mixing process is studied in the case of pure states, focusing on qubit systems. Exploiting the symmetry of the problem we parametrise the optimal machine in such a way that the number of parameters grows polynomially in the size of the problem. This simplification makes the numerical methods feasible. For simple but non-trivial cases we computed the analytical solution, comparing the performance of the optimal machine with other protocols.

quant-ph↗

arXiv2019

Optimal universal learning machines for quantum state discrimination

We consider the problem of correctly classifying a given quantum two-level system (qubit) which is known to be in one of two equally probable quantum states. We assume that this task should be performed by a quantum machine which does not have at its disposal a complete classical description of the two template states, but can only have partial prior information about their level of purity and mutual overlap. Moreover, similarly to the classical supervised learning paradigm, we assume that the machine can be trained by $n$ qubits prepared in the first template state and by $n$ more qubits prepared in the second template state. In this situation we are interested in the optimal process which correctly classifies the input qubit with the largest probability allowed by quantum mechanics. The problem is studied in its full generality for a number of different prior information scenarios and for an arbitrary size $n$ of the training data. Finite size corrections around the asymptotic limit $n\rightarrow \infty$ are also derived. When the states are assumed to be pure, with known overlap, the problem is also solved in the case of d-level systems.

quant-ph↗