Blind quantum computing with different qudit resource state architectures

• URL: http://arxiv.org/abs/2510.06323v1
• Date: Tue, 07 Oct 2025 18:00:03 GMT
• Title: Blind quantum computing with different qudit resource state architectures
• Authors: Alena Romanova, Wolfgang Dür,
• Abstract summary: We show how blind quantum computing generalizes to multi-level quantum systems (qudits)<n>We show that qudit versions of the cluster and brickwork states enable a similar server-blind execution of quantum algorithms.
• Score: 0.17188280334580197
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We discuss how blind quantum computing generalizes to multi-level quantum systems (qudits), which offers advantages compared to the qubit approach. Here, a quantum computing task is delegated to an untrusted server while simultaneously preventing the server from retrieving information about the computation it performs, the input, and the output, enabling secure cloud-based quantum computing. In the standard approach with qubits, measurement-based quantum computing is used: single-qubit measurements on cluster or brickwork states implement the computation, while random rotations of the resource qubits hide the computation from the server. We generalize finite-sized approximately universal gate sets to prime-power-dimensional qudits and show that qudit versions of the cluster and brickwork states enable a similar server-blind execution of quantum algorithms. Furthermore, we compare the overheads of different resource state architectures and discuss which hiding strategies apply to alternative qudit resource states beyond graph states.

Related papers

• Quantum-enhanced Computer Vision: Going Beyond Classical Algorithms [50.573955644831386]
  Quantum-enhanced Computer Vision (QeCV) is a new research field at the intersection of computer vision, machine learning and quantum computing.<n>It has high potential to transform how visual signals are processed and interpreted with the help of quantum computing.<n>This survey contributes to the existing literature on QeCV with a holistic review of this research field.
  arXiv  Detail & Related papers  (2025-10-08T17:59:51Z)
• Measurement-based quantum computing with qudit stabilizer states [0.0]
  We show how to perform measurement-based quantum computing on qudits (high-dimensional quantum systems) using alternative resource states beyond the cluster state.
  arXiv  Detail & Related papers  (2025-06-25T18:00:04Z)
• One Polynomial Strategy for Computing Local Projections on Square-Lattice Cluster States [0.0]
  This note aims to discuss the strategies for computing the local projections on square-lattice cluster states.<n>Although the results in the note are not peer reviewed, we would like to make them public because they are quite easy to check.
  arXiv  Detail & Related papers  (2025-06-17T07:18:46Z)
• Quantum machine learning via continuous-variable cluster states and teleportation [2.473948454680334]
  A new approach suitable for distributed quantum machine learning and exhibiting memory is proposed for a photonic platform. This measurement-based quantum reservoir computing takes advantage of continuous variable cluster states as the main quantum resource.
  arXiv  Detail & Related papers  (2024-11-11T12:11:16Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• 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)
• Quantum Clustering with k-Means: a Hybrid Approach [117.4705494502186]
  We design, implement, and evaluate three hybrid quantum k-Means algorithms. We exploit quantum phenomena to speed up the computation of distances. We show that our hybrid quantum k-Means algorithms can be more efficient than the classical version.
  arXiv  Detail & Related papers  (2022-12-13T16:04:16Z)
• Oblivious Quantum Computation and Delegated Multiparty Quantum Computation [61.12008553173672]
  We propose a new concept, oblivious computation quantum computation, where secrecy of the input qubits and the program to identify the quantum gates are required. Exploiting quantum teleportation, we propose a two-server protocol for this task. Also, we discuss delegated multiparty quantum computation, in which, several users ask multiparty quantum computation to server(s) only using classical communications.
  arXiv  Detail & Related papers  (2022-11-02T09:01:33Z)
• Optimal Stochastic Resource Allocation for Distributed Quantum Computing [50.809738453571015]
  We propose a resource allocation scheme for distributed quantum computing (DQC) based on programming to minimize the total deployment cost for quantum resources. The evaluation demonstrates the effectiveness and ability of the proposed scheme to balance the utilization of quantum computers and on-demand quantum computers.
  arXiv  Detail & Related papers  (2022-09-16T02:37:32Z)
• 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)
• Distributed Quantum Machine Learning [0.0]
  Quantum computers offer inherent security of data, as measurements destroy quantum states. We propose an approach for distributed quantum machine learning, which allows multiple parties to collaborate and securely compute quantum algorithms.
  arXiv  Detail & Related papers  (2022-08-22T13:52:21Z)
• 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)
• 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)

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.