Robust decompositions of quantum states

• URL: http://arxiv.org/abs/2003.04171v1
• Date: Mon, 9 Mar 2020 14:28:04 GMT
• Title: Robust decompositions of quantum states
• Authors: Jonathan E. Moussa
• Abstract summary: We establish a classical-quantum complexity equivalence using a noisy quantum circuit model. We construct two distinct variants, both of which are compatible with machine-learning methodology. They both enable efficiently computable lower bounds on von Neumann entropy and thus can be used as finite-temperature variational quantum Monte Carlo methods.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Classical-quantum computational complexity separations are an important motivation for the long-term development of digital quantum computers, but classical-quantum complexity equivalences are just as important in our present era of noisy intermediate-scale quantum devices for framing near-term progress towards quantum supremacy. We establish one such equivalence using a noisy quantum circuit model that can be simulated efficiently on classical computers. With respect to its noise model, quantum states have a robust decomposition into a sequence of operations that each extend the state by one qubit without spreading errors between qubits. This enables universal quantum sampling of states with an efficient representation in this robust form and observables with low quantum weight that can be sampled from general measurements on a few qubits and computational basis measurements on the remaining qubits. These robust decompositions are not unique, and we construct two distinct variants, both of which are compatible with machine-learning methodology. They both enable efficiently computable lower bounds on von Neumann entropy and thus can be used as finite-temperature variational quantum Monte Carlo methods.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• Fighting noise with noise: a stochastic projective quantum eigensolver [0.0]
  We present a novel approach to estimating physical observables which leads to a two order of magnitude reduction in the required sampling of the quantum state. The method can be applied to excited-state calculations and simulation for general chemistry on quantum devices.
  arXiv  Detail & Related papers  (2023-06-26T09:22:06Z)
• Variational Approach to Quantum State Tomography based on Maximal Entropy Formalism [3.6344381605841187]
  We employ the maximal entropy formalism to construct the least biased mixed quantum state that is consistent with the given set of expectation values. We employ a parameterized quantum circuit and a hybrid quantum-classical variational algorithm to obtain such a target state making our recipe easily implementable on a near-term quantum device.
  arXiv  Detail & Related papers  (2022-06-06T01:16:22Z)
• Entanglement Forging with generative neural network models [0.0]
  We show that a hybrid quantum-classical variational ans"atze can forge entanglement to lower quantum resource overhead. The method is efficient in terms of the number of measurements required to achieve fixed precision on expected values of observables.
  arXiv  Detail & Related papers  (2022-05-02T14:29:17Z)
• Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
  We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems. Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
  arXiv  Detail & Related papers  (2021-08-30T23:50:05Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Certification of quantum states with hidden structure of their bitstrings [0.0]
  We propose a numerically cheap procedure to describe and distinguish quantum states. We show that it is enough to characterize quantum states with different structure of entanglement. Our approach can be employed to detect phase transitions of different nature in many-body quantum magnetic systems.
  arXiv  Detail & Related papers  (2021-07-21T06:22:35Z)
• Numerical hardware-efficient variational quantum simulation of a soliton solution [0.0]
  We discuss the capabilities of quantum algorithms with special attention paid to a hardware-efficient variational eigensolver. A delicate interplay between magnetic interactions allows one to stabilize a chiral state that destroys the homogeneity of magnetic ordering. We argue that, while being capable of correctly reproducing a uniform magnetic configuration, the hardware-efficient ansatz meets difficulties in providing a detailed description to a noncollinear magnetic structure.
  arXiv  Detail & Related papers  (2021-05-13T11:58:18Z)
• Preparing random states and benchmarking with many-body quantum chaos [48.044162981804526]
  We show how to predict and experimentally observe the emergence of random state ensembles naturally under time-independent Hamiltonian dynamics. The observed random ensembles emerge from projective measurements and are intimately linked to universal correlations built up between subsystems of a larger quantum system. Our work has implications for understanding randomness in quantum dynamics, and enables applications of this concept in a wider context.
  arXiv  Detail & Related papers  (2021-03-05T08:32:43Z)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)

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.