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:1009.3486 · Quantum Information and Computation

Ground state blind quantum computation on AKLT state

Tomoyuki Morimae, Vedran Dunjko, Elham Kashefi

Published Mar 1, 2015• 66 citations
arXivHTMLPDF

Abstract

The blind quantum computing protocols (BQC) enable a classical client with limited quantum technology to delegate a computation to the quantum server(s) in such a way that the privacy of the computation is preserved. Here we present a new scheme for BQC that uses the concept of the measurement based quantum computing with the novel resource state of Affleck-Kennedy-Lieb-Tasaki (AKLT) chains leading to more robust computation. AKLT states are physically motivated resource as they are gapped ground states of a physically natural Hamiltonian in condensed matter physics. Our BQC protocol can enjoy the advantages of AKLT resource states (in a multiserver setup), such as the cooling preparation of the resource state, the energy-gap protection of the quantum computation. It also provides a simple and efficient preparation of the resource state in linear optics with biphotons.

DOI
10.26421/qic15.3-4-2

Related papers

Measurement-based quantum computation with an optical two-dimensional Affleck–Kennedy–Lieb–Tasaki state

Kai Liu, Wendong Li, Yongjian Gu

Measurement-based quantum computation can achieve universal quantum computation via simply performing single-qubit measurements alone on an entangled resource state. Instead of the canonical resource state–cluster state, we pay great attention to another resource state, the Affleck–Kennedy–Lieb–Tasaki (AKLT) state, which is a nondegenerate ground state of a nearest-neighbor two-body interaction Hamiltonian. We propose an optical scheme to generate a two-dimensional AKLT state defined on the honeycomb lattice. In our proposal, three photons from different singlet states are projected onto a spin-32 particle comprising the AKLT state with maximum success probability 38. We also show the controlled-NOT gate can be implemented on this photonic AKLT state via projective measurement using linear optics and photodetection.

Journal of the Optical Society of America B•Oct 14, 2014•4 citations

Optical spin-1 chain and its use as a quantum-computational wire

Andrew S. Darmawan, Stephen D. Bartlett

Measurement-based quantum computing, a powerful alternative to the standard circuit model, proceeds using only local adaptive measurements on a highly entangled resource state of many spins on a graph or lattice. Along with the canonical cluster state, the valence-bond solid ground state on a chain of spin-1 particles, studied by Affleck, Kennedy, Lieb, and Tasaki (AKLT), is such a resource state. We propose a simulation of this AKLT state using linear optics, wherein we can make use of the high-fidelity projective measurements that are commonplace in quantum-optical experiments, and describe how quantum logic gates can be performed on this chain. In our proposed implementation, the spin-1 particles comprising the AKLT state are encoded on polarization biphotons: three-level systems consisting of pairs of polarized photons in the same spatio-temporal mode. A logical qubit encoded on the photonic AKLT state can be initialized, read out, and have an arbitrary single-qubit unitary applied to it by performing projective measurements on the constituent biphotons. For MBQC, biphoton measurements are required which cannot be deterministically performed using only linear optics and photodetection.

arXiv:1004.3626•Physical Review A•Jul 26, 2010•18 citations

Blind quantum computation with a noise channel

Yu‐Bo Sheng, Lan Zhou

Blind quantum computation (BQC) is a type of quantum computation model. For a client (Alice) who does not have enough sophisticated technology and knowledge to perform universal quantum computation, BQC allows her to resort to a remote quantum computation server (Bob) to delegate universal quantum computation. During the computation, Bob cannot know Alice's inputs, algorithm, and outputs. A single-server BQC protocol requires Alice to prepare and distribute single-photon states to Bob. Unfortunately, the distributed single photons will suffer from noise. The noise not only leads to the decoherence of the single-photon state, but also leads to photon loss. In this protocol, we describe an antinoise single-server BQC protocol. This protocol has three advantages. First, Alice does not require any auxiliary resources, which reduces the client's economic cost. Second, this protocol not only can protect the state from the collective noise, but also can distill the single photon from photon loss. Third, the noise processer in Bob is based on the linear optics so that it is feasible in experiment. This protocol may show that it is possible to perform a single-server BQC protocol in a noise channel.

