arXiv subjects

Robert Raussendorf

Publications and source records attributed to Robert Raussendorf.

At least 19 recordsLinked to original sources

arXiv2026

Testing measurement-based computational phases of quantum matter on a quantum processor

Many symmetry protected or symmetry enriched phases of quantum matter have the property that every ground state in a given such phase endows measurement based quantum computation with the same computational power. Such phases are called computational phases of quantum matter. Here, we experimentally verify four theoretical predictions for them on an IBM superconducting quantum device. We comprehensively investigate how symmetric imperfections of the resource states translate into logical decoherence, and how this decoherence is mitigated. In particular, the central experiment probes the scaling law from which the uniformity of computational power follows. We also analyze the correlated regime, where local measurements give rise to logical operations collectively. We test the prediction that densest packing of a measurement-based algorithms remains the most efficient, in spite of the correlations. Our experiments corroborate the operational stability of measurement based quantum computation in quantum phases of matter with symmetry.

quant-ph↗

arXiv2025

Sub-Riemannian geometry of measurement based quantum computation

The computational power of quantum phases of matter with symmetry can be accessed through local measurements, but what is the most efficient way of doing so? In this work, we show that minimizing operational resources in measurement-based quantum computation on subsystem symmetric resource states amounts to solving a sub-Riemannian geodesic problem between the identity and the target logical unitary. This reveals a geometric structure underlying MBQC and offers a principled route to optimize quantum processing in computational phases.

quant-ph↗

arXiv2024

A 3D lattice defect and efficient computations in topological MBQC

We describe an efficient, fully fault-tolerant implementation of Measurement-Based Quantum Computation (MBQC) in the 3D cluster state. The two key novelties are (i) the introduction of a lattice defect in the underlying cluster state and (ii) the use of the Rudolph-Grover rebit encoding. Concretely, (i) allows for a topological implementation of the Hadamard gate, while (ii) does the same for the phase gate. Furthermore, we develop general ideas towards circuit compaction and algorithmic circuit verification, which we implement for the Reed-Muller code used for magic state distillation. Our performance analysis highlights the overall improvements provided by the new methods.

quant-ph↗

arXiv2024

Duality between string and computational order in symmetry-enriched topological phases

We present the first examples of topological phases of matter with uniform power for measurement-based quantum computation. This is possible thanks to a new framework for analyzing the computational properties of phases of matter that is more general than previous constructions, which were limited to short-range entangled phases in one dimension. We show that ground states of the toric code in an anisotropic magnetic field yield a natural, albeit non-computationally-universal, application of our framework. We then present a new model with topological order whose ground states are universal resources for MBQC. Both topological models are enriched by subsystem symmetries, and these symmetries protect their computational power. Our framework greatly expands the range of physical models that can be analyzed from the computational perspective.

quant-ph↗

arXiv2024

Measurement-based quantum computation in symmetry protected topological states of one-dimensional integer spin systems

In this work, we generalize the algebraic framework for measurement-based quantum computation (MBQC) in one-dimensional symmetry protected topological states recently developed in [Quantum 7, 1215 (2023)], such that in addition to half-odd-integer spins, the integer spin chains can also be incorporated in the framework. The computational order parameter characterizing the efficiency of MBQC is identified, which, for spin-$1$ chains in the Haldane phase, coincides with the conventional string order parameter in condensed matter physics.

quant-ph↗

arXiv2024

Simulating quantum computation: how many "bits" for "it"?

A recently introduced classical simulation method for universal quantum computation with magic states operates by repeated sampling from probability functions [M. Zurel et al. PRL 260404 (2020)]. This method is closely related to sampling algorithms based on Wigner functions, with the important distinction that Wigner functions can take negative values obstructing the sampling. Indeed, negativity in Wigner functions has been identified as a precondition for a quantum speed-up. However, in the present method of classical simulation, negativity of quasiprobability functions never arises. This model remains probabilistic for all quantum computations. In this paper, we analyze the amount of classical data that the simulation procedure must track. We find that this amount is small. Specifically, for any number $n$ of magic states, the number of bits that describe the quantum system at any given time is $2n^2+O(n)$.

quant-ph↗

arXiv2024

Redundant string symmetry-based error correction: Demonstrations on quantum devices

