Measurement-based quantum computing with qudit stabilizer states

• URL: http://arxiv.org/abs/2506.20724v1
• Date: Wed, 25 Jun 2025 18:00:04 GMT
• Title: Measurement-based quantum computing with qudit stabilizer states
• Authors: Alena Romanova, Wolfgang Dür,
• Abstract summary: We show how to perform measurement-based quantum computing on qudits (high-dimensional quantum systems) using alternative resource states beyond the cluster state.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We show how to perform measurement-based quantum computing on qudits (high-dimensional quantum systems) using alternative resource states beyond the cluster state. Here, the entangling gate, characterizing the resource state, is a diagonal or block-diagonal Clifford operation instead of the usual controlled-phase gate for cluster states. This simple change has remarkable consequences: the applied entangling operation determines an intrinsic single-qudit gate associated with the resource that drives the quantum computation when performing single-qudit measurements on the resource state. We prove a condition for the intrinsic gate allowing for the measurement-based implementation of arbitrary single-qudit unitaries. Furthermore, for prime-power-dimensional qudits, we demonstrate that the complexity of the realization depends linearly on the dimension and the Pauli order of the intrinsic gate so that different entangling gates are associated with different computational overheads. In particular, we provide two examples of qutrit resource states, which allow more efficient quantum information transport and processing than the qutrit cluster state. Finally, we discuss the required two-dimensional geometry of the resource state for universal measurement-based quantum computing.

Related papers

• Effect of the readout efficiency of quantum measurement on the system entanglement [44.99833362998488]
  We quantify the entanglement for a particle on a 1d quantum random walk under inefficient monitoring. We find that the system's maximal mean entanglement at the measurement-induced quantum-to-classical crossover is in different ways by the measurement strength and inefficiency.
  arXiv  Detail & Related papers  (2024-02-29T18:10:05Z)
• Mapping quantum circuits to shallow-depth measurement patterns based on graph states [0.0]
  We create a hybrid simulation technique for measurement-based quantum computing. We show that groups of fully commuting operators can be implemented using fully-parallel, i.e., non-adaptive, measurements. We discuss how such circuits can be implemented in constant quantum depths by employing quantum teleportation.
  arXiv  Detail & Related papers  (2023-11-27T19:00:00Z)
• 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)
• Applications and resource reductions in measurement-based variational quantum eigensolvers [0.0]
  We present three different problems which are solved by employing a measurement-based implementation of the variational quantum eigensolver algorithm (MBVQE) We show that by utilising native measurement-based gates rather than standard gates, such as the standard CNOT, MBQCs may be obtained that are both shallow and have simple connectivity while simultaneously exhibiting a large expressibility.
  arXiv  Detail & Related papers  (2023-02-01T22:58:12Z)
• 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)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• A quantum processor based on coherent transport of entangled atom arrays [44.62475518267084]
  We show a quantum processor with dynamic, nonlocal connectivity, in which entangled qubits are coherently transported in a highly parallel manner. We use this architecture to realize programmable generation of entangled graph states such as cluster states and a 7-qubit Steane code state.
  arXiv  Detail & Related papers  (2021-12-07T19:00:00Z)
• Stochastic approximate state conversion for entanglement and general quantum resource theories [41.94295877935867]
  An important problem in any quantum resource theory is to determine how quantum states can be converted into each other. Very few results have been presented on the intermediate regime between probabilistic and approximate transformations. We show that these bounds imply an upper bound on the rates for various classes of states under probabilistic transformations. We also show that the deterministic version of the single copy bounds can be applied for drawing limitations on the manipulation of quantum channels.
  arXiv  Detail & Related papers  (2021-11-24T17:29:43Z)
• Benchmarking Small-Scale Quantum Devices on Computing Graph Edit Distance [52.77024349608834]
  Graph Edit Distance (GED) measures the degree of (dis)similarity between two graphs in terms of the operations needed to make them identical. In this paper we present a comparative study of two quantum approaches to computing GED.
  arXiv  Detail & Related papers  (2021-11-19T12:35:26Z)
• Quantum Causal Unravelling [44.356294905844834]
  We develop the first efficient method for unravelling the causal structure of the interactions in a multipartite quantum process. Our algorithms can be used to identify processes that can be characterized efficiently with the technique of quantum process tomography.
  arXiv  Detail & Related papers  (2021-09-27T16:28:06Z)
• Measurement-Based Quantum Computation [0.0]
  Measurement-based quantum computation is a framework of quantum computation. It originates from the one-way quantum computer of Raussendorf and Briegel.
  arXiv  Detail & Related papers  (2021-09-21T11:45:02Z)
• Deterministic multi-mode gates on a scalable photonic quantum computing platform [0.0]
  We show a small quantum circuit consisting of 10 single-mode gates and 2 two-mode gates on a three-mode input state. On this platform, fault-tolerant universal quantum computing is possible if the cluster state entanglement is improved.
  arXiv  Detail & Related papers  (2020-10-27T16:37:59Z)

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.