arXiv subjects

Vittorio Giovannetti

Publications and source records attributed to Vittorio Giovannetti.

At least 19 recordsLinked to original sources

arXiv2026

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↗

arXiv2026

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↗

arXiv2026

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↗

arXiv2026

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↗

arXiv2026

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↗

arXiv2026

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↗

arXiv2026

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↗

arXiv2026

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↗

arXiv2026

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↗

arXiv2026

Quantum capacity analysis of finite-dimensional lossy channels

Traditionally, Quantum Information, and Quantum Communication specifically, have been focused on qubit-based architectures. Recent results, however, highlighted that higher dimensional architectures (qudit-based) may present advantages both in terms of communication and computation; a family of channels called Multi-level Amplitude Damping (MAD) channels, which are a possible qudit generalization of the well known Amplitude Damping Channels, is able to model energy decay processes that may happen during signal transmission. In this work, the Quantum Capacity of 4-dimensional MAD's is studied, relying on a technique for computing it even outside of degradable and antidegradable conditions. We also characterized the complete region of antidegradability and degradability in the parameter space for a generic d-dimensional MAD using both analytical and semi-numerical methods.

quant-ph↗

arXiv2026

Convex combinations of bosonic pure-loss channels

The pure-loss channel is a fundamental model for describing noise in bosonic quantum platforms. It is characterised by a single parameter, the transmissivity, which quantifies the fraction of the input energy that reaches the output of the channel. In realistic scenarios, however, such as free-space quantum communication, the transmissivity is not fixed but fluctuates from one channel use to another. In this setting, the overall channel is effectively described as a convex combination of pure-loss channels, known as a fading channel. Despite its practical relevance, the quantum Shannon theory of the fading channel has remained largely unexplored. Here, we address this gap, specifically investigating degradability, anti-degradability, entanglement breakingness, and capacities of the fading channel. Of particular relevance to practical quantum-internet applications, we prove that entanglement distribution and quantum key distribution can always be achieved at a strictly positive rate over any fading channel, no matter how noisy it is or how strongly the transmissivity fluctuates, provided the channel is not completely noisy. Moreover, we prove that thermal states, which are optimal for a broad class of static bosonic Gaussian channels, fail to achieve the entanglement-assisted classical capacity of fading channels: non-Gaussian Fock-diagonal states strictly outperform all Gaussian encodings. Most strikingly, we identify regimes where the coherent information of thermal inputs vanishes, while optimized non-Gaussian states achieve strictly positive values, thereby activating the channel for quantum communication. For a paradigmatic binary fading model we establish this result analytically, deriving the exact capacity-achieving state in closed form. For general fading distributions, we design an iterative variational algorithm to optimize the coherent and mutual information.

quant-ph↗

arXiv2026

Obstructions to universality in globally controlled qubit graphs

Global control offers a promising route to scalable quantum computing. A recent conjecture by Hu et al. (arXiv:2508.19075) proposes that any connected qubit graph equipped with global Ising-type interactions and tunable global transverse fields achieves universality if and only if an additional control field breaks every non-trivial automorphism of the underlying graph. We disprove this conjecture by exhibiting explicit seven- and nine-qubit counterexamples: connected graphs with trivial automorphism group for which the generated Lie algebra is nonetheless not universal. Our analysis reveals that graph automorphisms capture only part of the Hamiltonian symmetry structure: there exist hidden symmetries beyond the automorphism group of the graph. Additionally, in the case of non-trivial automorphism group, we find control terms which break the graph symmetries but are still not universal. These findings sharpen the characterization of universality for globally controlled quantum systems.

quant-ph↗

arXiv2026

A resource-efficient quantum-walker Quantum RAM

Efficient and coherent data retrieval and storage are essential for harnessing quantum algorithms' speedup. Such a fundamental task is addressed by a quantum Random Access Memory (qRAM). Despite their promising scaling properties, current qRAM proposals demand excessive resources and rely on operations beyond the capabilities of current hardware requirements, rendering their practical realization inefficient. We introduce a novel architecture that significantly reduces resource requirements while preserving optimal complexity scaling for quantum queries. Moreover, unlike previous proposals, our algorithm design leverages a simple, repeated operational block based exclusively on local unitary operations and short-range interactions between a limited number of quantum walkers traveling over a single binary tree. This novel approach not only simplifies experimental requirements by reducing the complexity of necessary operations but also enhances the architecture's scalability by ensuring a resource-efficient, modular design that maintains optimal quantum query performance.

