Fermionic Insights into Measurement-Based Quantum Computation: Circle Graph States Are Not Universal Resources

• URL: http://arxiv.org/abs/2510.05557v1
• Date: Tue, 07 Oct 2025 04:05:02 GMT
• Title: Fermionic Insights into Measurement-Based Quantum Computation: Circle Graph States Are Not Universal Resources
• Authors: Brent Harrison, Vishnu Iyer, Ojas Parekh, Kevin Thompson, Andrew Zhao,
• Abstract summary: Measurement-based quantum computation (MBQC) is a strong contender for realizing quantum computers.<n>A critical question for MBQC is the identification of resource graph states that can enable universal quantum computation.<n>We show that, in spite of their expressivity, circle graph states are not efficiently universal for MBQC.
• Score: 5.552495672853301
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Measurement-based quantum computation (MBQC) is a strong contender for realizing quantum computers. A critical question for MBQC is the identification of resource graph states that can enable universal quantum computation. Any such universal family must have unbounded entanglement width, which is known to be equivalent to the ability to produce any circle graph state from the states in the family using only local Clifford operations, local Pauli measurements, and classical communication. Yet, it was not previously known whether or not circle graph states themselves are a universal resource. We show that, in spite of their expressivity, circle graph states are not efficiently universal for MBQC (i.e., assuming $\mathsf{BQP} \neq \mathsf{BPP}$). We prove this by articulating a precise graph-theoretic correspondence between circle graph states and a certain subset of fermionic Gaussian states. This is accomplished by synthesizing a variety of techniques that allow us to handle both stabilizer states and fermionic Gaussian states at the same time. As such, we anticipate that our developments may have broader applications beyond the domain of MBQC as well.

Related papers

• ENTCALC: Toolkit for calculating geometric entanglement in multipartite quantum systems [43.748379918040854]
  We present entcalc, a Python package for estimating the geometric entanglement of multipartite quantum states.<n>For pure states, it computes the geometric entanglement together with an estimation error.<n>For mixed states, it provides both lower and upper bounds on the geometric entanglement.
  arXiv  Detail & Related papers  (2025-12-11T18:14:43Z)
• Efficient Preparation of Resource States for Hamiltonian Simulation and Universal Quantum Computation [0.3541849852479175]
  We extend previous studies on algorithm-tailored graph states to periodic sequences of generalized Pauli rotations.<n>We derive a novel scheme for the preparation of resource states based on a graph state and a ladder of CNOT gates.<n>We also deploy our two approaches to derive universal resource states from minimal universal sets of generating Hamiltonians.
  arXiv  Detail & Related papers  (2025-09-05T18:00:00Z)
• Fault-tolerant fermionic quantum computing [39.58317527488534]
  We introduce fermionic fault-tolerant quantum computing, a framework which removes this overhead altogether.<n>We show how our framework can be implemented in neutral atoms, overcoming the apparent inability of neutral atoms to implement non-number-conserving gates.
  arXiv  Detail & Related papers  (2024-11-13T19:00:02Z)
• Many-body quantum resources of graph states [0.0]
  Characterizing the non-classical correlations of a complex many-body system is an important part of quantum technologies. We consider four topologies, namely the star graph states with edges, Tur'an graphs, $r$-ary tree graphs, and square grid cluster states. We characterize many-body entanglement depth in graph states with up to $8$ qubits in $146$ classes non-equivalent under local transformations and graph isomorphisms.
  arXiv  Detail & Related papers  (2024-10-16T12:05:19Z)
• Scaling of Computational Order Parameters in Rydberg Atom Graph States [0.0]
  We show how an always-on interaction can be used to simultaneously entangle all Rydberg atoms into a graph state.<n>We construct and implement many-body computational order parameters for graph states using non-local measurement-based logic operations.
  arXiv  Detail & Related papers  (2024-09-09T18:00:00Z)
• Self-Testing Graph States Permitting Bounded Classical Communication [1.2499537119440245]
  We show that certain graph states can be robustly self-tested even allowing for communication. We provide an explicit self-test for the circular graph state and the honeycomb cluster state.
  arXiv  Detail & Related papers  (2024-04-04T14:53:17Z)
• Gaussian Entanglement Measure: Applications to Multipartite Entanglement of Graph States and Bosonic Field Theory [50.24983453990065]
  An entanglement measure based on the Fubini-Study metric has been recently introduced by Cocchiarella and co-workers. We present the Gaussian Entanglement Measure (GEM), a generalization of geometric entanglement measure for multimode Gaussian states. By providing a computable multipartite entanglement measure for systems with a large number of degrees of freedom, we show that our definition can be used to obtain insights into a free bosonic field theory.
  arXiv  Detail & Related papers  (2024-01-31T15:50:50Z)
• Quantum State Tomography for Matrix Product Density Operators [28.799576051288888]
  Reconstruction of quantum states from experimental measurements is crucial for the verification and benchmarking of quantum devices. Many physical quantum states, such as states generated by noisy, intermediate-scale quantum computers, are usually structured. We establish theoretical guarantees for the stable recovery of MPOs using tools from compressive sensing and the theory of empirical processes.
  arXiv  Detail & Related papers  (2023-06-15T18:23:55Z)
• Compilation of algorithm-specific graph states for quantum circuits [55.90903601048249]
  We present a quantum circuit compiler that prepares an algorithm-specific graph state from quantum circuits described in high level languages. The computation can then be implemented using a series of non-Pauli measurements on this graph state.
  arXiv  Detail & Related papers  (2022-09-15T14:52:31Z)
• Graph-Theoretic Framework for Self-Testing in Bell Scenarios [37.067444579637076]
  Quantum self-testing is the task of certifying quantum states and measurements using the output statistics solely. We present a new approach for quantum self-testing in Bell non-locality scenarios.
  arXiv  Detail & Related papers  (2021-04-27T08:15:01Z)
• Quantum-optimal-control-inspired ansatz for variational quantum algorithms [105.54048699217668]
  A central component of variational quantum algorithms (VQA) is the state-preparation circuit, also known as ansatz or variational form. Here, we show that this approach is not always advantageous by introducing ans"atze that incorporate symmetry-breaking unitaries. This work constitutes a first step towards the development of a more general class of symmetry-breaking ans"atze with applications to physics and chemistry problems.
  arXiv  Detail & Related papers  (2020-08-03T18:00:05Z)

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.