Quantum Query Complexity of Boolean Functions under Indefinite Causal Order

X. Zhao, Y. Yang, and G. Chiribella, Quantum metrology with indefinite causal order, Phys. Rev. Lett. 124

Original

1912

Earlier work this paper cites.

X. Zhao, Y. Yang, and G. Chiribella, Quantum metrology with indefinite causal order, Phys. Rev. Lett. 124

Original

1912

Earlier work this paper cites.

A. Jamiołkowski, Linear transformations which preserve trace and positive semidefiniteness of operators, Reports on Mathematical Physics 3

1972

Earlier work this paper cites.

M.-D. Choi, Completely positive linear maps on complex matrices, Linear Algebra and its Applications 10

1975

Earlier work this paper cites.

L. K. Grover, A fast quantum mechanical algorithm for database search, in Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing - STOC ’96 (ACM Press, Philadelphia, Pennsylvania, United States, 1996) pp. 212–219, arXiv:quant-ph/9605043 [quant-ph]

1996

Earlier work this paper cites.

C. H. Bennett, E. Bernstein, G. Brassard, and U. Vazirani, Strengths and Weaknesses of Quantum Computing, SIAM Journal on Computing 26

1997

Earlier work this paper cites.

R. Beals, H. Buhrman, R. Cleve, M. Mosca, and R. de Wolf, Quantum lower bounds by polynomials, Journal of the ACM 48

2001

Earlier work this paper cites.

M. M. Taddei, J. Cariñe, D. Martínez, T. García, N. Guerrero, A. A. Abbott, M. Araújo, C. Branciard, E. S. Gómez, S. P. Walborn, L. Aolita, and G. Lima, Computational advantage from the quantum superposition of multiple temporal orders of photonic gates, PRX Quantum 2

Original

2002

Earlier work this paper cites.

H. Buhrman and R. de Wolf, Complexity measures and decision tree complexity: a survey, Theoretical Computer Science 288

2002

Earlier work this paper cites.

A. Ambainis, Quantum Lower Bounds by Quantum Arguments, Journal of Computer and System Sciences 64

2002

Earlier work this paper cites.

H. Barnum, M. Saks, and M. Szegedy, Quantum query complexity and semi-definite programming, in 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings. (2003) pp. 179–193

2003

Earlier work this paper cites.

S. Boyd and L. Vandenberghe, Convex Optimization (Cambridge University Press, 2004)

2004

Earlier work this paper cites.

J. Lofberg, Yalmip : a toolbox for modeling and optimization in matlab, in 2004 IEEE International Conference on Robotics and Automation (IEEE Cat. No.04CH37508) (2004) pp. 284–289

2004

Earlier work this paper cites.

C. Dürr, M. Heiligman, P. HOyer, and M. Mhalla, Quantum query complexity of some graph problems, SIAM Journal on Computing 35

2006

Earlier work this paper cites.

A. Ambainis, Polynomial degree vs. quantum query complexity, Journal of Computer and System Sciences 72

2006

Earlier work this paper cites.

P. Hoyer, T. Lee, and R. Spalek, Negative weights make adversaries stronger, in Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing - STOC ’07 (ACM Press, San Diego, California, USA, 2007) p. 526, arXiv:quant-ph/0611054 [quant-ph]

2007

Earlier work this paper cites.

G. Chiribella, G. M. D’Ariano, and P. Perinotti, Theoretical framework for quantum networks, Phys. Rev. A 80

Original

2009

Cited alongside, same era.

S. Aaronson, S. Ben-David, R. Kothari, S. Rao, and A. Tal, Degree vs. approximate degree and quantum implications of huang’s sensitivity theorem, in Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (2021) pp. 1330–1342, arXiv:2010.12629 [quant-ph]

Original

2010

Cited alongside, same era.

J. Bavaresco, M. Murao, and M. T. Quintino, Strict hierarchy between parallel, sequential, and indefinite-causal-order strategies for channel discrimination, Phys. Rev. Lett. 127

Original

2011

Cited alongside, same era.

V. Giovannetti, S. Llyod, and L. Maccone, Advances in quantum metrology, Nat. Photonics 5

Original

2011

Cited alongside, same era.

M. Araújo, A. Feix, M. Navascués, and Č. Brukner, A purification postulate for quantum mechanics with indefinite causal order, Quantum 1

Original

2017

Later among the works it cites.

A. Ambainis, Understanding quantum algorithms via query complexity, in Proceedings of the International Congress of Mathematicians: Rio de Janeiro 2018 (World Scientific, 2018) pp. 3265–3285, arXiv:1712.06349 [quant-ph]

Original

2018

Later among the works it cites.

J. Wechs, A. A. Abbott, and C. Branciard, On the definition and characterisation of multipartite causal (non)separability, New Journal of Physics 21

Original

2019

Later among the works it cites.

M. T. Quintino, Q. Dong, A. Shimbo, A. Soeda, and M. Murao, Reversing unknown quantum transformations: Universal quantum circuit for inverting general unitary operations, Phys. Rev. Lett. 123

Original

2019

Later among the works it cites.