arXiv subjects

Junheng Shi

Publications and source records attributed to Junheng Shi.

5 recordsLinked to original sources

arXiv2024

Deep learning of many-body observables and quantum information scrambling

Machine learning has shown significant breakthroughs in quantum science, where in particular deep neural networks exhibited remarkable power in modeling quantum many-body systems. Here, we explore how the capacity of data-driven deep neural networks in learning the dynamics of physical observables is correlated with the scrambling of quantum information. We train a neural network to find a mapping from the parameters of a model to the evolution of observables in random quantum circuits for various regimes of quantum scrambling and test its \textit{generalization} and \textit{extrapolation} capabilities in applying it to unseen circuits. Our results show that a particular type of recurrent neural network is extremely powerful in generalizing its predictions within the system size and time window that it has been trained on for both, localized and scrambled regimes. These include regimes where classical learning approaches are known to fail in sampling from a representation of the full wave function. Moreover, the considered neural network succeeds in \textit{extrapolating} its predictions beyond the time window and system size that it has been trained on for models that show localization, but not in scrambled regimes.

quant-ph↗

arXiv2023

Measurement-based deterministic imaginary time evolution

We introduce a method to perform imaginary time evolution in a controllable quantum system using measurements and conditional unitary operations. By performing a sequence of weak measurements based on the desired Hamiltonian constructed by a Suzuki-Trotter decomposition, an evolution approximating imaginary time evolution can be realized. The randomness due to measurement is corrected using conditional unitary operations, making the evolution deterministic. Both the measurements required for the algorithm and the conditional unitary operations can be constructed efficiently. We show that the algorithm converges only below a specified energy threshold and the complexity is estimated for some specific problem instances.

quant-ph↗

arXiv2022

Simple determination of dark states in a general multi-level system

In a multi-level energy system with energy transitions, dark states are eigenstates of a Hamiltonian that consist entirely of ground states, with zero amplitude in the excited states. We present several criteria which allows one to deduce the presence of dark states in a general multi-level system based on the submatrices of the Hamiltonian. The dark states can be shown to be the right-singular vectors of the submatrix that connect the ground states to the excited states. Furthermore, we show a simple way of finding the dark state involving the determinant of a matrix constructed from the same submatrix.

quant-ph↗

arXiv2022

Quantum supremacy with spin squeezed atomic ensembles

We propose a method to achieve quantum supremacy using ensembles of qubits, using only spin squeezing, basis rotations, and Fock state measurements. Each ensemble is assumed to be controllable only with its total spin. Using a repeated sequence of random basis rotations followed by squeezing, we show that the probability distribution of the final measurements quickly approaches a Porter-Thomas distribution. We show that the sampling probability can be related to a #P-hard problem with a complexity scaling as $(N+1)^M$, where $N$ is the number of qubits in an ensemble and $ M $ is the number of ensembles. The scheme can be implemented with hot or cold atomic ensembles. Due to the large number of atoms in typical atomic ensembles, this allows access to the quantum supremacy regime with a modest number of ensembles or gate depth.

quant-ph↗

arXiv2022

Gaussian boson sampling with partial distinguishability

Gaussian boson sampling (GBS) allows for a way to demonstrate quantum supremacy with the relatively modest experimental resources of squeezed light sources, linear optics, and photon detection. In a realistic experimental setting, numerous effects can modify the complexity of the sampling, in particular loss, partial distinguishability of the photons, and the use of threshold detectors rather than photon counting detectors. In this paper, we investigate GBS with partial distinguishability using an approach based on virtual modes and indistinguishability efficiency. We develop a model using these concepts and derive the probabilities of measuring a specific output pattern from partially distinguishable and lossy GBS for both types of detectors. In the case of threshold detectors, the probability as calculated by the Torontonian is a special case under our framework. By analyzing the expressions of these probabilities we propose an efficient auxiliary classical simulation algorithm which can be used to calculate the probabilities. Our model and the auxiliary algorithm provide foundations for an approximation method for the probability calculation and simulation algorithms not only compatible with existing state-of-the-art simulation algorithms for ideal GBS but also reduce their complexities exponentially depending on the indistinguishability. Using the approximation method and the simulation algorithms we show how the boundary of quantum supremacy in GBS can be pushed further by partial distinguishability.

quant-ph↗