Hidden qubit cluster states
- URL: http://arxiv.org/abs/2103.11556v3
- Date: Fri, 6 Aug 2021 03:50:33 GMT
- Title: Hidden qubit cluster states
- Authors: Giacomo Pantaleoni, Ben Q. Baragiola, Nicolas C. Menicucci
- Abstract summary: Continuous-variable cluster states (CVCSs) can be supplemented with Gottesman-Kitaev-Preskill (GKP) states to form a hybrid cluster state.
We find that each of these contains a "hidden" qubit cluster state across their logical subsystems, which lies at the heart of their utility for measurement-based quantum computing.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Continuous-variable cluster states (CVCSs) can be supplemented with
Gottesman-Kitaev-Preskill (GKP) states to form a hybrid cluster state with the
power to execute universal, fault-tolerant quantum computing in a
measurement-based fashion. As the resource states that comprise a hybrid
cluster state are of a very different nature, a natural question arises: Why do
GKP states interface so well with CVCSs? To answer this question, we apply the
recently introduced subsystem decomposition of a bosonic mode, which divides a
mode into logical and gauge-mode subsystems, to three types of cluster state:
CVCSs, GKP cluster states, and hybrid CV-GKP cluster states. We find that each
of these contains a "hidden" qubit cluster state across their logical
subsystems, which lies at the heart of their utility for measurement-based
quantum computing. To complement the analytical approach, we introduce a simple
graphical description of these CV-mode cluster states that depicts precisely
how the hidden qubit cluster states are entangled with the gauge modes, and we
outline how these results would extend to the case of finitely squeezed states.
This work provides important insight that is both conceptually satisfying and
helps to address important practical issues like when a simpler resource (such
as a Gaussian state) can stand in for a more complex one (like a GKP state),
leading to more efficient use of the resources available for CV quantum
computing.
Related papers
- Self-Supervised Graph Embedding Clustering [70.36328717683297]
K-means one-step dimensionality reduction clustering method has made some progress in addressing the curse of dimensionality in clustering tasks.
We propose a unified framework that integrates manifold learning with K-means, resulting in the self-supervised graph embedding framework.
arXiv Detail & Related papers (2024-09-24T08:59:51Z) - Distributing Arbitrary Quantum Cluster States by Graph Transformation [3.3288564690349554]
Quantum cluster state is a special class of nonlocal state among quantum particles.
We develop an algorithm to establish arbitrary quantum cluster states of strong entanglement structures at a much lower cost than the state of the art.
arXiv Detail & Related papers (2024-04-08T14:06:42Z) - Sufficient condition for universal quantum computation using bosonic
circuits [44.99833362998488]
We focus on promoting circuits that are otherwise simulatable to computational universality.
We first introduce a general framework for mapping a continuous-variable state into a qubit state.
We then cast existing maps into this framework, including the modular and stabilizer subsystem decompositions.
arXiv Detail & Related papers (2023-09-14T16:15:14Z) - Reinforcement Graph Clustering with Unknown Cluster Number [91.4861135742095]
We propose a new deep graph clustering method termed Reinforcement Graph Clustering.
In our proposed method, cluster number determination and unsupervised representation learning are unified into a uniform framework.
In order to conduct feedback actions, the clustering-oriented reward function is proposed to enhance the cohesion of the same clusters and separate the different clusters.
arXiv Detail & Related papers (2023-08-13T18:12:28Z) - Coherent-cluster-state generation in networks of degenerate optical
parametric oscillators [4.015029887580199]
We show that coherent cluster states can be generated in DOPO networks with the help of beam splitters and classical pumps.
We map the generated states to an effective spin space using modular variables, which allows us to apply entanglement criteria tailored for spin-based cluster states.
arXiv Detail & Related papers (2023-01-31T14:34:53Z) - Optical cluster-state generation with unitary averaging [0.0]
Cluster states are the essential resource used in the implementation of Fusion-based quantum computation (FBQC)
We introduce a method to generate high-fidelity optical cluster states by utilising the concept of unitary averaging.
This error averaging technique is entirely passive and can be readily incorporated into the proposed PsiQuantum's FBQC architecture.
arXiv Detail & Related papers (2022-09-30T07:43:18Z) - On Mitigating Hard Clusters for Face Clustering [48.39472979642971]
Face clustering is a promising way to scale up face recognition systems using large-scale unlabeled face images.
We introduce two novel modules, Neighborhood-Diffusion-based Density (NDDe) and Transition-Probability-based Distance (TPDi)
Our experiments on multiple benchmarks show that each module contributes to the final performance of our method.
arXiv Detail & Related papers (2022-07-25T03:55:15Z) - Local Sample-weighted Multiple Kernel Clustering with Consensus
Discriminative Graph [73.68184322526338]
Multiple kernel clustering (MKC) is committed to achieving optimal information fusion from a set of base kernels.
This paper proposes a novel local sample-weighted multiple kernel clustering model.
Experimental results demonstrate that our LSWMKC possesses better local manifold representation and outperforms existing kernel or graph-based clustering algo-rithms.
arXiv Detail & Related papers (2022-07-05T05:00:38Z) - Subsystem analysis of continuous-variable resource states [0.0]
Continuous-variable (CV) cluster states are a universal resource for fault-tolerant quantum computation.
We generalize the recently introduced subsystem decomposition of a bosonic code to analyze CV cluster-state quantum computing.
arXiv Detail & Related papers (2021-02-21T03:50:10Z) - Kernel learning approaches for summarising and combining posterior
similarity matrices [68.8204255655161]
We build upon the notion of the posterior similarity matrix (PSM) in order to suggest new approaches for summarising the output of MCMC algorithms for Bayesian clustering models.
A key contribution of our work is the observation that PSMs are positive semi-definite, and hence can be used to define probabilistically-motivated kernel matrices.
arXiv Detail & Related papers (2020-09-27T14:16:14Z)
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.