Distributed Semantics for Distributed Quantum Computing

• URL: http://arxiv.org/abs/2607.11216v1
• Date: Mon, 13 Jul 2026 08:09:12 GMT
• Title: Distributed Semantics for Distributed Quantum Computing
• Abstract summary: We present a quantum process calculus that can split the system state along process boundaries and follow the evolution of each process in isolation.<n> Compositionality is the key to reasoning about any complex system, yet quantum process calculi have struggled to provide its spatial kind.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We present a quantum process calculus that can split the system state along process boundaries and follow the evolution of each process in isolation, without losing information about the joint state-a property we call spatial compositionality. Compositionality is the key to reasoning about any complex system, yet quantum process calculi have struggled to provide its spatial kind, which would enable analyzing a system one process at a time. Many a quantum process calculi have been proposed, but they invariably rely on a global state representation based on state vectors or density matrices, with no known way to split them without losing information about entanglement. We propose to model quantum states with Deutsch-Hayden descriptors instead, which provide a modular representation of qubit states and their evolution. We adapt these descriptors to allow arbitrary splitting and merging of the store of qubits, leading to an unusual process calculus in which qubit transfer messages carry the actual state of the qubit, where existing calculi transfer only a reference. The calculus gives localized views of system state visible to each process, which can be assembled back together into the joint state. We define a notion of process equivalence with extensive justification grounded in physics and show a bisimulation whose soundness proof is simplified by spatial compositionality. The calculus can model open systems entangled with external processes, and we demonstrate this capability on a fragment of the BB84 key distribution protocol. This exercise shows that Deutsch-Hayden descriptors can successfully track qubit movements across process and system boundaries, though it needs help from density matrices to reason about information flow.

Related papers

• How much randomness in a quantum process can be explained using memory? [0.0]
  We develop a convergent measure of irreducible randomness in stationary quantum processes.<n>This directly enables a measure of temporal correlations which lower bounds the memory resources required to replicate the process.
  arXiv  Detail & Related papers  (2026-08-26T14:50:53Z)
• Subsystem decompositions of quantum evolutions and transformations between causal perspectives [0.0]
  We formalise the idea that quantum evolutions can be represented with respect to different subsystem decompositions. We show that the causal perspectives that one can associate to the different parties in the quantum switch, cannot be related by a change of subsystem decomposition.
  arXiv  Detail & Related papers  (2024-11-25T15:42:07Z)
• A decompositional framework for process theories in spacetime [0.0]
  We extend the framework of process theories to include a background causal structure arising from a fixed spacetime.<n>We identify a canonical subset of implementations that determine both the embeddability of a process and the causal structures distinguishable at least in some process theory.<n>These zigzags could be significant for quantum causal modeling and the study of novel quantum resources.
  arXiv  Detail & Related papers  (2024-11-13T00:37:55Z)
• Ancilla-Assisted Process Tomography with Bipartiete Mixed Separable States [0.0]
  It has been shown that the entanglement between the system and ancillary states is not a strict requirement for performing ancilla-assisted process tomography(AAPT)<n>We take on the operational definition of faithfulness, i.e., a state is faithful if one can extract complete information about the quantum process.<n>We derive a way of constructing two-qubit states that are guaranteed to be faithful and estimate the bound on the average error of the process featured by the condition number.
  arXiv  Detail & Related papers  (2023-12-22T18:27:19Z)
• Many-body entropies and entanglement from polynomially-many local measurements [0.26388783516590225]
  We show that efficient estimation strategies exist under the assumption that all the spatial correlation lengths are finite. We argue that our method could be practically useful to detect bipartite mixed-state entanglement for large numbers of qubits available in today's quantum platforms.
  arXiv  Detail & Related papers  (2023-11-14T12:13:15Z)
• Overlapping qubits from non-isometric maps and de Sitter tensor networks [41.94295877935867]
  We show that processes in local effective theories can be spoofed with a quantum system with fewer degrees of freedom. We highlight how approximate overlapping qubits are conceptually connected to Hilbert space dimension verification, degree-of-freedom counting in black holes and holography.
  arXiv  Detail & Related papers  (2023-04-05T18:08:30Z)
