Searcharxiv⌕ Search

arXiv subjects

Vittorio Giovannetti

Publications and source records attributed to Vittorio Giovannetti.

At least 19 recordsLinked to original sources

Fer expansion of driven spins: closed-form recursion and no-go theorems for termination

The Fer expansion factorizes the propagator of a driven quantum system into exponentials of time-integrated effective Hamiltonians, which govern the evolution left over by the previous factors. Every truncation is unitary, and adding a factor squares the size of the remainder, but each effective Hamiltonian is an infinite series of nested commutators of the previous one. For $\mathfrak{su}(2)$, in every representation, from qubits to spins of any dimension, we represent the effective Hamiltonians by time-dependent vectors in $\mathbb{R}^3$ and resum this series exactly. The result is a closed map from one vector to the next, in which the infinite series reduces to the previous vector crossed once and twice with its time integral, weighted by elementary functions. Using this map, we address the question of when the expansion can be stopped after finitely many factors. This is possible whenever the leftover evolution is known in closed form, for instance when the effective Hamiltonian commutes with itself at all times or precesses about a fixed axis with constant angular velocity. We prove that, for real-analytic drives, neither happens beyond the first factor unless the first exponential is already exact. Stopping the expansion therefore yields no new exactly solvable drives.

quant-ph↗

Fer expansion converges almost twice as far as Magnus for qubits

The Fer expansion writes the propagator of a time-dependent Hamiltonian as a product of unitary exponentials whose error decreases doubly exponentially with the number of factors, while the Magnus expansion improves by one order at a time. Its convergence, however, was guaranteed only below a radius of about $2.6058$, smaller than the Magnus radius $π$. We establish a guaranteed convergence threshold of about $6.2106$, or $1.98\,π$, for a qubit. This is almost twice the optimal universal Magnus threshold $π$; the bound on a single Fer step is sharp, while the exact convergence radius remains open.

quant-ph↗

Classical Capacity of Single-Mode Bosonic Gaussian Channels

The classical capacity of a noisy optical channel is the maximum rate at which information can be transmitted reliably, given a constraint on the mean input energy. For the ubiquitous bosonic Gaussian channels, which include standard models of loss and noise in fibre and free-space optical links, determining this rate requires addressing whether entanglement between channel uses or non-Gaussian signals can outperform Gaussian encodings. More precisely, the question is whether the energy-constrained Holevo information is additive across arbitrarily many channel uses and coincides with its Gaussian counterpart. We answer these fundamental questions in the affirmative for every single-mode bosonic Gaussian channel at every input energy. Namely, we prove that independently prepared Gaussian states with Gaussian-distributed random displacements achieve the capacity, including in the low-energy regime where squeezing the signals competes with encoding information in their displacement. Our proof connects an entanglement inequality to a sharp, additive lower bound on output entropy. We then characterise communication above capacity: under a strict total photon-number cutoff, the probability of correct decoding decreases exponentially with the number of channel uses, and we derive explicit bounds on the decay exponent. When only the mean photon number is constrained, a simple energy-rescaling formula determines exactly the entire asymptotic rate--error trade-off: the capacity at mean photon number $N$ and allowed average decoding error $ε$ equals the vanishing-error capacity at mean photon number $N/(1-ε)$. Together, these results identify the ultimate limits of classical communication for some of the most fundamental models of optical communication.

quant-ph↗

Energy-constrained two-way capacities of the pure-loss channel

We determine the two-way quantum and secret-key capacities of the pure-loss channel under an average input photon-number constraint. For transmissivity $η$ and photon budget $N$, both capacities equal $g(N)-g((1-η)N)$, where $g$ is the entropy of a thermal state. This coincides with the rate achieved by the known reverse coherent information of a two-mode squeezed vacuum. Our result provides the last missing capacity formula for the celebrated pure-loss channel, completing the picture of bosonic quantum communication under pure loss.

quant-ph↗

Improved convergence radius of the Fer expansion for Hermitian generators

The Dyson series expands the propagator of a time-dependent Hamiltonian in powers of the Hamiltonian, but its truncations are in general not unitary. The Fer expansion writes the same propagator as an infinite product of matrix exponentials, each of them unitary, and its remainder decays doubly exponentially with the number of factors. Convergence, however, is guaranteed only within a finite radius: the time integral of the norm of the Hamiltonian must be smaller than $2$. This is the best value known to date. Here we improve it by about $30\%$, raising it to about $2.6058$. The result also holds for non-Hermitian Hamiltonians that are Hermitian with respect to a fixed metric.

