Dividing and Conquering the Van Vleck Catastrophe

• URL: http://arxiv.org/abs/2504.03465v1
• Date: Fri, 04 Apr 2025 14:15:12 GMT
• Title: Dividing and Conquering the Van Vleck Catastrophe
• Authors: Sophia Simon, Gian-Luca R. Anselmetti, Raffaele Santagati, Matthias Degroote, Nikolaj Moll, Michael Streif, Nathan Wiebe,
• Abstract summary: The Van Vleck catastrophe has frequently been invoked to suggest that quantum computers may not be able to efficiently prepare ground states of large systems.<n>We show that this intuition is not necessarily true. Specifically, we introduce a divide-and-conquer strategy that repeatedly uses phase estimation to merge ground states of increasingly larger subsystems.
• Score: 0.39089069256361736
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The quantum-computational cost of determining ground state energies through quantum phase estimation depends on the overlap between an easily preparable initial state and the targeted ground state. The Van Vleck orthogonality catastrophe has frequently been invoked to suggest that quantum computers may not be able to efficiently prepare ground states of large systems because the overlap with the initial state tends to decrease exponentially with the system size, even for non-interacting systems. We show that this intuition is not necessarily true. Specifically, we introduce a divide-and-conquer strategy that repeatedly uses phase estimation to merge ground states of increasingly larger subsystems. We provide rigorous bounds for this approach and show that if the minimum success probability of each merge is lower bounded by a constant, then the query complexity of preparing the ground state of $N$ interacting systems is in $O(N^{\log\log(N)} {\rm poly}(N))$, which is quasi-polynomial in $N$, in contrast to the exponential scaling anticipated by the Van Vleck catastrophe. We also discuss sufficient conditions on the Hamiltonian that ensure a quasi-polynomial running time.

Related papers

• Dynamically emergent correlations in bosons via quantum resetting [0.0]
  We study the nonequilibrium stationary state (NESS) induced by quantum resetting of a system of $N$ noninteracting bosons in a harmonic trap.<n>We fully characterize the steady state by analytically computing several physical observables such as the average density, extreme value statistics, order and gap statistics.<n>This is a rare example of a strongly correlated quantum many-body NESS where various observables can be exactly computed.
  arXiv  Detail & Related papers  (2024-07-29T18:00:35Z)
• One-Shot Min-Entropy Calculation Of Classical-Quantum States And Its Application To Quantum Cryptography [21.823963925581868]
  We develop a one-shot lower bound calculation technique for the min-entropy of a classical-quantum state.<n>It offers an alternative tight finite-data analysis for the BB84 quantum key distribution scheme.<n>It gives the best finite-key bound known to date for a variant of device independent quantum key distribution protocol.
  arXiv  Detail & Related papers  (2024-06-21T15:11:26Z)
• Optimal Second-Order Rates for Quantum Information Decoupling [14.932939960009605]
  We consider the standard quantum information decoupling, in which Alice aims to decouple her system from the environment by local operations and discarding some of her systems. We find an achievability bound in entanglement distillation protocol, where the objective is for Alice and Bob to transform their quantum state to maximally entangled state with largest possible dimension.
  arXiv  Detail & Related papers  (2024-03-21T12:06:30Z)
• Unraveling the emergence of quantum state designs in systems with symmetry [15.699822139827916]
  We study the emergence of state designs from the random generator states exhibiting symmetries. We find faster convergence of the trace distance during the early time evolution in comparison to the cases when the symmetry is broken. We expect our findings to pave the way for further exploration of deep thermalization and equilibration of closed and open quantum many-body systems.
  arXiv  Detail & Related papers  (2024-02-14T05:35:03Z)
• Sufficient condition for universal quantum computation using bosonic circuits [44.99833362998488]
  We focus on promoting circuits that are otherwise simulatable to computational universality. We first introduce a general framework for mapping a continuous-variable state into a qubit state. We then cast existing maps into this framework, including the modular and stabilizer subsystem decompositions.
  arXiv  Detail & Related papers  (2023-09-14T16:15:14Z)
• Exponentially improved efficient machine learning for quantum many-body states with provable guarantees [0.0]
  We provide theoretical guarantees for efficient learning of quantum many-body states and their properties, with model-independent applications. Our results provide theoretical guarantees for efficient learning of quantum many-body states and their properties, with model-independent applications.
  arXiv  Detail & Related papers  (2023-04-10T02:22:36Z)
• Sparse random Hamiltonians are quantumly easy [105.6788971265845]
  A candidate application for quantum computers is to simulate the low-temperature properties of quantum systems. This paper shows that, for most random Hamiltonians, the maximally mixed state is a sufficiently good trial state. Phase estimation efficiently prepares states with energy arbitrarily close to the ground energy.
  arXiv  Detail & Related papers  (2023-02-07T10:57:36Z)
• Reconstructing the whole from its parts [0.0]
  We analytically determine global quantum states from a wide class of self-consistent marginal reductions in any multipartite scenario. We show that any self-consistent set of multipartite marginal reductions is compatible with the existence of a global quantum state, after passing through a depolarizing channel.
  arXiv  Detail & Related papers  (2022-09-28T15:04:22Z)
• Estimating gate complexities for the site-by-site preparation of fermionic vacua [0.0]
  We study the ground state overlap as a function of the number of sites for a range of quadratic fermionic Hamiltonians. For one-dimensional systems, we find that two $N/2$-site ground states also share a large overlap with the $N$-site ground state everywhere except a region near the phase boundary.
  arXiv  Detail & Related papers  (2022-07-04T19:45:14Z)
• Dynamic transition from insulating state to eta-pairing state in a composite non-Hermitian system [0.0]
  We study the dynamic transition from a trivial insulating state to an eta-pairing state in a composite non-Hermitian Hubbard system. The speed of relaxation of the off-diagonal long-range order pair state depends on the order of the exceptional point.
  arXiv  Detail & Related papers  (2021-12-20T13:12:37Z)
• Average-case Speedup for Product Formulas [69.68937033275746]
  Product formulas, or Trotterization, are the oldest and still remain an appealing method to simulate quantum systems. We prove that the Trotter error exhibits a qualitatively better scaling for the vast majority of input states. Our results open doors to the study of quantum algorithms in the average case.
  arXiv  Detail & Related papers  (2021-11-09T18:49:48Z)
• Interplay between transport and quantum coherences in free fermionic systems [58.720142291102135]
  We study the quench dynamics in free fermionic systems. In particular, we identify a function, that we dub emphtransition map, which takes the value of the stationary current as input and gives the value of correlation as output.
  arXiv  Detail & Related papers  (2021-03-24T17:47:53Z)
• Random quantum circuits anti-concentrate in log depth [118.18170052022323]
  We study the number of gates needed for the distribution over measurement outcomes for typical circuit instances to be anti-concentrated. Our definition of anti-concentration is that the expected collision probability is only a constant factor larger than if the distribution were uniform. In both the case where the gates are nearest-neighbor on a 1D ring and the case where gates are long-range, we show $O(n log(n)) gates are also sufficient.
  arXiv  Detail & Related papers  (2020-11-24T18:44:57Z)
• Einselection from incompatible decoherence channels [62.997667081978825]
  We analyze an open quantum dynamics inspired by CQED experiments with two non-commuting Lindblad operators. We show that Fock states remain the most robust states to decoherence up to a critical coupling.
  arXiv  Detail & Related papers  (2020-01-29T14:15:19Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.