اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدHidden qubit cluster states
79
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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.
قيم البحث
اقرأ أيضاً
We demonstrate the application of pattern recognition algorithms via hidden Markov models (HMM) for qubit readout. This scheme provides a state-path trajectory approach capable of detecting qubit state transitions and makes for a robust classificatio
n scheme with higher starting state assignment fidelity than when compared to a multivariate Gaussian (MVG) or a support vector machine (SVM) scheme. Therefore, the method also eliminates the qubit-dependent readout time optimization requirement in current schemes. Using a HMM state discriminator we estimate fidelities reaching the ideal limit. Unsupervised learning gives access to transition matrix, priors, and IQ distributions, providing a toolbox for studying qubit state dynamics during strong projective readout.
In circuit-based quantum computing, the available gate set typically consists of single-qubit gates acting on each individual qubit and at least one entangling gate between pairs of qubits. In certain physical architectures, however, some qubits may
be hidden and lacking direct addressability through dedicated control and readout lines, for instance because of limited on-chip routing capabilities, or because the number of control lines becomes a limiting factor for many-qubit systems. In this case, no single-qubit operations can be applied to the hidden qubits and their state cannot be measured directly. Instead, they may be controlled and read out only via single-qubit operations on connected control qubits and a suitable set of two-qubit gates. We first discuss the impact of such restricted control capabilities on the quantum volume of specific qubit coupling networks. We then experimentally demonstrate full control and measurement capabilities in a superconducting two-qubit device with local single-qubit control and iSWAP and controlled-phase two-qubit interactions enabled by a tunable coupler. We further introduce an iterative tune-up process required to completely characterize the gate set used for quantum process tomography and evaluate the resulting gate fidelities.
Quantum key agreement requires all participants to recover the shared key together, so it is crucial to resist the participant attack. In this paper, we propose a verifiable multi-party quantum key agreement protocol based on the six-qubit cluster st
ates. A verifiable distributor who preserves some subsequences of the six-qubit cluster states is introduced into this protocol, thus the participants can not obtain the shared key in advance. Besides, the correctness and simultaneity of the shared key are guaranteed by the trusted design combiner and homomorphic hash function. Furthermore, the security analysis shows that the new protocol can resist the external and internal attacks.
We capitalize on a multipolar expansion of the polarisation density matrix, in which multipoles appear as successive moments of the Stokes variables. When all the multipoles up to a given order $K$ vanish, we can properly say that the state is $K$th-
order unpolarized, as it lacks of polarization information to that order. First-order unpolarized states coincide with the corresponding classical ones, whereas unpolarized to any order tally with the quantum notion of fully invariant states. In between these two extreme cases, there is a rich variety of situations that are explored here. The existence of textit{hidden} polarisation emerges in a natural way in this context.
We report an experimental realization of one-way quantum computing on a two-photon four-qubit cluster state. This is accomplished by developing a two-photon cluster state source entangled both in polarization and spatial modes. With this special sour
ce, we implemented a highly efficient Grovers search algorithm and high-fidelity two qubits quantum gates. Our experiment demonstrates that such cluster states could serve as an ideal source and a building block for rapid and precise optical quantum computation.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
