arXiv subjects

Davide Rinaldi

Publications and source records attributed to Davide Rinaldi.

6 recordsLinked to original sources

arXiv2026

Geometric optimality of entanglement-induced fast qubit reset

Fast and reliable qubit reset is essential for the efficient operation of quantum processors. Among the proposed strategies, Mpemba-effect-based protocols offer a simple route to accelerated relaxation, but provide limited insight into the optimality of the full reset dynamics. Geometric approaches, by contrast, quantify optimality but do not generally suggest practical acceleration protocols. Here, we bridge these perspectives through a geometric analysis of entanglement-assisted qubit reset. We show that entangling operations can redistribute local coherences across a multi-qubit register, allowing the reduced state of each qubit to follow a geodesic path towards the ground state. Remarkably, this locally optimal behaviour can emerge even when the collective evolution becomes suboptimal in the full state space. We illustrate this interplay for different families of initial multi-qubit states. Our results provide a geometric perspective on Mpemba-inspired reset acceleration and clarify when extending two-qubit protocols to larger registers provides a further advantage in the reset process.

quant-ph↗

arXiv2026

sLTN: Structural Logic Tensor Networks

Logic Tensor Networks (LTN) provide a neurosymbolic framework in which first-order logic is interpreted through tensor operations, enabling logical constraints to be integrated with differentiable learning. However, the original formulation of LTN is primarily suited to data represented as flat collections of individuals, and does not explicitly capture structural organization such as temporal order, sequential position, or graph connectivity. We introduce sLTN, an extension of LTN that makes structural dimensions first-class elements of the language. Structural dimensions represent named tensor axes associated with domain-specific organization, such as time steps, sequence positions, or graph nodes. They can be quantified explicitly, related through structural relations, and used to express temporal, sequential, and relational constraints directly at the logical level. We formalize the syntax and fuzzy tensor semantics of sLTN and show that, in the absence of structural dimensions, the framework recovers the original LTN semantics as a special case. We further describe a PyTorch implementation based on a declarative signature, formula parsing, and tensorial interpretation. The framework is illustrated on representative temporal and sequential reasoning examples. This paper serves as a companion to the sltn library, available at https://github.com/logictensornetworks/sltn.

cs.AI↗

arXiv2026

Maximum-precision charging of multi-qubit quantum batteries

Precision, robustness, and efficiency are central requirements for quantum technologies. We show that genuine quantum features combined with non-Gaussianity enable the simultaneous optimization of these properties in a quantum battery-charging process. Using a generalized Jaynes-Cummings interaction as a paradigmatic light-matter interaction model, we apply the Full Counting Statistics to characterize stochastic energy exchanges between a stack of qubits and a single-mode bosonic field. We demonstrate that a sequential charging protocol driven by a non-Gaussian quantum field yields high performance in charging precision, which remains maximal even under suboptimal operating conditions. Our results establish the use of non-Gaussian quantum-states in battery charging as a robust route to a quantum precision advantage over protocols based on Gaussian states, achieved through the suppression of detrimental quantum fluctuations.

quant-ph↗

arXiv2024

Reliable quantum advantage in quantum battery charging

Quantum batteries represent one of the most promising applications of quantum thermodynamics, whose goal is not only to store energy inside small quantum systems but also to potentially leverage genuine quantum effects to outperform classical counterparts. In this context, however, energy fluctuations become extremely relevant and have a significant impact on the charging efficiency. In our work, we consider a simple yet paradigmatic model in which a flying qubit (the battery) coherently interacts with a single mode optical cavity (the charger) through a number conserving Jaynes-Cummings interaction. By making use of full-counting statistics techniques, we fully characterize the average charging power, its fluctuations and the associated charging efficiency for several different choices of initial states of the optical cavity, demonstrating that preparing the latter in a genuinely quantum non-Gaussian Fock state (rather than a classical or even non-classical Gaussian state) leads to a definite and (in principle) measurable advantage in all these figures of merit.

quant-ph↗

arXiv2024

A single-photon microwave switch with recoverable control photon

Scalable quantum technologies may be applied in prospective architectures employing traditional information processing elements, such as transistors, rectifiers, or switches modulated by low-power inputs. In this respect, recently developed quantum processors based, e.g., on superconducting circuits may alternatively be employed as the basic platform for ultra-low-power consumption classical processors, in addition to obvious applications in quantum information processing and quantum computing. Here we propose a single-photon microwave switch based on a circuit quantum electrodynamics setup, in which a single control photon in a transmission line is able to switch on/off the propagation of another single photon in a separate line. The performances of this single-photon switch are quantified in terms of the photon flux through the output channel, providing a direct comparison of our results with available data. Furthermore, we show how the design of this microwave switch enables the recovery of the single control photon after the switching process. This proposal may be readily realized in state-of-art superconducting circuit technology.

quant-ph↗

arXiv2018

Extension by Conservation. Sikorski's Theorem

Constructive meaning is given to the assertion that every finite Boolean algebra is an injective object in the category of distributive lattices. To this end, we employ Scott's notion of entailment relation, in which context we describe Sikorski's extension theorem for finite Boolean algebras and turn it into a syntactical conservation result. As a by-product, we can facilitate proofs of several related classical principles.

cs.LO↗