arXiv:1609.08902•Physical Review A•Nov 27, 2018•74 citations

Robust and efficient verification of graph states in blind measurement-based quantum computation

Zihao Li, Huangjun Zhu, Masahito Hayashi

Abstract Blind quantum computation (BQC) is a secure quantum computation method that protects the privacy of clients. Measurement-based quantum computation (MBQC) is a promising approach for realizing BQC. To obtain reliable results in blind MBQC, it is crucial to verify whether the resource graph states are accurately prepared in the adversarial scenario. However, previous verification protocols for this task are too resource-consuming or noise-susceptible to be applied in practice. Here, we propose a robust and efficient protocol for verifying arbitrary graph states with any prime local dimension in the adversarial scenario, which leads to a robust and efficient protocol for verifying the resource state in blind MBQC. Our protocol requires only local Pauli measurements and is thus easy to realize with current technologies. Nevertheless, it can achieve optimal scaling behaviors with respect to the system size and the target precision as quantified by the infidelity and significance level, which has never been achieved before. Notably, our protocol can exponentially enhance the scaling behavior with the significance level.

arXiv:2305.10742•npj Quantum Information•Nov 14, 2023•28 citations

Universal measurement-based quantum computation with spin-2 Affleck-Kennedy-Lieb-Tasaki states

Tzu-Chieh Wei, Robert Raussendorf

We demonstrate that the spin-2 Affleck-Kennedy-Lieb-Tasaki (AKLT) state on a square lattice is a universal resource for measurement-based quantum computation. Our proof is done by locally converting the AKLT to two-dimensional random planar graph states and by certifying that with a high probability the resulting random graphs are in the supercritical phase of percolation using Monte Carlo simulations. One key enabling point is the exact weight formula that we derive for arbitrary measurement outcomes according to a spin-2 positive operator-valued measure on all spins. We also argue that the spin-2 AKLT state on a three-dimensional diamond lattice is a universal resource, the advantage of which would be the possibility of implementing fault-tolerant quantum computation with topological protection. In addition, as we deform the AKLT Hamiltonian, there is a finite region in which the ground state can still support a universal resource before making a transition in its quantum computational power.

arXiv:1501.07571•Physical Review A•Jul 9, 2015•38 citations

Blind Quantum Computation with a Small Quantum Server

Daniel Lovsted, Filipa C. R. Peres, Joshua Nevin +2 more

Blind quantum computation (BQC) allows low-resource clients to securely delegate computations to a quantum server, but server resource costs scale with the computation size, posing a bottleneck for implementations. By leveraging Pauli-based computation (PBC), we achieve BQC with a server whose size depends only on the non-Clifford gate count. Our protocol inherits fault tolerance and qubit virtualization from PBC and reveals that classical-client BQC is possible even in the absence of classical simulability. Finally, we present an entanglement-based dual protocol that performs a resource state computation with a dramatically reduced execution cost.

