Commuting operations factorise

• URL: http://arxiv.org/abs/2308.05792v1
• Date: Thu, 10 Aug 2023 18:00:00 GMT
• Title: Commuting operations factorise
• Authors: Renato Renner and Ramona Wolf
• Abstract summary: Tsirelson considered the case where Alice and Bob's inputs and outputs are classical. In this case, the answer is negative in general, but it is known that a factorisation exists in finite dimensions. Here we show the same holds in the fully quantum case, i.e., commuting operations factorise.
• Score: 4.847980206213335
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Consider two agents, Alice and Bob, each of whom takes a quantum input, operates on a shared quantum system $K$, and produces a quantum output. Alice and Bob's operations may commute, in the sense that the joint input-output behaviour is independent of the order in which they access $K$. Here we ask whether this commutation property implies that $K$ can be split into two factors on which Alice and Bob act separately. The question can be regarded as a "fully quantum" generalisation of a problem posed by Tsirelson, who considered the case where Alice and Bob's inputs and outputs are classical. In this case, the answer is negative in general, but it is known that a factorisation exists in finite dimensions. Here we show the same holds in the fully quantum case, i.e., commuting operations factorise, provided that all input systems are finite-dimensional.

Related papers

• The Power of Unentangled Quantum Proofs with Non-negative Amplitudes [55.90795112399611]
  We study the power of unentangled quantum proofs with non-negative amplitudes, a class which we denote $textQMA+(2)$. In particular, we design global protocols for small set expansion, unique games, and PCP verification. We show that QMA(2) is equal to $textQMA+(2)$ provided the gap of the latter is a sufficiently large constant.
  arXiv  Detail & Related papers  (2024-02-29T01:35:46Z)
• Quantum advantage in a unified scenario and secure detection of resources [55.2480439325792]
  We consider a single task to study different approaches of having quantum advantage. We show that the optimal success probability in the overall process for a qubit communication might be higher than that for a cbit communication.
  arXiv  Detail & Related papers  (2023-09-22T23:06:20Z)
• Integer Factorization by Quantum Measurements [0.0]
  Quantum algorithms are at the heart of the ongoing efforts to use quantum mechanics to solve computational problems unsolvable on classical computers. Among the known quantum algorithms, a special role is played by the Shor algorithm, i.e. a quantum-time algorithm for integer factorization. Here we present a different algorithm for integer factorization based on another genuine quantum property: quantum measurement.
  arXiv  Detail & Related papers  (2023-09-19T17:00:01Z)
• One-Way Ticket to Las Vegas and the Quantum Adversary [78.33558762484924]
  We show that quantum Las Vegas query complexity is exactly equal to the quantum adversary bound. This is achieved by transforming a feasible solution to the adversary inversion problem into a quantum query algorithm.
  arXiv  Detail & Related papers  (2023-01-05T11:05:22Z)
• Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
  We study the problem of designing worst-case to average-case reductions for quantum algorithms. We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
  arXiv  Detail & Related papers  (2022-12-06T22:01:49Z)
• Proofs of Quantumness from Trapdoor Permutations [9.767030279324038]
  Alice and Bob communicate over only classical channels. Alice can do only classical probabilistic-time computing. Bob can be constructed from classically-secure (full-domain) trapdoor permutations.
  arXiv  Detail & Related papers  (2022-08-26T01:11:05Z)
• Comparing the quantum switch and its simulations with energetically-constrained operations [0.0]
  We consider a situation in which the quantum operations are physically described by a light-matter interaction model. We find that within our model the quantum switch performs better, for some fixed amount of energy, than its simulation. In addition to the known computational or communication advantages of causal superpositions, our work raises new questions about their potential energetic advantages.
  arXiv  Detail & Related papers  (2022-08-03T10:00:05Z)
• The quantum switch is uniquely defined by its action on unitary operations [0.8192907805418581]
  The action of the quantum switch on non-unitary operations is chosen to be a natural'' extension of its action on unitary operations. We prove, however, that the natural extension is the only possibility for the quantum switch for the 2-slot case.
  arXiv  Detail & Related papers  (2021-05-31T18:02:30Z)
• Secure Two-Party Quantum Computation Over Classical Channels [63.97763079214294]
  We consider the setting where the two parties (a classical Alice and a quantum Bob) can communicate only via a classical channel. We show that it is in general impossible to realize a two-party quantum functionality with black-box simulation in the case of malicious quantum adversaries. We provide a compiler that takes as input a classical proof of quantum knowledge (PoQK) protocol for a QMA relation R and outputs a zero-knowledge PoQK for R that can be verified by classical parties.
  arXiv  Detail & Related papers  (2020-10-15T17:55:31Z)
• Sub-bosonic (deformed) ladder operators [62.997667081978825]
  We present a class of deformed creation and annihilation operators that originates from a rigorous notion of fuzziness. This leads to deformed, sub-bosonic commutation relations inducing a simple algebraic structure with modified eigenenergies and Fock states. In addition, we investigate possible consequences of the introduced formalism in quantum field theories, as for instance, deviations from linearity in the dispersion relation for free quasibosons.
  arXiv  Detail & Related papers  (2020-09-10T20:53:58Z)
• Consequences of preserving reversibility in quantum superchannels [4.014524824655106]
  Quantum superchannels with multiple slots are deterministic transformations which take independent quantum operations as inputs. We show that the reversibility preserving condition restricts all pure superchannels with two slots to be either a quantum circuit only consisting of unitary operations or a coherent superposition of two unitary quantum circuits.
  arXiv  Detail & Related papers  (2020-03-12T09:46:46Z)

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.