3 citations · 10 across the 19 of their papers we have counts for
11 papers · 1 filter
Deciding the Attainability of the Multiparameter Quantum Fisher Information is NP-Hard
Lorcan O. Conlon, Laura Shou, V Vijendran +7
The quantum Fisher information (QFI) sets a fundamental bound on the attainable precision when estimating multiple parameters simultaneously. Incompatibility among the individually…
A constructive violation of additivity of minimum output von Neumann entropy
Laura Shou, Alexey V. Gorshkov
We give an explicit non-random example of nonadditivity of minimum output von Neumann entropy. The proof uses a finite-dimensional construction which imitates free Haar unitary beh…
Log-depth entanglement transition in hypercube Gaussian boson sampling
Laura Shou, Alexey V. Gorshkov
We study an entanglement transition at logarithmic depth in random hypercube linear optical networks. Starting from an initial Gaussian state with all modes squeezed, we prove that…
Anticoncentration and entanglement in Gaussian boson sampling
Laura Shou, Adam Ehrenberg, Yu-Xin Wang +2
Anticoncentration and entanglement are two properties used to study classical hardness or easiness of Gaussian boson sampling in varying regimes. In this paper, we consider three d…
Fast GHZ encoding with fidelity
Laura Shou, T. C. Mooney, Twesh Upadhyaya +1
We prove that -fidelity -qubit Greenberger--Horne--Zeilinger (GHZ) encoding can be performed in time using all-to-all 2-local Hamiltonians with bounded 2…
Proof of the hiding conjecture for Gaussian boson sampling with an arbitrary number of squeezed input modes
Laura Shou, Alexey V. Gorshkov, Victor Galitski +1
Gaussian boson sampling (GBS) is a sampling task proposed to demonstrate quantum advantage. We consider Gaussian boson sampling on optical modes, with equally squeezed inpu…
Depth dependence of entanglement and circuit complexity in random linear optical networks
Laura Shou, Joseph T. Iosue, Yu-Xin Wang +2
We study the growth of entanglement and circuit complexity in random passive linear optical networks as a function of the circuit depth. For entanglement dynamics, we start with an…
Proof of hiding conjecture in Gaussian boson sampling
Laura Shou, Sarah H. Miller, Victor Galitski
Gaussian boson sampling (GBS) is a promising protocol for demonstrating quantum computational advantage. One of the key steps in the argument for classical hardness of GBS is the s…
Proof of a Universal Speed Limit on Fast Scrambling in Quantum Systems
Amit Vikram, Laura Shou, Victor Galitski
We prove that the time required for sustained information scrambling in any Hamiltonian quantum system is universally at least logarithmic in the entanglement entropy of scrambled…
Spectral anomalies and broken symmetries in maximally chaotic quantum maps
Laura Shou, Amit Vikram, Victor Galitski
Spectral statistics such as the level spacing statistics and spectral form factor (SFF) are widely expected to accurately identify ``ergodicity'', including the presence of underly…
Chaotic Roots of the Modular Multiplication Dynamical System in Shor's Algorithm
Abu Musa Patoary, Amit Vikram, Laura Shou +1
Shor's factoring algorithm, believed to provide an exponential speedup over classical computation, relies on finding the period of an exactly periodic quantum modular multiplicatio…