Controlled remote implementation of operations via graph states
- URL: http://arxiv.org/abs/2210.14674v2
- Date: Sun, 18 Dec 2022 13:54:55 GMT
- Title: Controlled remote implementation of operations via graph states
- Authors: Xinyu Qiu and Lin Chen
- Abstract summary: We propose protocols for controlled remote implementation of operations with convincing control power.
Sharing a $(2N+1)$-partite graph state, $2N$ participants collaborate to prepare the stator and realize the operation.
We show that the control power of our protocol is reliable by positive operator valued measurement.
- Score: 7.238541917115604
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We propose protocols for controlled remote implementation of operations with
convincing control power. Sharing a $(2N+1)$-partite graph state, $2N$
participants collaborate to prepare the stator and realize the operation
$\otimes_{j=1}^N\exp{[i\alpha_j\sigma_{n_{O_j}}]}$ on $N$ unknown states for
distributed systems $O_j$, with the permission of a controller. All the
implementation requirements of our protocol can be satisfied by means of local
operations and classical communications, and the experimental feasibility is
presented according to current techniques. We characterize the entanglement
requirement of our protocol in terms of geometric measure of entanglement. It
turns out to be economic to realize the control function from the perspective
of entanglement cost. Further we show that the control power of our protocol is
reliable by positive operator valued measurement.
Related papers
- Client-Aided Secure Two-Party Computation of Dynamic Controllers [0.7673339435080445]
The proposed protocol realizes outsourcing of controller computation to two servers.
The feasibility of the protocol is demonstrated through numerical examples of PID and observer-based controls.
arXiv Detail & Related papers (2025-03-04T01:35:47Z) - Subversion Strategy Eval: Can language models statelessly strategize to subvert control protocols? [50.62012690460685]
This paper investigates how well AI systems can generate and act on their own strategies for subverting control protocols.
An AI system may need to reliably generate optimal plans in each context, take actions with well-calibrated probabilities, and coordinate plans with other instances of itself without communicating.
arXiv Detail & Related papers (2024-12-17T02:33:45Z) - Efficient State Preparation for Metrology and Quantum Error Correction
with Global Control [0.0]
We introduce a simple, experimentally realizable protocol that can prepare any specific superposition of permutationally invariant qubit states, also known as Dicke states.
We demonstrate the utility of our protocol by numerically preparing several states with theoretical infidelities $1-mathcalF10-4$.
We estimate that the protocol achieves fidelities $gtrsim 95%$ in the presence of typical experimental noise levels.
arXiv Detail & Related papers (2023-12-08T14:28:34Z) - Engineering unsteerable quantum states with active feedback [0.5892638927736115]
We propose active steering protocols for quantum state preparation in quantum circuits.
We show that the standard fidelity does not give a useful cost function; instead, successful steering is achieved by including local fidelity terms.
numerical simulations suggest that the active steering protocol can reach arbitrarily designated target states.
arXiv Detail & Related papers (2023-08-01T09:01:51Z) - Cooperative Multi-Agent Reinforcement Learning: Asynchronous
Communication and Linear Function Approximation [77.09836892653176]
We study multi-agent reinforcement learning in the setting of episodic Markov decision processes.
We propose a provably efficient algorithm based on value that enable asynchronous communication.
We show that a minimal $Omega(dM)$ communication complexity is required to improve the performance through collaboration.
arXiv Detail & Related papers (2023-05-10T20:29:29Z) - Optimal State Manipulation for a Two-Qubit System Driven by Coherent and
Incoherent Controls [77.34726150561087]
State preparation is important for optimal control of two-qubit quantum systems.
We exploit two physically different coherent control and optimize the Hilbert-Schmidt target density matrices.
arXiv Detail & Related papers (2023-04-03T10:22:35Z) - Towards Semantic Communication Protocols: A Probabilistic Logic
Perspective [69.68769942563812]
We propose a semantic protocol model (SPM) constructed by transforming an NPM into an interpretable symbolic graph written in the probabilistic logic programming language (ProbLog)
By leveraging its interpretability and memory-efficiency, we demonstrate several applications such as SPM reconfiguration for collision-avoidance.
arXiv Detail & Related papers (2022-07-08T14:19:36Z) - Data post-processing for the one-way heterodyne protocol under
composable finite-size security [62.997667081978825]
We study the performance of a practical continuous-variable (CV) quantum key distribution protocol.
We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime.
This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
arXiv Detail & Related papers (2022-05-20T12:37:09Z) - Feedback-assisted quantum search by continuous-time quantum walks [58.720142291102135]
We address the quantum search of a target node on a cycle graph by means of a quantum walk assisted by continuous measurement and feedback.
In particular, our protocol is able to drive the walker to a desired target node.
arXiv Detail & Related papers (2022-01-12T16:59:53Z) - Minimum Entanglement Protocols for Function Estimation [0.0]
We prove necessary and sufficient conditions for the existence of optimal protocols using at most $k$-partite entanglement.
Our protocols require some amount of time-dependent control, and we show that a related class of time-independent protocols fail to achieve optimal scaling for generic functions.
arXiv Detail & Related papers (2021-10-14T18:00:00Z) - Entanglement purification by counting and locating errors with
entangling measurements [62.997667081978825]
We consider entanglement purification protocols for multiple copies of qubit states.
We use high-dimensional auxiliary entangled systems to learn about number and positions of errors in the noisy ensemble.
arXiv Detail & Related papers (2020-11-13T19:02:33Z) - Optimal State Transfer and Entanglement Generation in Power-law
Interacting Systems [0.5592394503914488]
We present an optimal protocol for encoding an unknown qubit state into a multiqubit Greenberger-Horne-Zeilinger-like state.
The protocol has a wide range of applications, including in quantum sensing, quantum computing, and preparation of topologically ordered states.
arXiv Detail & Related papers (2020-10-06T18:00:02Z) - Simple scheme for extracting work with a single bath [0.0]
The protocol is based on a recent work definition involving only a single bath.
We quantify both the extracted work and the ideal efficiency of the process also giving maximum bounds for them.
Our proposal makes use of simple operations not needing fine control.
arXiv Detail & Related papers (2018-06-29T12:44:38Z)
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.