← Back to papers
Measurement-based quantum computation on weighted graph states with arbitrarily small weight
Tomohiro Yamazaki, Yuki Takeuchi·December 1, 2025
Quantum Physics
AI Breakdown
Get a structured breakdown of this paper — what it's about, the core idea, and key takeaways for the field.
Abstract
Weighted graph states are a natural generalization of graph states, which are generated by applying controlled-phase gates, instead of controlled-Z gates, to a separable state. In this paper, we show that uniformly weighted graph states on a suitable planar graph constitute universal resources for measurement-based quantum computation for an arbitrary nonzero constant weight. To our knowledge, this is the first example of universal resources prepared with only non-maximally entangling gates and has potential applications to weakly interacting systems, such as photonic systems.