No-signalling constrains quantum computation with indefinite causal structure
arXiv:2202.10214 · doi:10.22331/q-2024-02-05-1241
Abstract
Quantum processes with indefinite causal structure emerge when we wonder which are the most general evolutions, allowed by quantum theory, of a set of local systems which are not assumed to be in any particular causal order. These processes can be described within the framework of higher-order quantum theory which, starting from considering maps from quantum transformations to quantum transformations, recursively constructs a hierarchy of quantum maps of increasingly higher order. In this work, we develop a formalism for quantum computation with indefinite causal structures; namely, we characterize the computational structure of higher order quantum maps. Taking an axiomatic approach, the rules of this computation are identified as the most general compositions of higher order maps which are compatible with the mathematical structure of quantum theory. We provide a mathematical characterization of the admissible composition for arbitrary higher order quantum maps. We prove that these rules, which have a computational and information-theoretic nature, are determined by the more physical notion of the signalling relations between the quantum systems of the higher order quantum maps.
arXiv comment11 pages, 5 figures + Supplemental material
References in corpus (42)
- Quantum correlations with no causal order
- Quantum computations without definite causal structure
- Theoretical framework for quantum networks
- Quantum Circuits Architecture
- Transforming quantum operations: quantum supermaps
- Experimental Superposition of Orders of Quantum Gates
- Computational advantage from quantum-controlled ordering of gates
- Statistical distinguishability between unitary operations
- Using entanglement improves precision of quantum measurements
- Enhanced communication with the assistance of indefinite causal order
- Indefinite Causal Order in a Quantum Switch
- Causal and localizable quantum operations
- Witnessing causal nonseparability
- Optimal discrimination of quantum operations
- Quantum information and precision measurement
- Memory effects in quantum channel discrimination
- Optimal quantum learning of a unitary transformation
- Quantum Metrology with Indefinite Causal Order
- Causal and causally separable processes
- Experimental transmission of quantum information using a superposition of causal orders
- Entanglement Is Not Necessary for Perfect Discrimination between Unitary Operations
- Fundamental limits to quantum channel discrimination
- The simplest causal inequalities and their violation
- Quantum computation with programmable connections between gates
- Semicausal operations are semilocalizable
- Computational advantage from quantum superposition of multiple temporal orders of photonic gates
- Process POVM: A mathematical framework for the description of process tomography experiments
- Strict hierarchy between parallel, sequential, and indefinite-causal-order strategies for channel discrimination
- Optimal cloning of unitary transformations
- Optimal probabilistic storage and retrieval of unitary channels
- Theoretical framework for Higher-Order Quantum Theory
- Functional Quantum Computing: An Optical Approach
- Optimal quantum tomography for states, measurements, and transformations
- On a measure of distance for quantum strategies
- Dynamics of quantum causal structures
- Quantum Networks: general theory and applications
- Success-or-Draw: A Strategy Allowing Repeat-Until-Success in Quantum Computation
- Conditions for optimal input states for discrimination of quantum channels
- Causal and compositional structure of unitary transformations
- Reassessing the computational advantage of quantum-controlled ordering of gates
- Quantum-enhanced learning of rotations about an unknown direction
- Optimal quantum discrimination of single-qubit unitary gates between two candidates