Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

College Mathematics Journal

Convex Coordinates, Probabilities, and the Superposition of States

James N. Boyd, Prishati Raychowdhury

Published May 1, 1987• 4 citations
Publisher
DOI
10.1080/07468342.1987.11973032

Related papers

Sigma-Convex Structures of The Sets of States and Probability Measures in Quantum Mechanics

Gianni Cassinelli, PEKKA J. LAHTI

Boston studies in the philosophy of science•Jan 1, 1993•0 citations

Starting from the convex set of states

Enrico G. Beltrametti

Elsevier eBooks•Jan 1, 2007•1 citation

Empirical coordination of separable quantum correlations

Husein Natur, Uzi Pereg

We introduce the notion of empirical coordination for quantum correlations. Quantum mechanics enables the calculation of probabilities for experimental outcomes, emphasizing statistical averages rather than detailed descriptions of individual events. Empirical coordination is thus a natural framework for quantum systems. Focusing on the cascade network, the optimal coordination rates are established, indicating the minimal resources required to simulate, on average, a quantum state. As we consider a network with classical communication links, superposition cannot be maintained, hence the quantum correlations are separable (i.e., a convex combination of product states). This precludes entanglement. Providing the users with shared randomness, before communication begins, does not affect the optimal rates for empirical coordination. We begin with a rate characterization for a basic two-node network, and then generalize to a cascade network. The special case of a network with an isolated node is considered as well. The results can be further generalized to other networks as our analysis includes a generic achievability scheme. The optimal rate formula involves optimization over a collection of state extensions. This is a unique feature of the quantum setting, as the classical parallel does not include optimization. As demonstrated through examples, the performance depends heavily on the choice of decomposition. We further discuss the consequences of our results for quantum cooperative games.

AIMS Mathematics•Jan 1, 2025•1 citation

Partial Isomorphism of Superposition in Potentiality Systems of Consciousness and Quantum Mechanics

Franz Klaus Jansen

Superposition of physical states in the wave function of quantum mechanics is difficult to transpose to the macrocosm, as illustrated by “Schrodinger’s cat” thought experiment. Nevertheless, in this example consciousness does not seem to be shown in its complete reality, when evaluated from a medical view-point. Although consciousness functions with reality systems, it also utilizes potentiality systems, which essentially consist in superposition of several probable situations. Some examples of superposition in consciousness are described, to illustrate requirement of potentiality systems in order to predict situations in the future or to complement events in the past. Incomplete observations, such as lacking time or space coordinates, automatically induce potentiality systems in consciousness, in order to complete the lacking coordinates by only potential but most probable coordinates. In contrast, reality systems are only present, when complete observation with exact time and space coordinates can be obtained. Potentiality systems in human consciousness also show the characteristics of Heisenberg's uncertainty principle, as well as non-locality and entanglement. Superposition in potentiality systems is an essential function of consciousness, in order to allow perception of future and past events. The basic concept of superposition without corresponding mathematical formalism seems already to show partial isomorphism in the larger sense of Douglas Hofstadter between consciousness and quantum mechanics.

NeuroQuantology•Jun 4, 2008•5 citations

Superposition, Entropy and Schmidt Decomposition of States

Antonio Zecca

International Journal of Theoretical Physics•Sep 1, 2004•1 citation

A Probability-Based Optimization Approach for Entanglement Distribution and Source Position in Quantum Networks

Giovanni Iacovelli, Francesco Vista, Nicola Cordeschi +1 more

