arXiv subjects

Nicholas Laracuente

Publications and source records attributed to Nicholas Laracuente.

3 recordsLinked to original sources

arXiv2026

Shallow Approximate Unitary Designs from Relative Entropy Decay of Unstructured Random Circuits

Approximate unitary k-designs are ensembles of unitary matrices whose first k statistical moments approximate the Haar (uniform) measure. Shallow, random quantum circuits with temporally and spatially structured architectures are known to yield approximate k-designs in depth that is logarithmic in the number of qubits. It was open whether this structure is physically necessary. Shown here is shallow relative entropy convergence for standard notions of less structured, time-periodic circuits, implying additive-error approximate k-designs in nearly logarithmic depth (up to sub-logarithmic factors). These architectures include 1-dimensional brickwork and gates placed randomly according to a connected, bounded-degree graph. Relative entropy recombination methods derived herein are potentially of independent interest.

quant-ph↗

arXiv2025

Strong converse rate for asymptotic hypothesis testing in type III

We extend from the hyperfinite setting to general von Neumann algebras Mosonyi and Ogawa's (2015) and Mosonyi and Hiai's (2023) results showing the operational interpretation of sandwiched relative Rényi entropy in the strong converse of hypothesis testing. The specific task is to distinguish between two quantum states given many copies. We use a reduction method of Haagerup, Junge, and Xu (2010) to approximate relative entropy inequalities in an arbitrary von Neumann algebra by those in finite von Neumann algebras. Within these finite von Neumann algebras, it is possible to approximate densities via finite spectrum operators, after which the quantum method of types reduces them to effectively commuting subalgebras. Generalizing beyond the hyperfinite setting shows that the operational meaning of sandwiched Rényi entropy is not restricted to the matrices but is a more fundamental property of quantum information. Furthermore, applicability in general von Neumann algebras opens potential new connections to random matrix theory and the quantum information theory of fundamental physics.

quant-ph↗

arXiv2023

Information Fragility or Robustness Under Quantum Channels

Quantum states naturally decay under noise. Many earlier works have quantified and demonstrated lower bounds on the decay rate, showing exponential decay in a wide variety of contexts. Here we study the converse question: are there uniform upper bounds on the ratio of post-noise to initial information quantities when noise is sufficiently weak? In several scenarios, including classical, we find multiplicative converse bounds. However, this is not always the case. Even for simple noise such as qubit dephasing or depolarizing, mutual information may fall by an unbounded factor under arbitrarily weak noise. As an application, we find families of channels with non-zero private capacity despite arbitrarily high probability of transmitting an arbitrarily good copy of the input to the environment.

quant-ph↗