Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userQuantum Secret Sharing with Continuous Variable Graph State
291
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
In this paper we study the protocol implementation and property analysis for several practical quantum secret sharing (QSS) schemes with continuous variable graph state (CVGS). For each QSS scheme, an implementation protocol is designed according to its secret and communication channel types. The estimation error is derived explicitly, which facilitates the unbiased estimation and error variance minimization. It turns out that only under infinite squeezing can the secret be perfectly reconstructed. Furthermore, we derive the condition for QSS threshold protocol on a weighted CVGS. Under certain conditions, the perfect reconstruction of the secret for two non-cooperative groups is exclusive, i.e. if one group gets the secret perfectly, the other group cannot get any information about the secret.
rate research
Read More
We present a scheme to conditionally engineer an optical quantum system via continuous-variable measurements. This scheme yields high-fidelity squeezed single photon and superposition of coherent states, from input single and two photon Fock states respectively. The input Fock state is interacted with an ancilla squeezed vacuum state using a beam-splitter. We transform the quantum system by post-selecting on the continuous-observable measurement outcome of the ancilla state. We experimentally demonstrate the principles of this scheme using displaced coherent states and measure experimentally fidelities that are only achievable using quantum resources.
In this paper we define a kind of decomposition for a quantum access structure. We propose a conception of minimal maximal quantum access structure and obtain a sufficient and necessary condition for minimal maximal quantum access structure, which shows the relationship between the number of minimal authorized sets and that of the players. Moreover, we investigate the construction of efficient quantum secret schemes by using these techniques, a decomposition and minimal maximal quantum access structure. A major advantage of these techniques is that it allows us to construct a method to realize a general quantum access structure. For these quantum access structures, we present two quantum secret schemes via the idea of concatenation or a decomposition of a quantum access structure. As a consequence, the application of these techniques allow us to save more quantum shares and reduce more cost than the existing scheme.
We develop a connection between tripartite information $I_3$, secret sharing protocols and multi-unitaries. This leads to explicit ((2,3)) threshold schemes in arbitrary dimension minimizing tripartite information $I_3$. As an application we show that Page scrambling unitaries simultaneously work for all secrets shared by Alice. Using the $I_3$-Ansatz for imperfect sharing schemes we discover examples of VIP sharing schemes.
Graph states are a unique resource for quantum information processing, such as measurement-based quantum computation. Here, we theoretically investigate using continuous-variable graph states for single-parameter quantum metrology, including both phase and displacement sensing. We identified the optimal graph states for the two sensing modalities and showed that Heisenberg scaling of the accuracy for both phase and displacement sensing can be achieved with local homodyne measurements.
Secret sharing allows three or more parties to share secret information which can only be decrypted through collaboration. It complements quantum key distribution as a valuable resource for securely distributing information. Here we take advantage of hybrid spin and orbital angular momentum states to access a high dimensional encoding space, demonstrating a protocol that is easily scalable in both dimension and participants. To illustrate the versatility of our approach, we first demonstrate the protocol in two dimensions, extending the number of participants to ten, and then demonstrate the protocol in three dimensions with three participants, the highest realisation of participants and dimensions thus far. We reconstruct secrets depicted as images with a fidelity of up to 0.979. Moreover, our scheme exploits the use of conventional linear optics to emulate the quantum gates needed for transitions between basis modes on a high dimensional Hilbert space with the potential of up to 1.225 bits of encoding capacity per transmitted photon. Our work offers a practical approach for sharing information across multiple parties, a crucial element of any quantum network.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