Computational power in measurement-based quantum computing stems from the symmetry-protected topological (SPT) order of entangled resource states. However, resource states are prone to preparation errors. We introduce a quantum error correction approach using redundant nonlocal symmetry of the resource state. We demonstrate it within a teleportation protocol based on extending the $\mathbb{Z}_2 \times \mathbb{Z}_2$ symmetry of one-dimensional cluster states to other graph states. Qubit ZZ-crosstalk errors, which are prominent in quantum devices, degrade the teleportation fidelity of the usual cluster state. However, as we demonstrate on quantum hardware, once we grow graph states with redundant symmetry, perfect teleportation fidelity is restored. We identify the underlying redundant-SPT order as error-protected degeneracies in the entanglement spectrum.

quant-ph↗

arXiv2024

The Gauge Theory of Measurement-Based Quantum Computation

Measurement-Based Quantum Computation (MBQC) is a model of quantum computation, which uses local measurements instead of unitary gates. Here we explain that the MBQC procedure has a fundamental basis in an underlying gauge theory. This perspective provides a theoretical foundation for global aspects of MBQC. The gauge transformations reflect the freedom of formulating the same MBQC computation in different local reference frames. The main identifications between MBQC and gauge theory concepts are: (i) the computational output of MBQC is a holonomy of the gauge field, (ii) the adaptation of measurement basis that remedies the inherent randomness of quantum measurements is effected by gauge transformations. The gauge theory of MBQC also plays a role in characterizing the entanglement structure of symmetry-protected topologically (SPT) ordered states, which are resources for MBQC. Our framework situates MBQC in a broader context of condensed matter and high energy theory.

hep-th↗

arXiv2024

Universal measurement-based quantum computation in a one-dimensional architecture enabled by dual-unitary circuits

