Efficiently Generation of Cluster States via Time-Delayed Feedback in Matrix Representation

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Zou, Jia-Jin, Qin, Jian-Wei, Nori, Franco, Xiang, Ze-Liang
Format: Preprint
Publié: 2025
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866909697993342976
author Zou, Jia-Jin
Qin, Jian-Wei
Nori, Franco
Xiang, Ze-Liang
author_facet Zou, Jia-Jin
Qin, Jian-Wei
Nori, Franco
Xiang, Ze-Liang
contents Cluster states, as highly entangled multi-qubit states, are widely used as essential resources for quantum communication and quantum computing. However, due to the diverse requirements of applications for cluster states with specific entanglement structures, a universal generation protocol is still lacking. Here we develop a matrix representation according to the characteristics of time-delayed feedback (TDF) and propose a protocol for generating arbitrary cluster states with multiple TDFs. The matrix representation also allows us to optimize the generation process to reduce TDF usage, thus improving efficiency. In particular, we demonstrate a tree-cluster-state generation process that requires only one TDF. Moreover, accounting for the critical loss mechanisms and imperfections in our protocol, we discuss the additional losses caused by multiple TDFs and evaluate the fidelity of the resulting cluster states.
format Preprint
id arxiv_https___arxiv_org_abs_2507_15725
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Efficiently Generation of Cluster States via Time-Delayed Feedback in Matrix Representation
Zou, Jia-Jin
Qin, Jian-Wei
Nori, Franco
Xiang, Ze-Liang
Quantum Physics
Cluster states, as highly entangled multi-qubit states, are widely used as essential resources for quantum communication and quantum computing. However, due to the diverse requirements of applications for cluster states with specific entanglement structures, a universal generation protocol is still lacking. Here we develop a matrix representation according to the characteristics of time-delayed feedback (TDF) and propose a protocol for generating arbitrary cluster states with multiple TDFs. The matrix representation also allows us to optimize the generation process to reduce TDF usage, thus improving efficiency. In particular, we demonstrate a tree-cluster-state generation process that requires only one TDF. Moreover, accounting for the critical loss mechanisms and imperfections in our protocol, we discuss the additional losses caused by multiple TDFs and evaluate the fidelity of the resulting cluster states.
title Efficiently Generation of Cluster States via Time-Delayed Feedback in Matrix Representation
topic Quantum Physics
url https://arxiv.org/abs/2507.15725