quant-ph↗

arXiv2026

Global control via quantum actuators

We introduce the concept of quantum actuators as mediators for globally controlled quantum computation. Auxiliary quantum systems act as controllable elements that transiently store and release interaction energy, enabling the selective activation of multi-qubit gates within globally driven architectures. During compilation they remain passive and require no fine-grained local control, while during operation they allow for controlled activation of interactions and directional flow of quantum information. We provide a framework for embedding quantum actuators in globally controlled processors, showing how they enhance connectivity, enable long-range entangling operations, and bridge distant regions without increasing local control overhead. We discuss physical implementations and architectural strategies illustrating how these elements extend the capabilities of global-control schemes. A complementary interpretation in terms of quantum batteries naturally emerges, connecting global-control architectures with concepts from quantum thermodynamics while highlighting the distinct operational role of quantum actuators.

quant-ph↗

arXiv2026

Exact requirements for battery-assisted qubit gates

We consider the implementation of a unitary gate on a qubit system S via a global energy-preserving operation acting on S and an auxiliary system B that can be seen as a battery. We derive a simple, asymptotically exact expression for the implementation error as a function of the battery state, which we refer to as the it Unitary Defect. Remarkably, this quantity is independent of the specific gate being implemented, highlighting a universal property of the battery itself. We show that minimizing the unitary defect, under given physical constraints on the battery state, is mathematically equivalent to solving a Lagrangian optimization problem, often corresponding to finding the ground state of a one-dimensional quantum system. Using this mapping, we identify optimal battery states that achieve the highest precision under constraints on energy, squared energy, number of levels and Quantum Fisher Information. Overall, our results provide an efficient method for establishing bounds on the physical requirements needed to implement a unitary gate via energy-preserving operations and for determining the corresponding optimal protocols.

quant-ph↗

arXiv2026

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↗

arXiv2026

Quantum Channels on Graphs: a Resonant Tunneling Perspective

Quantum transport on structured networks is strongly influenced by interference effects, which can dramatically modify how information propagates through a system. We develop a quantum-information-theoretic framework for scattering on graphs in which a full network of connected scattering sites is treated as a quantum channel linking designated input and output ports. Using the Redheffer star product to construct global scattering matrices from local ones, we identify resonant concatenation, a nonlinear composition rule generated by internal back-reflections. In contrast to ordinary channel concatenation, resonant concatenation can suppress noise and even produce super-activation of the quantum capacity, yielding positive capacity in configurations where each constituent channel individually has zero capacity. We illustrate these effects through models exhibiting resonant-tunneling-enhanced transport. Our approach provides a general methodology for analyzing coherent information flow in quantum graphs, with relevance for quantum communication, control, and simulation in structured environments.

quant-ph↗

arXiv2026

Conveyor-belt superconducting quantum computer

The processing unit of a solid-state quantum computer consists in an array of coupled qubits, each locally driven with on-chip microwave lines that route carefully-engineered control signals to the qubits in order to perform logical operations. This approach to quantum computing comes with two major problems. On the one hand, it greatly hampers scalability towards fault-tolerant quantum computers, which are estimated to need a number of qubits -- and, therefore driving lines -- on the order of $10^6$. On the other hand, these lines are a source of electromagnetic noise, exacerbating frequency crowding and crosstalk, while also contributing to power dissipation inside the dilution fridge. We here tackle these two overwhelming challenges by presenting a novel quantum processing unit (QPU) for a universal quantum computer which is globally (rather than locally) driven. Our QPU relies on a string of superconducting qubits with always-on ZZ interactions, enclosed into a closed geometry, which we dub ``conveyor belt''. Strikingly, this architecture requires only $\mathcal{O}(N)$ physical qubits to run a computation on $N$ computational qubits, in contrast to previous $\mathcal{O}(N^2)$ proposals for global quantum computation. Additionally, universality is achieved via the implementation of single-qubit gates and a one-shot Toffoli gate. The ability to perform multi-qubit operations in a single step could vastly improve the fidelity and execution time of many algorithms.

quant-ph↗