On errors generated by unitary dynamics of bipartite quantum systems

• URL: http://arxiv.org/abs/2008.00290v1
• Date: Sat, 1 Aug 2020 16:22:19 GMT
• Title: On errors generated by unitary dynamics of bipartite quantum systems
• Authors: G.G. Amosov, A.S. Mokeev
• Abstract summary: Given a quantum channel it is possible to define the non-commutative operator graph whose properties determine a possibility of error-free transmission of information via this channel. We are discussing the opposite problem of a proper definition of errors that some graph corresponds to.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Given a quantum channel it is possible to define the non-commutative operator graph whose properties determine a possibility of error-free transmission of information via this channel. The corresponding graph has a straight definition through Kraus operators determining quantum errors. We are discussing the opposite problem of a proper definition of errors that some graph corresponds to. Taking into account that any graph is generated by some POVM we give a solution to such a problem by means of the Naimark dilatation theorem. Using our approach we construct errors corresponding to the graphs generated by unitary dynamics of bipartite quantum systems. The cases of POVMs on the circle group ${\mathbb Z}_n$ and the additive group $\mathbb R$ are discussed. As an example we construct the graph corresponding to the errors generated by dynamics of two mode quantum oscillator.

Related papers

• On the construction of a quantum channel corresponding to non-commutative graph for a qubit interacting with quantum oscillator [0.0]
  We consider error correction based on the theory of non-commutative graphs. We construct a quantum channel generating the non-commutative graph as a linear envelope of the POVM. For this model the quantum anticlique which determines the error correcting subspace has an explicit expression.
  arXiv  Detail & Related papers  (2024-03-11T13:55:03Z)
• Graph Generation via Spectral Diffusion [51.60814773299899]
  We present GRASP, a novel graph generative model based on 1) the spectral decomposition of the graph Laplacian matrix and 2) a diffusion process. Specifically, we propose to use a denoising model to sample eigenvectors and eigenvalues from which we can reconstruct the graph Laplacian and adjacency matrix. Our permutation invariant model can also handle node features by concatenating them to the eigenvectors of each node.
  arXiv  Detail & Related papers  (2024-02-29T09:26:46Z)
• Advective Diffusion Transformers for Topological Generalization in Graph Learning [69.2894350228753]
  We show how graph diffusion equations extrapolate and generalize in the presence of varying graph topologies. We propose a novel graph encoder backbone, Advective Diffusion Transformer (ADiT), inspired by advective graph diffusion equations.
  arXiv  Detail & Related papers  (2023-10-10T08:40:47Z)
• New Approaches to Complexity via Quantum Graphs [0.0]
  We introduce and study the clique problem for quantum graphs. inputs for our problems are presented as quantum channels induced by circuits. We show that, by varying the collection of channels in the language, these give rise to complete problems for the classes $textsfNP$, $textsfMA$, $textsfQMA$, and $textsfQMA(2)$.
  arXiv  Detail & Related papers  (2023-09-22T14:20:14Z)
• Normal quantum channels and Markovian correlated two-qubit quantum errors [77.34726150561087]
  We study general normally'' distributed random unitary transformations. On the one hand, a normal distribution induces a unital quantum channel. On the other hand, the diffusive random walk defines a unital quantum process.
  arXiv  Detail & Related papers  (2023-07-25T15:33:28Z)
• Two-Particle Scattering on Non-Translation Invariant Line Lattices [0.0]
  Quantum walks have been used to develop quantum algorithms since their inception. We show that a CPHASE gate can be achieved with high fidelity when the interaction acts only on a small portion of the line graph.
  arXiv  Detail & Related papers  (2023-03-08T02:36:29Z)
• Stable and Transferable Hyper-Graph Neural Networks [95.07035704188984]
  We introduce an architecture for processing signals supported on hypergraphs via graph neural networks (GNNs) We provide a framework for bounding the stability and transferability error of GNNs across arbitrary graphs via spectral similarity.
  arXiv  Detail & Related papers  (2022-11-11T23:44:20Z)
• Free-Fermion Subsystem Codes [0.3222802562733786]
  We consider quantum error-correcting subsystem codes whose gauge generators realize a free-fermion-solvable spin model. In this setting, errors are suppressed by a Hamiltonian whose terms are the gauge generators of the code. We present the first known example of an exactly solvable spin model with a two-dimensional free-fermion description and exact topological qubits.
  arXiv  Detail & Related papers  (2022-01-18T19:00:04Z)
• Quantum Error Correction with Gauge Symmetries [69.02115180674885]
  Quantum simulations of Lattice Gauge Theories (LGTs) are often formulated on an enlarged Hilbert space containing both physical and unphysical sectors. We provide simple fault-tolerant procedures that exploit such redundancy by combining a phase flip error correction code with the Gauss' law constraint.
  arXiv  Detail & Related papers  (2021-12-09T19:29:34Z)
• Non-commutative graphs based on finite-infinite system couplings: quantum error correction for a qubit coupled to a coherent field [0.0]
  We study error correction in the case of a finite-dimensional quantum system coupled to an infinite dimensional system. We find the quantum anticlique, which is the projector on the error correcting subspace, and analyze it as a function of the frequencies of the qubit and the bosonic field.
  arXiv  Detail & Related papers  (2021-04-24T12:06:43Z)
• Hamiltonian systems, Toda lattices, Solitons, Lax Pairs on weighted Z-graded graphs [62.997667081978825]
  We identify conditions which allow one to lift one dimensional solutions to solutions on graphs. We show that even for a simple example of a topologically interesting graph the corresponding non-trivial Lax pairs and associated unitary transformations do not lift to a Lax pair on the Z-graded graph.
  arXiv  Detail & Related papers  (2020-08-11T17:58:13Z)

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.