13 citations · 18 across the 25 of their papers we have counts for
10 papers · 1 filter
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…
Quantum-stabilized patterns in a vector Hopfield network
Richard D. Barney, Sharba Bhattacharjee, Victor Galitski +2
We introduce the quantum vector Hopfield network, in which patterns are formed by orientations of quantum vector spins; quantum dynamics arise intrinsically from the non-commutativ…
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…
Measurement-Induced Quantum Neural Network
Paul Argyle, Djamil Lakhdar-Hamina, Sarah H. Miller +1
We introduce a measurement-induced quantum neural network (MINN), an adaptive monitored-circuit architecture in which mid-circuit measurement outcomes determine the entangling gate…
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…
Benchmarking a Tunable Quantum Neural Network on Trapped-Ion and Superconducting Hardware
Djamil Lakhdar-Hamina, Xingxin Liu, Richard Barney +4
We implement a quantum generalization of a neural network on trapped-ion and IBM superconducting quantum computers to classify MNIST images, a common benchmark in computer vision.…
A discrete Fourier transform based quantum circuit for modular multiplication in Shor's algorithm
Abu Musa Patoary, Amit Vikram, Victor Galitski
Shor's algorithm for the prime factorization of numbers provides an exponential speedup over the best known classical algorithms. However, nontrivial practical applications have re…
Natural Quantization of Neural Networks
Richard Barney, Djamil Lakhdar-Hamina, Victor Galitski
We propose a natural quantization of a standard neural network, where the neurons correspond to qubits and the activation functions are implemented via quantum gates and measuremen…
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…