quant-ph↗

Convex combinations of bosonic pure-loss channels

The pure-loss channel is a fundamental noise model for bosonic quantum platforms, characterised by a single parameter, the transmissivity. In realistic scenarios such as free-space quantum communication, the transmissivity fluctuates from one channel use to another, and the channel is a convex combination of pure-loss channels, known as a fading channel. Despite its practical relevance, its quantum Shannon theory has remained largely unexplored. Here we investigate degradability, anti-degradability, entanglement breakingness, and capacities of the fading channel. We prove that entanglement distribution and quantum key distribution can be achieved at a strictly positive rate over any fading channel that is not completely noisy. When the transmissivity takes a finite set of values, we determine the energy-unconstrained two-way quantum and secret-key capacities exactly, as the averages of those of the pure-loss components. We prove that thermal states, optimal for a broad class of static bosonic Gaussian channels, do not in general achieve the entanglement-assisted classical capacity of fading channels: for a binary fading model we derive the capacity-achieving state in closed form, and we exhibit channels for which non-Gaussian Fock-diagonal states strictly outperform every Gaussian encoding. For the quantum capacity, we give a simple sufficient condition on the transmissivity distribution under which weak thermal inputs yield a strictly positive rate. Outside this condition, we numerically identify parameter regions where no thermal input compatible with the energy constraint has a positive coherent information, while optimized non-Gaussian inputs do. For general fading distributions, we design an iterative variational algorithm to optimize the coherent and mutual information. Our work advances the study of quantum communication in the non-Gaussian regime.

quant-ph↗

Technical analysis of the Resource-efficient Quantum Walkers Quantum Random Access Memory

Quantum Random Access Memory (qRAM) is a critical component for achieving quantum advantage in algorithms ranging from database search to quantum machine learning. In a recently introduced model [arXiv:2508.02855], we proposed a resource-efficient qRAM architecture based on discrete-time quantum walkers. This article serves as a comprehensive technical follow-up, providing the full mathematical derivations, detailed protocol specifications, and in-depth resource analysis. Moreover, we extend the original proposal with novel techniques for the purpose of making the qRAM implementation more realistic. Our model resolves the primary drawbacks of leading qRAM proposals: it avoids the exponential number of active nodes $\mathcal{O}(2^n)$ required by the "Bucket Brigade" architecture by employing a number of quantum walkers that scales linearly with the address and message sizes, $n$ and $m$, respectively. Simultaneously, it overcomes the spatial bottlenecks of previous quantum-walker schemes by eliminating the need for multiple parallel trees. We propose two algorithmic paradigms: the long- and the short-range approaches, which differ by the length of interaction of the main routing gates employed in the qRAM. We formalize the routing, message-copy, and walker retrieval phases for both variants and we show how, while the long-range scheme employs controlled gates having a multitude of target systems, the short-range approach decomposes these interactions into sequences of 2- and 3-body local gates, which improves the architecture's feasibility for near-term experimental implementation. Finally, our comprehensive resource analysis confirms that the short-range approach achieves the optimal $\mathcal{O}(n+m)$ circuit depth. Within these two paradigms, we explore the potential of different types of quantum walkers, namely bosons, dual-rail qubits and four-level qudits.

quant-ph↗

Universal Entanglement Distillation

We present a universal entanglement distillation protocol that asymptotically achieves the distillable entanglement of any unknown bipartite state in a fixed finite dimension. That is, its ebit yield attains every rate below the optimum that would be available if the state were known, with vanishing trace-distance error. Our approach combines tomography by local operations and classical communication with an adaptive distillation routine, using a local robustness lemma to control finite-sample estimation errors. We also characterize worst-case distillation from a family of states: the optimal uniform rate is the minimum distillable entanglement on the family's closure. These results show that ignorance of the state need not incur an asymptotic rate penalty.

quant-ph↗

Exact quantum transport in non-Markovian open Gaussian systems

We build an exact framework to evaluate heat, energy, and particle transport between Gaussian reservoirs mediated by a quadratic quantum system. By combining full counting statistics with newly developed non-Markovian master equation approaches, we introduce an effective master equation whose solution can be used to generate arbitrary moments of the heat statistics for any number of reservoirs. This theory applies equally to fermionic and bosonic systems, holds at arbitrarily strong coupling, and resolves out-of-equilibrium transient dynamics determined by the system's initial state. In the steady-state, weak-coupling limit, we recover results analogous to those of the well-known Landauer-Büttiker formalism. We conclude our discussion by demonstrating an application of the method to a prototypical fermionic system. Our results uncover a regime of transient negative heat conductance contingent upon the initial system preparation, providing a clear signature of non-trivial out-of-equilibrium dynamics.

