Outline of a Synalgebraic Approach to Distributed Quantum Computing

Beraldo de Araujo, Anderson

Published Nov 25, 2025• 0 citations

Abstract

This paper introduces a framework for computational reasoning about networks of quantum computers, grounded in a new mathematical theory called synalgebra. Unlike previous approaches, it shows how gate circuits can be made fully quantum and distributed across different levels of configuration. This perspective enables the formal verification of designs for quantum computer networks with unconventional topologies, which can be leveraged to develop previously unknown quantum algorithms.

DOI: 10.5281/zenodo.17716127

Related papers

Towards Synalgebraic Photonic Quantum Computing

Anderson Beraldo de Araujo

This article introduces a novel algebraic-logical formalism, called synalgebra, for describing, simulating, and reasoning about photonic quantum circuits. Existing approaches are typically limited to either descriptive languages or circuit simulators. In contrast, synalgebra employs the new concept of intergraphs as a core data structure for equational reasoning about photonic circuit architectures. Specifically, the article presents preliminary simulations of the variational quantum eigensolver (VQE) algorithm for up to 100 qubits, demonstrating how synalgebra can support higher-level abstractions of VQE as well as hardware optimization of photonic waveguides.

IEEE International Conference on Quantum Computing and Engineering (QCE)Aug 30, 20251 citation

Formal Specification and Verification of Quantum Computing Algorithms

Jincheng Zhang

The verification of quantum computing algorithms presents a significant hurdle due to the probabilistic nature of quantum mechanics and the complex entanglement inherent in quantum computations. This paper proposes a novel approach to address this challenge by developing a formal language and a corresponding verification tool tailored explicitly for quantum algorithm specification and verification. The system leverages concepts from quantum information theory and formal methods to provide a rigorous framework for ensuring the correctness of quantum algorithms. We introduce a new formalism that allows for precise description of quantum circuits and their operations, combined with automated theorem proving techniques to systematically verify the algorithm's behavior against a given specification. The key innovation lies in the ability to reason about quantum states and measurements within a formal setting, enabling a more comprehensive understanding and validation of these algorithms. This work lays the foundation for increased confidence in the development and deployment of quantum computing technologies.

Sep 2, 20260 citations

Quantum Entanglement-Driven Distributed Algorithm Verification

Jincheng Zhang

This paper proposes a novel approach to distributed algorithm verification leveraging the unique properties of quantum entanglement. Traditional methods for verifying distributed algorithms, particularly in the context of quantum computing, often rely on complex simulations or require replicating the entire network, leading to significant resource constraints. We introduce a framework where quantum entanglement serves as the primary mechanism for validation. Specifically, we utilize entangled states exchanged between a sender and receiver. The receiver's measurement of changes within the entangled state allows for inference regarding the correctness of the algorithm executed by the sender. This approach avoids the need for full network replication or simulation, offering a potentially more efficient and scalable solution for verifying distributed algorithms. We outline the theoretical framework, focusing on the key mathematical relationships involved. This paper demonstrates a fundamentally new way to approach algorithm verification, rooted in the inherent properties of quantum mechanics.

Aug 31, 20260 citations

Towards a Distributed Quantum Computing Platform for Algorithm Experiments

Sajjad Kashani, Angadh Singh, Ulrike Stege

Distributed quantum computing (DQC) is a rapidly evolving field with its own unique challenges. Distributing a quantum algorithm involves several key steps and considerations. The steps involve decomposition at various levels of abstraction, given the underlying quantum stack and quantum network capabilities. In our DQC design explorations, we focus on the distribution at the algorithm and circuit levels. Algorithmic distribution involves distributing tasks before compilation, allowing different quantum processing units (QPUs) to receive distinct parts of an algorithm. Circuit distribution involves executing a quantum algorithm in a distributed manner at the circuit execution level using circuit and adaptive quantum technologies. If entanglement across QPUs is supported, then quantum states can be shared between qubits on remote quantum processors. This requires a specialized architecture with data and communication qubits with non-local gates such as telegates and teledata gates. This paper presents our progress towards a framework for exploring quantum distribution at the algorithm and circuit levels. Our implementation and case studies demonstrate the feasibility of our approach and show effective pathways for distributed quantum algorithm experiments.

IEEE International Conference on Quantum Computing and Engineering (QCE)Sep 15, 20241 citation

Based on Quantum Decoherence: Distributed Computing

Jincheng Zhang

This paper explores the potential of utilizing quantum decoherence to enable efficient and controllable distributed computing. The core idea is to leverage the inherent properties of decoherence to manage and optimize distributed computation tasks. We propose a novel distributed computing algorithm designed around the principles of quantum decoherence, which decomposes complex computational tasks and intelligently allocates them across a network of quantum nodes. This approach aims to enhance computational efficiency and improve the system's resilience to errors. The algorithm's effectiveness stems from the controlled manipulation of decoherence events to guide computation pathways. We present a theoretical framework outlining the key components and operational principles of this system. The primary contribution lies in recognizing and exploiting decoherence as a resource for distributed computation, moving beyond traditional classical approaches. Mathematical formulations are provided to illustrate the core concepts and provide a basis for further research and development.

Aug 28, 20260 citations

Distributed Proof Theory for Quantum Algorithm Design

Jincheng Zhang

This paper explores the application of Distributed Proof Theory (DPT) to the design of quantum algorithms. DPT, traditionally used in classical algorithm analysis and complexity theory, provides a framework for decomposing problems into smaller, manageable parts. This decomposition can be directly translated into a strategy for constructing efficient proofs of correctness for quantum circuits. We argue that the core strength of DPT lies in its ability to generate minimal, high-level proofs that accurately capture the essence of a quantum algorithm's behavior. The approach presented here avoids the complexities often associated with directly simulating quantum systems, offering a potentially more tractable and insightful method for designing quantum algorithms. We focus on the construction of proofs that leverage the inherent parallelism of quantum computation and demonstrate how DPT can guide the creation of algorithms with reduced resource requirements. The potential of this framework is significant, offering a new perspective on quantum algorithm design and fostering the development of more robust and efficient quantum solutions.

Sep 3, 20260 citations