Non-causal computation

H. Everett, ““Relative State” Formulation of Quantum Mechanics,” Reviews of Modern Physics , vol. 29, no. 3, pp. 454–462, jul 1957

1957

Earlier work this paper cites.

C. H. Bennett, “Logical Reversibility of Computation,” IBM Journal of Research and Development , vol. 17, no. 6, pp. 525–532, Nov. 1973

1973

Earlier work this paper cites.

E. Fredkin and T. Toffoli, “Conservative logic,” International Journal of Theoretical Physics , vol. 21, no. 3-4, pp. 219–253, Apr. 1982

1982

Earlier work this paper cites.

L. G. Valiant and V. V. Vazirani, “NP is as easy as detecting unique solutions,” Theoretical Computer Science , vol. 47, pp. 85–93, 1986

1986

Earlier work this paper cites.

F. Echeverria, G. Klinkhammer, and K. S. Thorne, “Billiard balls in wormhole spacetimes with closed timelike curves: Classical theory,” Physical Review D , vol. 44, no. 4, pp. 1077–1099, Aug. 1991

1991

Earlier work this paper cites.

D. Deutsch, “Quantum mechanics near closed timelike lines,” Physical Review D , vol. 44, no. 10, pp. 3197–3217, Nov. 1991

1991

Earlier work this paper cites.

M. Tegmark, “The Interpretation of Quantum Mechanics: Many Worlds or Many Words?” Fortschritte der Physik , vol. 46, no. 6-8, pp. 855–862, nov 1998

1998

Earlier work this paper cites.

S. Aaronson, “Guest Column: NP-complete problems and physical reality,” ACM SIGACT News , vol. 36, no. 1, p. 30, mar 2005

2005

Cited alongside, same era.

S. Aaronson and J. Watrous, “Closed timelike curves make quantum and classical computing equivalent,” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences , vol. 465, no. 2102, pp. 631–647, Feb. 2009

2009

Cited alongside, same era.

G. Chiribella, “Perfect discrimination of no-signalling channels via quantum superposition of causal structures,” Physical Review A , vol. 86, no. 4, p. 040301, Oct. 2012

2012

Cited alongside, same era.

T. Colnaghi, G. M. D’Ariano, S. Facchini, and P. Perinotti, “Quantum computation with programmable connections between gates,” Physics Letters A , vol. 376, no. 45, pp. 2940–2943, Oct. 2012

2012

Cited alongside, same era.

M. Araújo, F. Costa, and Č. Brukner, “Computational Advantage from Quantum-Controlled Ordering of Gates,” Physical Review Letters , vol. 113, no. 25, p. 250402, Dec. 2014

2014

Later among the works it cites.

Ä. Baumeler, A. Feix, and S. Wolf, “Maximal incompatibility of locally classical behavior and global causal order in multiparty scenarios,” Physical Review A , vol. 90, no. 4, p. 042106, Oct. 2014

2014

Later among the works it cites.

L. M. Procopio, A. Moqanaki, M. Araújo, F. Costa, I. Alonso Calafell, E. G. Dowd, D. R. Hamel, L. A. Rozema, Č. Brukner, and P. Walther, “Experimental superposition of orders of quantum gates,” Nature Communications , vol. 6, p. 7913, Aug. 2015

2015

Later among the works it cites.

A. Feix, M. Araújo, and Č. Brukner, “Quantum superposition of the order of parties as a communication resource,” Physical Review A , vol. 92, no. 5, p. 052326, Nov. 2015

2015

Later among the works it cites.