Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0701055 · Physics Letters A

Blind encoding into qudits

Jesni Shamsul Shaari, Mohamed Ridza Wahiddin, Stefano Mancini

Published Nov 9, 2007• 10 citations
arXivHTMLPDF
DOI
10.1016/j.physleta.2007.08.076

Related papers

From Qubits to Qudits

María Luisa Dalla Chiara, Roberto Giuntini, Roberto Leporini +1 more

Trends in logic•Jan 1, 2018•0 citations

Blind quantum computing with different qudit resource state architectures

Alena Romanova, Wolfgang Dür

We discuss how blind quantum computing generalizes to multilevel quantum systems (qudits), which offers advantages compared with 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.

arXiv:2510.06323•Physical Review A•Feb 11, 2026•0 citations

On the properties of qudits

A. B. Balantekin, Anna M. Suliga

arXiv:2405.13862•The European Physical Journal A•Jun 11, 2024•10 citations

A quantum protocol for enhanced blind millionaire problem without a pre-shared key based on single-qudit states

Xiang-Rui Li, Yi-Hua Zhou, Yu‐Guang Yang +1 more

The Journal of Supercomputing•Oct 7, 2025•3 citations

A SWAP gate for qudits

Juan Carlos García-Escartín, Pedro Chamorro‐Posada

arXiv:1304.4923•Quantum Information Processing•Aug 13, 2013•42 citations

Encoding of Quantum Stabilizer Codes Over Qudits with $d=p^{k}$

Priya J. Nadkarni, Shayan Srinivasa Garani

Stabilizer codes over qudits have been widely studied but their encoding procedures have not been investigated in detail by many. The encoding procedure proposed previously by Grassl et al. generates the stabilizer codes over qudits for prime d, while it may only generate a subspace of the codespace over qudits where d is a power of a prime. In this paper, we propose an encoding procedure to generate the stabilizer codes over qudits for d being a power of a prime. The procedure involves reducing the problem of encoding over qudits with d = pkto a problem similar to encoding over qudits with d = p.

IEEE Globecom Workshops (GC Wkshps)•Dec 1, 2018•5 citations
We discuss how blind quantum computing generalizes to multilevel quantum systems (qudits), which offers advantages compared with 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.
Encoding of Quantum Stabilizer Codes Over Qudits with d=pkd=p^{k}d=pk
Stabilizer codes over qudits have been widely studied but their encoding procedures have not been investigated in detail by many. The encoding procedure proposed previously by Grassl et al. generates the stabilizer codes over qudits for prime d, while it may only generate a subspace of the codespace over qudits where d is a power of a prime. In this paper, we propose an encoding procedure to generate the stabilizer codes over qudits for d being a power of a prime. The procedure involves reducing the problem of encoding over qudits with d = pkto a problem similar to encoding over qudits with d = p.