Random circuits by measurements on weighted graph states

TL;DR

The paper proposes a novel method to implement random quantum circuits using weighted graph states and local measurements, eliminating the need for classical randomness and expanding quantum information processing techniques.

Contribution

It introduces a new scheme for random circuit implementation via weighted graph states and local measurements, without classical randomness, enhancing quantum circuit design.

Findings

The scheme successfully implements random circuits using weighted graph states.

It requires only fixed-basis local measurements, simplifying experimental procedures.

The approach is a natural application of weighted graph states in quantum computing.

Abstract

Random quantum circuits take an input quantum state and randomize it. This is a task with a growing number of identified uses in quantum information processing. We suggest a scheme to implement random circuits in a weighted graph state. The input state is entangled with the weighted graph state and a random circuit is implemented when the experimenter performs local measurements in one fixed basis only. The scheme uses no classical random numbers and is a new and natural application of weighted graph states