Quantum Internet (QI) is a system of interconnected quantum computers able to exchange information encoded in the so called quantum bits (qubits). Differently from the classical counterpart, qubits benefit from a manifold properties guaranteed by quantum mechanics, such as superposition and entanglement. Despite the fact that quantum networks bring significant advantages, several phenomena can negatively impact the overall system, potentially hindering communication. In order to evaluate the network performance, a comprehensive probability expression is derived in this work to ultimately determine how many qubits are expected to be successfully received by nodes. On this basis, a Mixed-Integer Non-Linear Programming (MINLP) problem is formulated to fairly maximize the qubits exchanged between node pairs and jointly optimize (i) the position of the quantum source, and (ii) the entanglement distribution plan. To cope with the non-convexity of the problem, an iterative optimization algorithm, leveraging Block Coordinate Descendent (BCD) and Successive Convex Approximation (SCA) techniques, is proposed. A thorough simulation campaign is conducted to corroborate the theoretical findings. Numerical results demonstrates, under different parameter setups, that the proposed algorithm provides superior performance with respect to a baseline approach.

IEEE Journal on Selected Areas in Communications•Mar 21, 2024•9 citations
We introduce the notion of empirical coordination for quantum correlations. Quantum mechanics enables the calculation of probabilities for experimental outcomes, emphasizing statistical averages rather than detailed descriptions of individual events. Empirical coordination is thus a natural framework for quantum systems. Focusing on the cascade network, the optimal coordination rates are established, indicating the minimal resources required to simulate, on average, a quantum state. As we consider a network with classical communication links, superposition cannot be maintained, hence the quantum correlations are separable (i.e., a convex combination of product states). This precludes entanglement. Providing the users with shared randomness, before communication begins, does not affect the optimal rates for empirical coordination. We begin with a rate characterization for a basic two-node network, and then generalize to a cascade network. The special case of a network with an isolated node is considered as well. The results can be further generalized to other networks as our analysis includes a generic achievability scheme. The optimal rate formula involves optimization over a collection of state extensions. This is a unique feature of the quantum setting, as the classical parallel does not include optimization. As demonstrated through examples, the performance depends heavily on the choice of decomposition. We further discuss the consequences of our results for quantum cooperative games.
Superposition of physical states in the wave function of quantum mechanics is difficult to transpose to the macrocosm, as illustrated by “Schrodinger’s cat” thought experiment. Nevertheless, in this example consciousness does not seem to be shown in its complete reality, when evaluated from a medical view-point. Although consciousness functions with reality systems, it also utilizes potentiality systems, which essentially consist in superposition of several probable situations. Some examples of superposition in consciousness are described, to illustrate requirement of potentiality systems in order to predict situations in the future or to complement events in the past. Incomplete observations, such as lacking time or space coordinates, automatically induce potentiality systems in consciousness, in order to complete the lacking coordinates by only potential but most probable coordinates. In contrast, reality systems are only present, when complete observation with exact time and space coordinates can be obtained. Potentiality systems in human consciousness also show the characteristics of Heisenberg's uncertainty principle, as well as non-locality and entanglement. Superposition in potentiality systems is an essential function of consciousness, in order to allow perception of future and past events. The basic concept of superposition without corresponding mathematical formalism seems already to show partial isomorphism in the larger sense of Douglas Hofstadter between consciousness and quantum mechanics.
Quantum Internet (QI) is a system of interconnected quantum computers able to exchange information encoded in the so called quantum bits (qubits). Differently from the classical counterpart, qubits benefit from a manifold properties guaranteed by quantum mechanics, such as superposition and entanglement. Despite the fact that quantum networks bring significant advantages, several phenomena can negatively impact the overall system, potentially hindering communication. In order to evaluate the network performance, a comprehensive probability expression is derived in this work to ultimately determine how many qubits are expected to be successfully received by nodes. On this basis, a Mixed-Integer Non-Linear Programming (MINLP) problem is formulated to fairly maximize the qubits exchanged between node pairs and jointly optimize (i) the position of the quantum source, and (ii) the entanglement distribution plan. To cope with the non-convexity of the problem, an iterative optimization algorithm, leveraging Block Coordinate Descendent (BCD) and Successive Convex Approximation (SCA) techniques, is proposed. A thorough simulation campaign is conducted to corroborate the theoretical findings. Numerical results demonstrates, under different parameter setups, that the proposed algorithm provides superior performance with respect to a baseline approach.