quant-ph↗

Temporal information processing on a 4,500-qubit quantum annealer

Quantum machine learning could uncover statistical structure beyond the reach of classical models, but this requires quantum models large and expressive enough to be useful and cheap enough to read out. Most approaches optimize many quantum parameters and are thus limited by expensive training loops. Here we report a quantum machine-learning model implemented on a programmable superconducting quantum annealer that processes temporal data at large scale using up to 4,500 qubits-the largest quantum machine-learning experiment performed to date. Following the quantum reservoir computing paradigm, the untrained native many-body dynamics generated by reverse annealing is directly used to process temporal data. We prove that the interactions produced during annealing are indispensable-a non-interacting reservoir retains no memory of its input. We evaluate our model experimentally on standard memory benchmarks and demonstrate that it can successfully forecast chaotic time series. These results establish quantum annealers as a scalable platform for large-scale quantum machine learning.

quant-ph↗

The entropic coherence is a necessary resource for non-energy preserving gates

We consider the task of implementing non-energy preserving gates (NEPG) on a finite-dimensional system S via an energy-preserving interaction with an external battery B. We prove that the entropic coherence of the battery (an instance of the relative entropy of resource) is a necessary resource for this task, and find a lower bound on its minimum amount that has to be present in the battery to be able to implement NEPGs with a fixed desired precision. An immediate corollary is that any finite-dimensional battery is doomed to a certain minimal error in the gate implementation task. Moreover, under assumptions on the density of energy levels in the battery Hamiltonian, our main results imply additional lower bounds on the minimal amount of energy and quantum Fisher information required to implement any gate. We show that these bounds can be stronger than the universal bounds previously established in the literature.

quant-ph↗

Energetics in daemonic work extraction protocols via non-ideal QND-energy measurement

We address the problem of extracting work from a quantum system assisted by a quantum non-demolition (QND) energy measurement. When a perfect QND measurement can be performed and an auxiliary zero-temperature bath is available, the full energy of the quantum state can in principle be extracted even without any prior information on the input state. Owing to the presence of a zero-temperature bath, this is achieved at no energetic cost for the measurement process itself. On the contrary, here we consider what happens when the same protocol is implemented in non-ideal scenarios, specifically when the auxiliary bath has a finite temperature. In this case, not only is it impossible to extract the entire energy from the system, but the measurement strategy also acquires a non-zero energetic cost, accounting for both the interaction between system and measurement apparatus, and the corresponding Landauer erasure cost. We quantitatively assess the performance of these work-extraction protocols, both in absolute terms and through the so-called daemonic net gain, which explicitly includes the energetic cost of the measurement. We rigorously prove that, when access to a thermal bath is allowed in the extraction protocol, the daemonic net gain is always non-positive for any temperature of the auxiliary bath. Conversely, when only unitary operations are considered, the daemonic net gain can attain positive values. We further discuss these different figures of merit by analyzing a paradigmatic example for a single qubit system.

quant-ph↗

Quantum error correction with global control

