29 May 2023 in npj Computational Materials
The rise of automation and machine learning (ML) in electron microscopy has the potential to revolutionize materials research through autonomous data collection and processing. A significant challenge lies in developing ML models that rapidly generalize to large data sets under varying experimental conditions. We address this by employing a cycle generative adversarial network (CycleGAN) with a reciprocal space discriminator, which augments simulated data with realistic spatial frequency information. This allows the CycleGAN to generate images nearly indistinguishable from real data and provide labels for ML applications. We showcase our approach by training a fully convolutional network (FCN) to identify single atom defects in a 4.5 million atom data set, collected using automated acquisition in an aberration-corrected scanning transmission electron microscope (STEM). Our method produces adaptable FCNs that can adjust to dynamically changing experimental variables with minimal intervention, marking a crucial step towards fully autonomous harnessing of microscopy big data.
31 March 2021 in Physical Review B
Matrix product states (MPS) and “dressed” ground states of quadratic mean fields (e.g., Gutzwiller projected Slater determinants) are both important classes of variational wave functions. This latter class has played important roles in understanding superconductivity and quantum spin liquids. We present a method to obtain both the finite and infinite MPS (iMPS) representation of the ground state of an arbitrary fermionic quadratic mean-field Hamiltonian (which in the simplest case is a Slater determinant and in the most general case is a Pfaffian). We also show how to represent products of such states (e.g., determinants times Pfaffians). From this representation one can project to single occupancy and evaluate the entanglement spectra after Gutzwiller projection. We then obtain the MPS and iMPS representation of Gutzwiller projected mean-field states that arise from the variational slave-fermion approach to the bilinear-biquadratic quantum spin chain. To accomplish this, we develop an approach to orthogonalize degenerate iMPS to find all the states in the degenerate ground-state manifold. We find the energies of the MPS and iMPS states match the variational energies closely, indicating the method is accurate and there is minimal loss due to truncation error. We then present an exploration of the entanglement spectra of projected slave-fermion states, exploring their qualitative features and finding good qualitative agreement with the respective exact ground-state spectra found from density matrix renormalization group.
24 May 2021 in Physical Review Letters
Quantum Monte Carlo simulations of quantum many-body systems are plagued by the Fermion sign problem. The computational complexity of simulating Fermions scales exponentially in the projection time and system size. The sign problem is basis dependent and an improved basis, for fixed errors, leads to exponentially quicker simulations. We show how to use sign-free quantum Monte Carlo simulations to optimize over the choice of basis on large two-dimensional systems. We numerically illustrate these techniques decreasing the “badness” of the sign problem by optimizing over single-particle basis rotations on one- and two-dimensional Hubbard systems. We find a generic rotation which improves the average sign of the Hubbard model for a wide range of and densities for systems. In one example improvement, the average sign (and hence simulation cost at fixed accuracy) for the Hubbard model at and increases by . For typical projection times of , this accelerates such simulation by many orders of magnitude.
12 September 2024 in Physical Review B
Among the variational wave functions for fermionic Hamiltonians, neural network backflow (NNBF) and hidden fermion determinant states (HFDS) are two prominent classes that provide accurate approximations to the ground state. Here we develop a unifying view of fermionic neural quantum states casting them all in the framework of NNBF. NNBF wave functions have configuration-dependent single-particle orbitals (SPO) which are parameterized by a neural network. We show that HFDS can be written as a NNBF wave function with a restricted low-rank additive correction to the SPO times a neural-network generated determinant of an matrix. Furthermore, we show that in NNBF wave functions, this determinant can generically be removed when is less than or equal to the number of fermions, at the cost of further complicating the additive SPO correction increasing its rank by . We numerically and analytically compare additive SPO corrections generated by the product of two matrices with inner dimension . We find that larger wave functions span a larger space and give evidence that simpler and more direct updates to the SPO's tend to be more expressive and better energetically. These suggest the standard NNBF approach is preferred amongst other related choices. Finally, we uncover that the row selection used to select single-particle orbitals allows significant sign and amplitude modulation between nearby configurations and is partially responsible for the quality of NNBF and HFDS wave functions.
17 December 2024 in PRX Quantum
Unitary t -designs are distributions on the unitary group whose first t moments appear maximally random. Previous work has established several upper bounds on the depths at which certain specific random quantum circuit ensembles approximate t -designs. Here we show that these bounds can be extended to any fixed architecture of Haar-random two-site gates. This is accomplished by relating the spectral gaps of such architectures to those of one-dimensional brickwork architectures. Our bound depends on the details of the architecture only via the typical number of layers needed for a block of the circuit to form a connected graph over the sites. When this quantity is bounded, the circuit forms an approximate t -design in at most linear depth. We give numerical evidence for a stronger bound that depends only on the number of connected blocks into which the architecture can be divided. We also give an implicit bound for nondeterministic architectures in terms of properties of the corresponding distribution over fixed architectures. Published by the American Physical Society 2024