quant-pharXiv:2609.20729•Sep 18, 2026•1 citation
The blind quantum computing protocols (BQC) enable a classical client with limited quantum technology to delegate a computation to the quantum server(s) in such a way that the privacy of the computation is preserved. Here we present a new scheme for BQC that uses the concept of the measurement based quantum computing with the novel resource state of Affleck-Kennedy-Lieb-Tasaki (AKLT) chains leading to more robust computation. AKLT states are physically motivated resource as they are gapped ground states of a physically natural Hamiltonian in condensed matter physics. Our BQC protocol can enjoy the advantages of AKLT resource states (in a multiserver setup), such as the cooling preparation of the resource state, the energy-gap protection of the quantum computation. It also provides a simple and efficient preparation of the resource state in linear optics with biphotons.
Measurement-based quantum computation can achieve universal quantum computation via simply performing single-qubit measurements alone on an entangled resource state. Instead of the canonical resource state–cluster state, we pay great attention to another resource state, the Affleck–Kennedy–Lieb–Tasaki (AKLT) state, which is a nondegenerate ground state of a nearest-neighbor two-body interaction Hamiltonian. We propose an optical scheme to generate a two-dimensional AKLT state defined on the honeycomb lattice. In our proposal, three photons from different singlet states are projected onto a spin-32 particle comprising the AKLT state with maximum success probability 38. We also show the controlled-NOT gate can be implemented on this photonic AKLT state via projective measurement using linear optics and photodetection.
Measurement-based quantum computing, a powerful alternative to the standard circuit model, proceeds using only local adaptive measurements on a highly entangled resource state of many spins on a graph or lattice. Along with the canonical cluster state, the valence-bond solid ground state on a chain of spin-1 particles, studied by Affleck, Kennedy, Lieb, and Tasaki (AKLT), is such a resource state. We propose a simulation of this AKLT state using linear optics, wherein we can make use of the high-fidelity projective measurements that are commonplace in quantum-optical experiments, and describe how quantum logic gates can be performed on this chain. In our proposed implementation, the spin-1 particles comprising the AKLT state are encoded on polarization biphotons: three-level systems consisting of pairs of polarized photons in the same spatio-temporal mode. A logical qubit encoded on the photonic AKLT state can be initialized, read out, and have an arbitrary single-qubit unitary applied to it by performing projective measurements on the constituent biphotons. For MBQC, biphoton measurements are required which cannot be deterministically performed using only linear optics and photodetection.
Blind quantum computation (BQC) is a type of quantum computation model. For a client (Alice) who does not have enough sophisticated technology and knowledge to perform universal quantum computation, BQC allows her to resort to a remote quantum computation server (Bob) to delegate universal quantum computation. During the computation, Bob cannot know Alice's inputs, algorithm, and outputs. A single-server BQC protocol requires Alice to prepare and distribute single-photon states to Bob. Unfortunately, the distributed single photons will suffer from noise. The noise not only leads to the decoherence of the single-photon state, but also leads to photon loss. In this protocol, we describe an antinoise single-server BQC protocol. This protocol has three advantages. First, Alice does not require any auxiliary resources, which reduces the client's economic cost. Second, this protocol not only can protect the state from the collective noise, but also can distill the single photon from photon loss. Third, the noise processer in Bob is based on the linear optics so that it is feasible in experiment. This protocol may show that it is possible to perform a single-server BQC protocol in a noise channel.
Abstract Blind quantum computation (BQC) is a secure quantum computation method that protects the privacy of clients. Measurement-based quantum computation (MBQC) is a promising approach for realizing BQC. To obtain reliable results in blind MBQC, it is crucial to verify whether the resource graph states are accurately prepared in the adversarial scenario. However, previous verification protocols for this task are too resource-consuming or noise-susceptible to be applied in practice. Here, we propose a robust and efficient protocol for verifying arbitrary graph states with any prime local dimension in the adversarial scenario, which leads to a robust and efficient protocol for verifying the resource state in blind MBQC. Our protocol requires only local Pauli measurements and is thus easy to realize with current technologies. Nevertheless, it can achieve optimal scaling behaviors with respect to the system size and the target precision as quantified by the infidelity and significance level, which has never been achieved before. Notably, our protocol can exponentially enhance the scaling behavior with the significance level.
We demonstrate that the spin-2 Affleck-Kennedy-Lieb-Tasaki (AKLT) state on a square lattice is a universal resource for measurement-based quantum computation. Our proof is done by locally converting the AKLT to two-dimensional random planar graph states and by certifying that with a high probability the resulting random graphs are in the supercritical phase of percolation using Monte Carlo simulations. One key enabling point is the exact weight formula that we derive for arbitrary measurement outcomes according to a spin-2 positive operator-valued measure on all spins. We also argue that the spin-2 AKLT state on a three-dimensional diamond lattice is a universal resource, the advantage of which would be the possibility of implementing fault-tolerant quantum computation with topological protection. In addition, as we deform the AKLT Hamiltonian, there is a finite region in which the ground state can still support a universal resource before making a transition in its quantum computational power.
Blind quantum computation (BQC) allows low-resource clients to securely delegate computations to a quantum server, but server resource costs scale with the computation size, posing a bottleneck for implementations. By leveraging Pauli-based computation (PBC), we achieve BQC with a server whose size depends only on the non-Clifford gate count. Our protocol inherits fault tolerance and qubit virtualization from PBC and reveals that classical-client BQC is possible even in the absence of classical simulability. Finally, we present an entanglement-based dual protocol that performs a resource state computation with a dramatically reduced execution cost.