Reaching fault tolerance means scaling qubit counts by orders of magnitude, a jump that conventional superconducting architectures cannot sustain without solving the so-called `wiring problem'. Global control sidesteps this bottleneck, but implementing quantum error correction (QEC) on previously proposed global architectures incurs extremely steep overhead costs, due to the need for separate correction procedures for the computational and auxiliary qubits that comprise the global device. We resolve this by introducing the first globally-controlled architecture with zero qubit overhead. Every physical qubit is a computational qubit, and thus, every qubit is protected under a single error correcting scheme. We identify a class of cyclic stabilizer codes realizable through global iSWAP and single-qubit gates, yielding QEC thresholds nearly seven orders of magnitude larger than previous estimates for globally-controlled arrays. We further show these thresholds improve systematically as the global architecture is augmented with a limited amount of local measurement sites, demonstrating a trade-off between wiring simplicity and fault-tolerant performance.

quant-ph↗

Mitigating quantum decoherence via global optimal control

We show that global optimal control can drastically suppress the impact of decoherence in globally driven superconducting quantum computing architectures, taking as a prototype a recently proposed quasi-two-dimensional ladder geometry. Using a tensor-network-based approach, we quantify how amplitude-damping and dephasing channels degrade the flow of quantum information along the ladder and the fidelity of one- and two-qubit gate operations. We then demonstrate that shaping the global drive compresses the gate sequences by an order of magnitude in time, restoring high gate fidelities. We stress that this mitigation is far from trivial: in a globally driven processor, dissipation acts on every physical qubit---including those outside the logical register that sustain the surrounding ordered phases---so its impact cannot be suppressed by protecting an isolated subsystem, and is instead overcome purely through the temporal shaping of the global drive.

quant-ph↗

Bosonic quantum communication beyond the thermal threshold

The quantum capacity of the bosonic thermal attenuator, which is given by the regularization of its coherent information, is unknown. The seminal work of Holevo and Werner established in 1999 the standard one-use lower bound obtained from input thermal states. We first prove that this long-standing lower bound is the exact supremum over all single-mode Gaussian states and then show that, crucially, a non-Gaussian state can do better. As a consequence, we prove positivity of the quantum capacity in a parameter region where the channel is not antidegradable, yet its coherent information optimized over single-mode Gaussian states vanishes. For example, with one thermal photon in the environment and at transmissivity $η=0.8$, the coherent information is non-positive for every single-mode Gaussian input. We give an explicit rank-two non-Gaussian state, supported on only six Fock levels, whose coherent information is certified to be at least $4.7\times10^{-4}$ qubits per channel use. This short witness is far from numerically optimal: a numerical optimization over fixed non-Gaussian families reaches at least $8.4\times 10^{-3}$ qubits per channel use at the same point. More generally, at $ν=1$, using non-Gaussian inputs we certify positivity of the coherent information, and therefore of the quantum capacity, down to $η=0.7841$; by contrast, the channel is antidegradable, and hence has zero quantum capacity, for $η\leq0.75$. Overall, our work identifies new high-noise regimes in which bosonic quantum communication is possible.

quant-ph↗

Cavity-mediated probabilistic magic $T$-gate injection

Non-Clifford gates are a necessary resource for universal quantum computation, yet their fault-tolerant implementation typically relies on magic-state distillation, which incurs significant overhead in qubit count and circuit depth. In this work, we propose a probabilistic cavity-based magic-state injection protocol. Our scheme exploits controlled atom-cavity interactions and conditional measurements to probabilistically prepare an effective magic state encoded in the first two level Fock subspace of a single cavity mode, achieving a success probability of $0.74$ per attempt, independent of the target magic phase. The cavity-encoded magic state is subsequently injected into a computational atom via a teleportation-based protocol mediated by dressed-state transitions, requiring only Clifford operations and a single auxiliary atom for readout. We show that all required operations -- state preparation, two-qubit exchange gates, and projective measurement -- can be implemented with experimentally available techniques in Rydberg atom-cavity platforms. We further discuss how the scheme can in principle be adapted to operate at the logical level, where collective Rydberg interactions and optical nonlinearities provide a route toward cavity-mediated $T$-gate injection directly into code-encoded qubits.

quant-ph↗

Controlling the non-Markovianity of quantum Brownian motion

We analyze the exact dynamics of a generalized quantum Brownian motion model, employing Gaussian master equation methods. We demonstrate that, by modulating the relative weights of specific interaction channels, we can control the degree of non-Markovianity of the system, and induce a transition from non-Markovian to Markovian regimes. The non-Markovianity of the evolution is formally characterized by leveraging the Gorini--Kossakowski--Sudarshan--Lindblad theorem and by employing quantitative measures of information backflow. Finally, we clarify the physical mechanism behind the phenomenology of this model, thereby providing a systematic platform for environment engineering through the strategic tuning of dissipation channels.

quant-ph↗

Generalized multilevel amplitude damping channels and their thermodynamic performances

We introduce a new class of quantum channels, the Generalized Multilevel Amplitude Damping (GMAD) channels, to model noise and decoherence effects in a qudit coupled to a thermal environment. The degradation of energetic resources under GMADs is investigated by evaluating work functionals and ergotropic capacitances, with particular attention to the coherent and incoherent contributions to ergotropy, for which we introduce new quantifiers. Our analysis sheds light on how to optimally prepare a qudit in a thermal environment in order to preserve its value from the perspective of work extraction, and reveals several counterintuitive phenomena: the ergotropic capacitance of a GMAD channel is not monotonic in the temperature of the environment; moreover, iterating the map can lead to crossings between ergotropic functionals at different temperatures, indicating the presence of a Markovian Mpemba effect.

quant-ph↗