arXiv subjects

Antonio F. Rotundo

Publications and source records attributed to Antonio F. Rotundo.

7 recordsLinked to original sources

arXiv2026

Multi-Boundary Many-Body Quantum Teleportation

Unlike standard quantum teleportation, many-body teleportation uses scrambling to transmit quantum information. In this protocol, initially localized information spreads over many degrees of freedom and is later refocused at the receiver by a simple coupling between the systems, followed by further many-body evolution. The protocol was developed from models of traversable wormholes in holography and has become a useful probe of scrambling. In particular, it can distinguish genuine scrambling from decoherence or noise when out-of-time-order correlators fail, and can reveal signatures of different scrambling mechanisms, including the distinctive behavior expected in holographic systems. Holography predicts that related protocols can transmit information between selected boundaries of multi-boundary wormhole geometries. Motivated by this setting, we study single-qubit many-body teleportation among three systems of qubits. The initial state consists of EPR pairs distributed among them, providing a simple analogue of an infinite-temperature three-boundary holographic state. We analyze the protocol with one-dimensional and all-to-all dynamics, both analytically and numerically using random circuits. We find that the third system suppresses teleportation once the spreading message reaches the region of qubits that are entangled with it. In one dimension, both the minimum coupling required for successful teleportation and the fidelity depend on the distance from the injection site to this region, a feature reminiscent of holographic causal shadows. For all-to-all dynamics, successful teleportation is instead restricted to early times and to sufficiently few qubits entangled with the third system. A third system therefore provides spatial, or subsystem, resolution of information spreading that is absent from the two-sided protocol. Our results offer a step toward many-body teleportation networks.

quant-ph↗

arXiv2026

Approximate Sparse State Preparation with the Grover-Rudolph Algorithm

Sparse quantum state preparation is a common subroutine in quantum algorithms, where classical data with few nonzero entries must be loaded into a quantum state. In this work, we consider the Grover-Rudolph algorithm, which has recently been shown to efficiently prepare sparse states, and we propose two improvements. First, we extend an existing gate-merging procedure by allowing rotations to merge with virtual zero-angle gates on unreachable branches of the preparation tree, reducing the number of CNOTs and control qubits. Second, we introduce an approximate variant in which rotations with similar but not identical angles are merged at the cost of a small, controllable error in the prepared state. We derive a classically computable estimate of the resulting overlap with the target state, which is used to guide the merging decisions.

quant-ph↗

arXiv2025

Beyond asymptotic scaling: Comparing functional quantum linear solvers

Solving systems of linear equations is a key subroutine in many quantum algorithms. In the last 15 years, many quantum linear solvers (QLS) have been developed, competing to achieve the best asymptotic worst-case complexity. Most QLS assume fault-tolerant quantum computers, so they cannot yet be benchmarked on real hardware. Because an algorithm with better asymptotic scaling can underperform on instances of practical interest, the question of which of these algorithms is the most promising remains open. In this work, we implement a method to partially address this question. We consider four well-known QLS algorithms which directly implement an approximate matrix inversion function: the Harrow-Hassidim-Lloyd algorithm, two algorithms utilizing a linear combination of unitaries, and one utilizing the quantum singular value transformation (QSVT). These methods, known as functional QLS, share nearly identical assumptions about the problem setup and oracle access. Their computational cost is dominated by query calls to a matrix oracle encoding the problem one wants to solve. We provide formulas to count the number of queries needed to solve specific problem instances; these can be used to benchmark the algorithms on real-life instances without access to quantum hardware. We select three data sets: random generated instances that obey the assumptions of functional QLS, linear systems from simplex iterations on MIPLIB, and Poisson equations. Our methods can be easily extended to other data sets and provide a high-level guide to evaluate the performance of a QLS algorithm. In particular, our work shows that HHL underperforms in comparison to the other methods across all data sets, often by orders of magnitude, while the QSVT-based method shows the best performance.

quant-ph↗

arXiv2024

Effective dynamics from minimising dissipation

It is known that the same physical system can be described by different effective theories depending on the scale at which it is observed. In this work, we formulate a prescription for finding the unitary that best approximates the large scale dynamics of a quantum system evolving discretely in time, as it is the case for digital quantum simulators. We consider the situation in which the degrees of freedom of the system can be divided between an IR part that we can observe, and a UV part that we cannot observe. Following a principle of minimal dissipation, our goal is to find the unitary dynamics that best approximates the (generally non unitary) time evolution of the IR degrees of freedom. We first prove that when the IR and UV degrees of freedom are weakly coupled, the unitary that maximises the fidelity is given by a mean-field dynamics and the error is given by a sum of energy variances. We then apply our results to a one dimensional quantum walk, which is known to reproduce the Dirac equation in the small mass and momenta limit. We find that in this limit the effective IR dynamics is obtained by a mass redefinition.

quant-ph↗

arXiv2023

A simple quantum algorithm to efficiently prepare sparse states

State preparation is a fundamental routine in quantum computation, for which many algorithms have been proposed. Among them, perhaps the simplest one is the Grover-Rudolph algorithm. In this paper, we analyse the performance of this algorithm when the state to prepare is sparse. We show that the gate complexity is linear in the number of non-zero amplitudes in the state and quadratic in the number of qubits. We then introduce a simple modification of the algorithm, which makes the dependence on the number of qubits also linear. This is competitive with the best known algorithms for sparse state preparation

quant-ph↗

arXiv2023

An entropic uncertainty principle for mixed states

The entropic uncertainty principle in the form proven by Maassen and Uffink yields a fundamental inequality that is prominently used in many places all over the field of quantum information theory. In this work, we provide a family of versatile generalizations of this relation. Our proof methods build on a deep connection between entropic uncertainties and interpolation inequalities for the doubly stochastic map that links probability distributions in two measurements bases. In contrast to the original relation, our generalization also incorporates the von Neumann entropy of the underlying quantum state. These results can be directly used to bound the extractable randomness of a source independent QRNG in the presence of fully quantum attacks, to certify entanglement between trusted parties, or to bound the entanglement of a system with an untrusted environment.

quant-ph↗

arXiv2022

Wormholes from Averaging over States

An important question about black holes is to what extent a typical pure state differs from the ensemble average. We show that this question can be answered within semi-classical gravity. We focus on the quantum deviation, which measures the fluctuations in the expectation value of an operator in an ensemble of pure states. For a large class of ensembles and observables, these fluctuations are calculated by a correlation function in the eternal black hole background, which can be reliably calculated within semi-classical gravity. This implements the idea of [arXiv:2002.02971] that wormholes can arise from averages over states rather than theories. As an application, we calculate the size of the long-time correlation function $\langle A(t) A(0)\rangle$.

hep-th↗