The analysis of symmetry in quantum systems is of utmost theoretical importance, useful in a variety of applications and experimental settings, and difficult to accomplish in general. Symmetries imply conservation laws, which partition Hilbert space into invariant subspaces of the time-evolution operator, each of which is demarcated according to its conserved quantity. We show that, starting from a chosen basis, any invariant, symmetry-protected subspaces which are diagonal in that basis are discoverable using transitive closure on graphs representing state-to-state transitions under
k-local unitary operations. Importantly, the discovery of these subspaces relies neither upon the explicit identification of a symmetry operator or its eigenvalues nor upon the construction of matrices of the full Hilbert space dimension. We introduce two classical algorithms, which efficiently compute and elucidate features of these subspaces. The first algorithm explores the entire symmetry-protected subspace of an initial state in time complexity linear to the size of the subspace by closing local basis state-to-basis state transitions. The second algorithm determines, with bounded error, if a given measurement outcome of a dynamically generated state is within the symmetry-protected subspace of the state in which the dynamical system is initialized. We demonstrate the applicability of these algorithms by performing postselection on data generated from emulated noisy quantum simulations of three different dynamical systems: the Heisenberg-XXX model and the
T6 and
F4 quantum cellular automata. Due to their efficient computability and indifference to identifying the underlying symmetry, these algorithms lend themselves to the postselection of quantum computer data, optimized classical simulation of quantum systems, and discovery of previously hidden symmetries in quantum mechanical systems.
Symmetry-protected subspaces in quantum systems are subspaces demarcated by a conserved quantity of that quantum system. We introduce two classical algorithms, which efficiently compute and elucidate features of these subspaces. The first algorithm explores the entire symmetry-protected subspace of an initial state in time complexity linear to the size of the subspace by closing local basis state-to-basis state transitions. The second algorithm determines, with bounded error, if a given measurement outcome of a dynamically-generated state is within the symmetry-protected subspace of the state in which the dynamical system is initialized. This software is paired with the paper of the same name at https://arxiv.org/pdf/2302.08586.pdf.
As quantum devices scale up, many-body quantum gates and algorithms begin to surpass what is possible to simulate classically. Validation methods which rely on such classical simulation, such as process tomography and randomized benchmarking, cannot efficiently check correctness of most of the processes involved. In particular non-Clifford gates are a requirement for not only universal quantum computation but for any algorithm or quantum simulation that yields fundamental speedup in comparison with its classical counterpart. We show that it is in fact still possible to validate such non-simulable processes by taking advantage of expected or engineered conservations laws in the system, combined with a unitary one-design strategy to randomize errors over the computational Hilbert space. We show that in the context of (fault-tolerant) quantum error correction, we can construct a one-design using the logically encoded Clifford group over the engineered error-free stabilizer subspace to obtain average error for arbitrary logically-encoded gates and algorithms. In the case of benchmarking simulation of physical systems, these can have various exotic symmetries over which one-design strategies can nonetheless be constructed. We give examples for fermionic systems which conserve particle number, as well as for the Fermi-Hubbard model. The symmetry benchmarking method preserves robustness to state preparation and measurement imperfections.
The investigation of many-body interactions holds significant importance for both quantum foundations and information. Hamiltonians coupling multiple particles at once, beyond other applications, can lead to faster entanglement generation, multiqubit gate implementation, and improved error correction. As an increasing number of quantum platforms can enable the realization of such physical settings, it has become interesting to study the verification of many-body-interaction resources. In this work, we explore the possibility of higher-order coupling detection through the quantum Fisher information. For a family of normalized symmetric
k-body Ising-like Hamiltonians, we derive bounds on the quantum Fisher information in product states. Due to its ordering with respect to the order of interaction, we demonstrate the possibility of detecting many-body couplings for a given Hamiltonian from the discussed family by observing violations of an appropriate bound. As a possible extension to these observations, we further analyze an example concerning three-body-interaction detection in the
XY model.
We review methods that allow one to detect and characterize quantum correlations in many-body systems, with a special focus on approaches which are scalable. Namely, those applicable to systems with many degrees of freedom, without requiring a number of measurements or computational resources to analyze the data that scale exponentially with the system size. We begin with introducing the concepts of quantum entanglement, Einstein-Podolsky-Rosen steering, and Bell nonlocality in the bipartite scenario, to then present their multipartite generalization. We review recent progress on characterizing these quantum correlations from partial information on the system state, such as through data-driven methods or witnesses based on low-order moments of collective observables. We then review state-of-the-art experiments that demonstrate the preparation, manipulation and detection of highly-entangled many-body systems. For each platform (e.g. atoms, ions, photons, superconducting circuits) we illustrate the available toolbox for state preparation and measurement, emphasizing the challenges that each system poses. To conclude, we present a list of timely open problems in the field.
Predicting local fermionic correlations is a central task in quantum many-body physics, as these correlations encode many physically relevant local observables. The ubiquitous particle-number symmetry imposes strong structural constraints on quantum states, suggesting that local correlations should be learned with fewer samples than by symmetry-agnostic approaches. However, it has remained unclear whether such a provable advantage exists in collective learning of local correlations. Here, we develop a framework of number-conserving fermionic-shadow tomography based on random orbital rotations. We prove that, for every given order
k, we can simultaneously estimate all
k-body fermionic correlations of an
N-mode
η-particle state with a given variance
ε2 using only
Ok(ηk/ε2) samples, which are independent of the system size
N. We further establish a matching information-theoretic lower bound
Ωk(ηk/ε2) for any adaptive protocol based on single-copy measurements, showing that the
(ηk,ε)-dependence is optimal up to constants depending only on
k. Furthermore, numerical studies show a 20-fold query reduction for one-body correlation estimation at
N=200,
η=20, and
ε=10−2, compared with the best alternative including Heisenberg-limited estimation methods. Relative to fermionic Gaussian-unitary shadows, sample costs for the square-lattice Fermi-Hubbard model at
N=288 are reduced by factors of
148 for energy density and
161 for spin structure factor estimation. For molecular energy derivatives with respect to atomic coordinates, our method reduces sample requirements by factors of
53 for
Cr2 and
18.5 for
[Fe2S2]2− at
N=128. These results demonstrate the practical advantage of particle-number symmetry for fermionic observable estimation.