Bayesian retrodiction of quantum supermaps
- URL: http://arxiv.org/abs/2408.07885v2
- Date: Tue, 27 Aug 2024 05:12:02 GMT
- Title: Bayesian retrodiction of quantum supermaps
- Authors: Ge Bai,
- Abstract summary: We study a higher-order generalization of the quantum Bayes' rule by considering a quantum process undergoing a quantum supermap.
For a few families of initial beliefs, we show that a similar unification is possible -- the rules to update the belief of quantum channels can be implemented via a "reverse" quantum supermap.
- Score: 0.27195102129094995
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The Petz map has been established as a quantum version of the Bayes' rule. It unifies the conceptual belief update rule of a quantum state observed after a forward quantum process, and the operational reverse process that brings the final state to a recovered state equal to the updated belief, counteracting the forward process. Here, we study a higher-order generalization of the quantum Bayes' rule by considering a quantum process undergoing a quantum supermap. For a few families of initial beliefs, we show that a similar unification is possible -- the rules to update the belief of quantum channels can be implemented via a "reverse" quantum supermap, which we call the retrodiction supermap, allowing for applications such as error correction in quantum cloud computing. Analytical solutions are provided for those families, while a recipe for arbitrary initial beliefs is yet to be found.
Related papers
- Experimental Virtual Quantum Broadcasting [1.2050877805909537]
We develop a quantum circuit integrated with a post-processing protocol to implement virtual quantum broadcasting.
We experimentally verify the closest physical map, known as the optimal quantum cloner, to the virtual broadcasting map.
We identify the difference in statistical outcomes between the input of the optimal quantum cloner and its local output as the fundamental error imposed by quantum mechanics.
arXiv Detail & Related papers (2025-01-20T10:33:35Z) - The multimode conditional quantum Entropy Power Inequality and the squashed entanglement of the extreme multimode bosonic Gaussian channels [53.253900735220796]
Inequality determines the minimum conditional von Neumann entropy of the output of the most general linear mixing of bosonic quantum modes.
Bosonic quantum systems constitute the mathematical model for the electromagnetic radiation in the quantum regime.
arXiv Detail & Related papers (2024-10-18T13:59:50Z) - Quantum state tomography with disentanglement algorithm [0.0]
We use variational quantum circuits to disentangle the quantum state to a product of computational zero states.
Inverse evolution of the zero states reconstructs the quantum state up to an overall phase.
Our method is universal and imposes no specific ansatz or constrain on the quantum state.
arXiv Detail & Related papers (2023-10-10T03:11:12Z) - Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical.
We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more.
Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
arXiv Detail & Related papers (2023-03-02T14:18:17Z) - Approximation of the Nearest Classical-Classical State to a Quantum
State [0.0]
A revolutionary step in computation is driven by quantumness or quantum correlations, which are permanent in entanglements but often in separable states.
The exact quantification of quantumness is an NP-hard problem; thus, we consider alternative approaches to approximate it.
We show that the objective value decreases along the flow by proofs and numerical results.
arXiv Detail & Related papers (2023-01-23T08:26:17Z) - Quantum Computing by Quantum Walk on Quantum Slide [9.087383504015682]
Continuous-time quantum walk is one of the alternative approaches to quantum computation.
We show how quantum slide can be further applied to realize universal quantum computation.
arXiv Detail & Related papers (2022-11-16T04:19:13Z) - The power of noisy quantum states and the advantage of resource dilution [62.997667081978825]
Entanglement distillation allows to convert noisy quantum states into singlets.
We show that entanglement dilution can increase the resilience of shared quantum states to local noise.
arXiv Detail & Related papers (2022-10-25T17:39:29Z) - Quantum Entanglement with Self-stabilizing Token Ring for Fault-tolerant
Distributed Quantum Computing System [0.0]
This paper shows how to construct quantum entanglement states of n qubits based on a self-stabilizing token ring algorithm.
The entangled states can be applied to the fields of the quantum network, quantum Internet, distributed quantum computing, and quantum cloud.
arXiv Detail & Related papers (2022-09-23T01:20:36Z) - Post-Quantum Succinct Arguments: Breaking the Quantum Rewinding Barrier [73.70426431502803]
We prove that Kilian's four-message succinct argument system is post-quantum secure in the standard model.
This yields the first post-quantum succinct argument system from any falsifiable assumption.
arXiv Detail & Related papers (2021-03-15T05:09:17Z) - Direct Quantum Communications in the Presence of Realistic Noisy
Entanglement [69.25543534545538]
We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement.
Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
arXiv Detail & Related papers (2020-12-22T13:06:12Z) - Jumptime unraveling of Markovian open quantum systems [68.8204255655161]
We introduce jumptime unraveling as a distinct description of open quantum systems.
quantum jump trajectories emerge, physically, from continuous quantum measurements.
We demonstrate that quantum trajectories can also be ensemble-averaged at specific jump counts.
arXiv Detail & Related papers (2020-01-24T09:35:32Z)
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.