A powerful tool emerging from the study of many-body quantum dynamics is that of dual-unitary circuits, which are unitary even when read `sideways', i.e., along the spatial direction. Here, we show that this provides the ideal framework to understand and expand on the notion of measurement-based quantum computation (MBQC). In particular, applying a dual-unitary circuit to a many-body state followed by appropriate measurements effectively implements quantum computation in the spatial direction. We show how the dual-unitary dynamics generated by the dynamics of the paradigmatic one-dimensional kicked Ising chain with certain parameter choices generate resource states for universal deterministic MBQC. Specifically, after $k$ time-steps, equivalent to a depth-$k$ quantum circuit, we obtain a resource state for universal MBQC on $\sim 3k/4$ encoded qubits. 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. Beyond the practical advantages, we also interpret the dual-unitary evolution as generating an infinite sequence of new symmetry-protected topological phases with spatially modulated symmetries, which gives a vast generalization of the well-studied one-dimensional cluster state and shows that our protocol is robust to symmetry-respecting deformations.

quant-ph↗

arXiv2024

Measurement-based quantum machine learning

Quantum machine learning (QML) leverages quantum computing for classical inference, furnishes the processing of quantum data with machine-learning methods, and provides quantum algorithms adapted to noisy devices. Typically, QML proposals are framed in terms of the circuit model of quantum computation. The alternative measurement-based quantum computing (MBQC) paradigm can exhibit lower circuit depths, is naturally compatible with classical co-processing of mid-circuit measurements, and offers a promising avenue towards error correction. Despite significant progress on MBQC devices, QML in terms of MBQC has been hardly explored. We propose the multiple-triangle ansatz (MuTA), a universal quantum neural network assembled from MBQC neurons featuring bias engineering, monotonic expressivity, tunable entanglement, and scalable training. We numerically demonstrate that MuTA can learn a universal set of gates in the presence of noise, a quantum-state classifier, as well as a quantum instrument, and classify classical data using a quantum kernel tailored to MuTA. Finally, we incorporate hardware constraints imposed by photonic Gottesman-Kitaev-Preskill qubits. Our framework lays the foundation for versatile quantum neural networks native to MBQC, allowing to explore MBQC-specific algorithmic advantages and QML on MBQC devices.

quant-ph↗

arXiv2024

Hidden variable model for quantum computation with magic states on qudits of any dimension

It was recently shown that a hidden variable model can be constructed for universal quantum computation with magic states on qubits. Here we show that this result can be extended, and a hidden variable model can be defined for quantum computation with magic states on qudits with any Hilbert space dimension. This model leads to a classical simulation algorithm for universal quantum computation.

quant-ph↗

arXiv2023

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

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.

quant-ph↗

arXiv2023

Simulation of quantum computation with magic states via Jordan-Wigner transformations

Negativity in certain quasiprobability representations is a necessary condition for a quantum computational advantage. Here we define a quasiprobability representation exhibiting this property with respect to quantum computations in the magic state model. It is based on generalized Jordan-Wigner transformations, and it has a close connection to the probability representation of universal quantum computation based on the $\Lambda$ polytopes. For each number of qubits, it defines a polytope contained in the $\Lambda$ polytope with some shared vertices. It leads to an efficient classical simulation algorithm for magic state quantum circuits for which the input state is positively represented, and it outperforms previous representations in terms of the states that can be positively represented.

quant-ph↗

arXiv2023

Counter-intuitive yet efficient regimes for measurement based quantum computation on symmetry protected spin chains

Quantum states picked from non-trivial symmetry protected topological (SPT) phases have computational power in measurement based quantum computation. This power is uniform across SPT phases, and is unlocked by measurements that break the symmetry. Except at special points in the phase, all computational schemes known to date place these symmetry-breaking measurements far apart, to avoid the correlations introduced by spurious, non-universal entanglement. In this work, we investigate the opposite regime of computation where the symmetry-breaking measurements are packed densely. We show that not only does the computation still function, but in fact, under reasonable physical assumptions, this is the most resource efficient mode.

quant-ph↗

arXiv2023

Classification of measurement-based quantum wire in stabilizer PEPS

We consider a class of translation-invariant 2D tensor network states with a stabilizer symmetry, which we call stabilizer PEPS. The cluster state, GHZ state, and states in the toric code belong to this class. We investigate the transmission capacity of stabilizer PEPS for measurement-based quantum wire, and arrive at a complete classification of transmission behaviors. The transmission behaviors fall into 13 classes, one of which corresponds to Clifford quantum cellular automata. In addition, we identify 12 other classes.

quant-ph↗

arXiv2023

The role of cohomology in quantum computation with magic states

A web of cohomological facts relates quantum error correction, measurement-based quantum computation, symmetry protected topological order and contextuality. Here we extend this web to quantum computation with magic states. In this computational scheme, the negativity of certain quasiprobability functions is an indicator for quantumness. However, when constructing quasiprobability functions to which this statement applies, a marked difference arises between the cases of even and odd local Hilbert space dimension. At a technical level, establishing negativity as an indicator of quantumness in quantum computation with magic states relies on two properties of the Wigner function: their covariance with respect to the Clifford group and positive representation of Pauli measurements. In odd dimension, Gross' Wigner function -- an adaptation of the original Wigner function to odd-finite-dimensional Hilbert spaces -- possesses these properties. In even dimension, Gross' Wigner function doesn't exist. Here we discuss the broader class of Wigner functions that, like Gross', are obtained from operator bases. We find that such Clifford-covariant Wigner functions do not exist in any even dimension, and furthermore, Pauli measurements cannot be positively represented by them in any even dimension whenever the number of qudits is n>=2. We establish that the obstructions to the existence of such Wigner functions are cohomological.

quant-ph↗

arXiv2022

Putting paradoxes to work: contextuality in measurement-based quantum computation

We describe a joint cohomological framework for measurement-based quantum computation (MBQC) and the corresponding contextuality proofs. The central object in this framework is an element in the second cohomology group of the chain complex describing a given MBQC. It contains the function computed, up to gauge equivalence, and at the same time is a contextuality witness. The present cohomological description only applies to temporally flat MBQCs, and we outline an approach for extending it to the temporally ordered case.

quant-ph↗

arXiv2022

Measurement-Based Time Evolution for Quantum Simulation of Fermionic Systems

Quantum simulation using time evolution in phase estimation-based quantum algorithms can yield unbiased solutions of classically intractable models. However, long runtimes open such algorithms to decoherence. We show how measurement-based quantum simulation uses effective time evolution via measurement to allow runtime advantages over conventional circuit-based algorithms that use real-time evolution with quantum gates. We construct a hybrid algorithm to find energy eigenvalues in fermionic models using only measurements on graph states. We apply the algorithm to the Kitaev and Hubbard chains. Resource estimates show a runtime advantage if measurements can be performed faster than gates, and graph states compactification is fully used. In this letter, we set the stage to allow advances in measurement precision to improve quantum simulation.

quant-ph↗