• Calculating the many-body density of states on a digital quantum computer [58.720142291102135]
  We implement a quantum algorithm to perform an estimation of the density of states on a digital quantum computer. We use our algorithm to estimate the density of states of a non-integrable Hamiltonian on the Quantinuum H1-1 trapped ion chip for a controlled register of 18bits.
  arXiv  Detail & Related papers  (2023-03-23T17:46:28Z)
• Learning quantum processes without input control [2.321323878201932]
  We introduce a general statistical learning theory for processes that take as input a classical random variable and output a quantum state.<n>This framework is applicable to the study of astronomical phenomena, disordered systems and biological processes not controlled by the observer.
  arXiv  Detail & Related papers  (2022-11-09T16:34:46Z)
• Unconventional mechanism of virtual-state population through dissipation [125.99533416395765]
  We report a phenomenon occurring in open quantum systems by which virtual states can acquire a sizable population in the long time limit. This means that the situation where the virtual state remains unpopulated can be metastable. We show how these results can be relevant for practical questions such as the generation of stable and metastable entangled states in dissipative systems of interacting qubits.
  arXiv  Detail & Related papers  (2022-02-24T17:09:43Z)
• Learning entanglement breakdown as a phase transition by confusion [0.0]
  We develop an approach for revealing entanglement breakdown using a machine learning technique, which is known as 'learning by confusion' We show that the developed method provides correct answers for a variety of states, including entangled states with positive partial transpose (PPT) We also present a more practical version of the method, which is suitable for studying entanglement breakdown in noisy intermediate-scale quantum (NISQ) devices.
  arXiv  Detail & Related papers  (2022-02-01T11:41:18Z)
• A quantum processor based on coherent transport of entangled atom arrays [44.62475518267084]
  We show a quantum processor with dynamic, nonlocal connectivity, in which entangled qubits are coherently transported in a highly parallel manner. We use this architecture to realize programmable generation of entangled graph states such as cluster states and a 7-qubit Steane code state.
  arXiv  Detail & Related papers  (2021-12-07T19:00:00Z)
• Stochastic approximate state conversion for entanglement and general quantum resource theories [41.94295877935867]
  An important problem in any quantum resource theory is to determine how quantum states can be converted into each other. Very few results have been presented on the intermediate regime between probabilistic and approximate transformations. We show that these bounds imply an upper bound on the rates for various classes of states under probabilistic transformations. We also show that the deterministic version of the single copy bounds can be applied for drawing limitations on the manipulation of quantum channels.
  arXiv  Detail & Related papers  (2021-11-24T17:29:43Z)
• The Logic of Quantum Programs [77.34726150561087]
  We present a logical calculus for reasoning about information flow in quantum programs. In particular we introduce a dynamic logic that is capable of dealing with quantum measurements, unitary evolutions and entanglements in compound quantum systems.
  arXiv  Detail & Related papers  (2021-09-14T16:08:37Z)
• Gaussian Process States: A data-driven representation of quantum many-body physics [59.7232780552418]
  We present a novel, non-parametric form for compactly representing entangled many-body quantum states. The state is found to be highly compact, systematically improvable and efficient to sample. It is also proven to be a universal approximator' for quantum states, able to capture any entangled many-body state with increasing data set size.
  arXiv  Detail & Related papers  (2020-02-27T15:54:44Z)
• Multidimensional dark space and its underlying symmetries: towards dissipation-protected qubits [62.997667081978825]
  We show that a controlled interaction with the environment may help to create a state, dubbed as em dark'', which is immune to decoherence. To encode quantum information in the dark states, they need to span a space with a dimensionality larger than one, so different states act as a computational basis. This approach offers new possibilities for storing, protecting and manipulating quantum information in open systems.
  arXiv  Detail & Related papers  (2020-02-01T15:57:37Z)

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.