Measurement-based quantum computation in finite one-dimensional systems: string order implies computational power

• URL: http://arxiv.org/abs/2210.05089v4
• Date: Mon, 25 Dec 2023 09:30:21 GMT
• Title: Measurement-based quantum computation in finite one-dimensional systems: string order implies computational power
• Authors: Robert Raussendorf, Wang Yang, and Arnab Adhikary
• Abstract summary: We present a new framework for assessing the power of measurement-based quantum computation (MBQC) on short-range entangled symmetric resource states. We strengthen the connection between MBQC computational power and string order.
• Score: 2.231201892342328
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We present a new framework for assessing the power of measurement-based quantum computation (MBQC) on short-range entangled symmetric resource states, in spatial dimension one. It requires fewer assumptions than previously known. The formalism can handle finitely extended systems (as opposed to the thermodynamic limit), and does not require translation-invariance. Further, we strengthen the connection between MBQC computational power and string order. Namely, we establish that whenever a suitable set of string order parameters is non-zero, a corresponding set of unitary gates can be realized with fidelity arbitrarily close to unity.

Related papers

• Characterizing randomness in parameterized quantum circuits through expressibility and average entanglement [39.58317527488534]
  Quantum Circuits (PQCs) are still not fully understood outside the scope of their principal application. We analyse the generation of random states in PQCs under restrictions on the qubits connectivities. We place a connection between how steep is the increase on the uniformity of the distribution of the generated states and the generation of entanglement.
  arXiv  Detail & Related papers  (2024-05-03T17:32:55Z)
• Dimension matters: precision and incompatibility in multi-parameter quantum estimation models [44.99833362998488]
  We study the role of probe dimension in determining the bounds of precision in quantum estimation problems. We also critically examine the performance of the so-called incompatibility (AI) in characterizing the difference between the Holevo-Cram'er-Rao bound and the Symmetric Logarithmic Derivative (SLD) one.
  arXiv  Detail & Related papers  (2024-03-11T18:59:56Z)
• Unifying (Quantum) Statistical and Parametrized (Quantum) Algorithms [65.268245109828]
  We take inspiration from Kearns' SQ oracle and Valiant's weak evaluation oracle. We introduce an extensive yet intuitive framework that yields unconditional lower bounds for learning from evaluation queries.
  arXiv  Detail & Related papers  (2023-10-26T18:23:21Z)
• 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)
• Determining the ability for universal quantum computing: Testing controllability via dimensional expressivity [39.58317527488534]
  Controllability tests can be used in the design of quantum devices to reduce the number of external controls. We devise a hybrid quantum-classical algorithm based on a parametrized quantum circuit.
  arXiv  Detail & Related papers  (2023-08-01T15:33:41Z)
• No state-independent contextuality can be extracted from contextual measurement-based quantum computation with qudits of odd prime dimension [0.0]
  Linear constraint systems (LCS) have proven to be a surprisingly prolific tool in the study of non-classical correlations. It is not known whether there exist LCS in odd dimension, which admit finite-dimensional quantum, but no classical solutions.
  arXiv  Detail & Related papers  (2022-09-28T11:55:40Z)
• Universal measurement-based quantum computation in a one-dimensional architecture enabled by dual-unitary circuits [0.0]
  We show that applying a dual-unitary circuit to a many-body state followed by appropriate measurements effectively implements quantum computation in the spatial direction. Our protocol allows generic quantum circuits to be rotated' in space-time and gives new ways to exchange between resources like qubit number and coherence time in quantum computers.
  arXiv  Detail & Related papers  (2022-09-13T17:46:15Z)
• Outcome determinism in measurement-based quantum computation with qudits [0.0]
  In measurement-based quantum computing, computation is carried out by a sequence of measurements and corrections on an entangled state. We introduce flow-based methods for MBQC with qudit graph states, which we call Zd-flow, when the local dimension is an odd prime. Our main results are that Zd-flow is a necessary and sufficient condition for a strong form of outcome determinism.
  arXiv  Detail & Related papers  (2021-09-28T15:36:36Z)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)
• Quantum adiabatic brachistochrone for open systems [0.0]
  We compute a quantum adiabatic brachistochrone (QAB) for open systems. A numerical protocol is devised, which allows to compute the QAB for arbitrary quantum systems.
  arXiv  Detail & Related papers  (2020-06-24T13:33:51Z)
• Entanglement distance for arbitrary $M$-qudit hybrid systems [0.0]
  We propose a measure of entanglement which can be computed for pure and mixed states of a $M$-qudit hybrid system. We quantify the robustness of entanglement of a state through the eigenvalues analysis of the metric tensor associated with it.
  arXiv  Detail & Related papers  (2020-03-11T15:16:36Z)

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.