EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Quantum query complexity of Boolean functions under indefinite causal order

Alastair A. Abbott, Mehdi Mhalla, Pierre Pocreau

Physical Review Research · 26.07.2024 · 6 (3)

DOI: 10.1103/physrevresearch.6.l032020 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Physical Review Research, online erschienen am 26.07.2024. Verfasst von Alastair A. Abbott und 2 weiteren Autor:innen. Die Arbeit wurde bisher 5-mal zitiert (Crossref) und nennt 44 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Agence Nationale de la Recherche.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The standard model of quantum circuits assumes operations are applied in a fixed sequential “causal” order. In recent years, the possibility of relaxing this constraint to obtain causally indefinite computations has received significant attention. The quantum switch, for example, uses a quantum system to coherently control the order of operations. Several computational and information-theoretical advantages have been demonstrated, raising questions as to whether advantages can be obtained in a more unified complexity theoretic framework. In this paper, we approach this problem by studying the query complexity of Boolean functions under general higher-order quantum computations. To this end, we generalize the framework of query complexity from quantum circuits to quantum supermaps to compare different models on an equal footing. We show that the recently introduced class of quantum circuits with quantum control of causal order cannot lead to any reduction in query complexity, and that any potential advantage arising from causally indefinite supermaps can be bounded by the polynomial method, as is the case with quantum circuits. Nevertheless, we find some functions for which the minimum error with which they can be computed using two queries is strictly lower when exploiting causally indefinite supermaps. Published by the American Physical Society 2024

Förderung

  • Agence Nationale de la Recherche

Zitieren

APA

Abbott, A. A., Mhalla, M., & Pocreau, P. (2024). Quantum query complexity of Boolean functions under indefinite causal order. Physical Review Research, 6(3). https://doi.org/10.1103/physrevresearch.6.l032020

Vancouver

Abbott AA, Mhalla M, Pocreau P. Quantum query complexity of Boolean functions under indefinite causal order. Physical Review Research. 2024;6(3). doi:10.1103/physrevresearch.6.l032020

BibTeX
@article{Abbott2024,
  author = {Abbott, Alastair A. and Mhalla, Mehdi and Pocreau, Pierre},
  title = {Quantum query complexity of Boolean functions under indefinite causal order},
  journal = {Physical Review Research},
  year = {2024},
  volume = {6},
  number = {3},
  doi = {10.1103/physrevresearch.6.l032020}
}
Kostenlos starten →