28 June 2019 in Physical Review B
We propose a scheme based on the neural-network quantum states to simulate the stationary states of open quantum many-body systems. Using the high expressive power of the variational ansatz described by the restricted Boltzmann machines, which we dub as the neural stationary state ansatz, we compute the stationary states of quantum dynamics obeying the Lindblad master equations. The mapping of the stationary-state search problem into finding a zero-energy ground state of an appropriate Hermitian operator allows us to apply the conventional variational Monte Carlo method for the optimization. Our method is shown to simulate various spin systems efficiently, i.e., the transverse-field Ising models in both one and two dimensions and the XYZ model in one dimension.
7 May 2020 in Physical Review Letters
We propose a class of nonintegrable quantum spin chains that exhibit quantum many-body scars even in the presence of disorder. With the use of the so-called Onsager symmetry, we construct scarred models for arbitrary spin quantum number . There are two types of scar states, namely, coherent states associated with an Onsager-algebra element and one-magnon scar states. While both of them are highly excited states, they have area-law entanglement and can be written as a matrix product state. Therefore, they explicitly violate the eigenstate thermalization hypothesis. We also investigate the dynamics of the fidelity and entanglement entropy for several initial states. The results clearly show that the scar states are trapped in a perfectly periodic orbit in the Hilbert subspace and never thermalize, whereas other generic states do rapidly. To our knowledge, our model is the first explicit example of disordered quantum many-body scarred models.
6 July 2022 in Physical Review Letters
One of the major challenges for erroneous quantum computers is undoubtedly the control over the effect of noise. Considering the rapid growth of available quantum resources that are not fully fault tolerant, it is crucial to develop practical hardware-friendly quantum error mitigation (QEM) techniques to suppress unwanted errors. Here, we propose a novel generalized quantum subspace expansion method which can handle stochastic, coherent, and algorithmic errors in quantum computers. By fully exploiting the substantially extended subspace, we can efficiently mitigate the noise present in the spectra of a given Hamiltonian, without relying on any information of noise. The performance of our method is discussed under two highly practical setups: the quantum subspaces are mainly spanned by powers of the noisy state and a set of error-boosted states, respectively. We numerically demonstrate in both situations that we can suppress errors by orders of magnitude, and show that our protocol inherits the advantages of previous error-agnostic QEM techniques as well as overcoming their drawbacks.
9 May 2018 in Physical Review B
We apply the artificial neural network in a supervised manner to map out the quantum phase diagram of disordered topological superconductors in class DIII. Given the disorder that keeps the discrete symmetries of the ensemble as a whole, translational symmetry which is broken in the quasiparticle distribution individually is recovered statistically by taking an ensemble average. By using this, we classify the phases by the artificial neural network that learned the quasiparticle distribution in the clean limit and show that the result is totally consistent with the calculation by the transfer matrix method or noncommutative geometry approach. If all three phases, namely the , trivial, and thermal metal phases, appear in the clean limit, the machine can classify them with high confidence over the entire phase diagram. If only the former two phases are present, we find that the machine remains confused in a certain region, leading us to conclude the detection of the unknown phase which is eventually identified as the thermal metal phase.
22 November 2023 in Physical Review Letters
We present a unified approach to analyzing the cost of various quantum error mitigation methods on the basis of quantum estimation theory. By analyzing the quantum Fisher information matrix of a virtual quantum circuit that effectively represents the operations of quantum error mitigation methods, we derive for a generic layered quantum circuit under a wide class of Markovian noise that, unbiased estimation of an observable encounters an exponential growth with the circuit depth in the lower bound on the measurement cost. Under the global depolarizing noise, we in particular find that the bound can be asymptotically saturated by merely rescaling the measurement results. Moreover, we prove for random circuits with local noise that the cost grows exponentially also with the qubit count. Our numerical simulations support the observation that, even if the circuit has only linear connectivity, such as the brick-wall structure, each noise channel converges to the global depolarizing channel with its strength growing exponentially with the qubit count. This not only implies the exponential growth of cost both with the depth and qubit count, but also validates the rescaling technique for sufficiently deep quantum circuits. Our results contribute to the understanding of the physical limitations of quantum error mitigation and offer a new criterion for evaluating the performance of quantum error mitigation techniques.
29 April 2024 in npj Quantum Information
The intensive pursuit for quantum advantage in terms of computational complexity has further led to a modernized crucial question of when and how will quantum computers outperform classical computers. The next milestone is undoubtedly the realization of quantum acceleration in practical problems. Here we provide a clear evidence and arguments that the primary target is likely to be condensed matter physics. Our primary contributions are summarized as follows: 1) Proposal of systematic error/runtime analysis on state-of-the-art classical algorithm based on tensor networks; 2) Dedicated and high-resolution analysis on quantum resource performed at the level of executable logical instructions; 3) Clarification of quantum-classical crosspoint for ground-state simulation to be within runtime of hours using only a few hundreds of thousand physical qubits for 2d Heisenberg and 2d Fermi-Hubbard models, assuming that logical qubits are encoded via the surface code with the physical error rate of p = 10−3. To our knowledge, we argue that condensed matter problems offer the earliest platform for demonstration of practical quantum advantage that is order-of-magnitude more feasible than ever known candidates, in terms of both qubit counts and total runtime.