Fetching the paper…
Reading the bibliography…
Complex information-processing systems, for example quantum circuits, cryptographic protocols, or multi-player games, are naturally described as networks composed of more basic information-processing systems.
The computer as a physical system: A microscopic quantum mechanical hamiltonian model of computers as represented by turing machines
Paul Benioff · 1980
Earlier work this paper cites.
Quantum theory, the church-turing principle and the universal quantum computer
David Deutsch · 1985
Earlier work this paper cites.
Quantum computational networks
David Deutsch · 1989
Earlier work this paper cites.
Quantum circuit complexity
Andrew Chi-Chih Yao · 1993
Earlier work this paper cites.
Quantum complexity theory
Ethan Bernstein and Umesh Vazirani · 1997
Earlier work this paper cites.
A framework for comparing models of computation
Edward A. Lee and Alberto Sangiovanni-Vincentelli · 1998
Earlier work this paper cites.
Unconditionally secure bit commitment
Adrian Kent · 1999
Earlier work this paper cites.
Indistinguishability of random systems
Ueli Maurer · 2002
Earlier work this paper cites.
Completely Bounded Maps and Operator Algebras
Vern Paulsen · 2003
Earlier work this paper cites.
Ordered Sets: An Introduction
Bernd S. W. Schröder · 2003
Earlier work this paper cites.
Simulatable security for quantum protocols
Dominique Unruh · 2004
Earlier work this paper cites.
General security definition and composability for quantum & classical protocols
Michael Ben-Or and Dominic Mayers · 2004
Earlier work this paper cites.
Probability theories with dynamic causal structure: A new framework for quantum gravity
Lucien Hardy · 2005
Earlier work this paper cites.
Toward a general theory of quantum games
Gus Gutoski and John Watrous · 2007
Earlier work this paper cites.
Towards quantum gravity: a framework for probabilistic theories with non-fixed causal structure
Lucien Hardy · 2007
Earlier work this paper cites.
Indistinguishability amplification
Ueli Maurer, Krzysztof Pietrzak, and Renato Renner · 2007
Earlier work this paper cites.
Theoretical framework for quantum networks
Giulio Chiribella, Giacomo Mauro D’Ariano, and Paolo Perinotti · 2009
Earlier work this paper cites.
Universally composable incoercibility
Dominique Unruh and Jörn Müller-Quade · 2009
Earlier work this paper cites.
Quantum gravity computers: On the theory of computation with indefinite causal structure
Lucien Hardy · 2009
Earlier work this paper cites.
Universally composable quantum multi-party computation
Dominique Unruh · 2010
Earlier work this paper cites.
Position-based quantum cryptography: Impossibility and constructions
Harry Buhrman, Nishanth Chandran, Serge Fehr, Ran Gelles, Vipul Goyal, Rafail Ostrovsky, and Christian Schaffner · 2010
Earlier work this paper cites.
Formalism locality in quantum theory and quantum gravity
Lucien Hardy · 2010
Earlier work this paper cites.
The operator tensor formulation of quantum theory
Lucien Hardy · 2011
Earlier work this paper cites.
Adding control to arbitrary unknown quantum operations
Xiao-Qi Zhou, Timothy C. Ralph, Pruet Kalasuwan, Mian Zhang, Alberto Peruzzo, Benjamin P. Lanyon, and Jeremy L. O’Brien · 2011
Cited alongside, same era.
Abstract cryptography
Ueli Maurer and Renato Renner · 2011
Cited alongside, same era.
The Choi-Jamiołkowski forms of quantum Gaussian channels
Alexander S. Holevo · 2011
Cited alongside, same era.
On a measure of distance for quantum strategies
Gus Gutoski · 2012
Cited alongside, same era.
Quantum computation with programmable connections between gates
Timoteo Colnaghi, Giacomo Mauro D’Ariano, Stefano Facchini, and Paolo Perinotti · 2012
Cited alongside, same era.
Quantum causality
Časlav Brukner · 2014
Later among the works it cites.
Perfect signaling among three parties violating predefined causal order
Ämin Baumeler and Stefan Wolf · 2014
Later among the works it cites.
Ämin Baumeler, Adrien Feix, and Stefan Wolf · 2014
Later among the works it cites.
Experimental superposition of orders of quantum gates
Lorenzo M. Procopio, Amir Moqanaki, Mateus Araújo, Fabio Costa, Irati Alonso Calafell, Emma G. Dowd, Deny R. Hamel, Lee A. Rozema, Časlav Brukner, and Philip Walther · 2015
Closest in time.
Quantum superposition of the order of parties as a communication resource
Adrien Feix, Mateus Araújo, and Časlav Brukner · 2015
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Perfect discrimination of no-signalling channels via quantum superposition of causal structures
Giulio Chiribella · 2012
Cited alongside, same era.
Unconditionally secure bit commitment by transmitting measurement outcomes
Adrian Kent · 2012
Cited alongside, same era.
Quantum correlations with no causal order
Ognyan Oreshkov, Fabio Costa, and Časlav Brukner · 2012
Cited alongside, same era.
Quantum computations without definite causal structure
Giulio Chiribella, Giacomo Mauro D’Ariano, Paolo Perinotti, and Benoit Valiron · 2013
Cited alongside, same era.
Quantum computing with black-box subroutines
Jayne Thompson, Mile Gu, and Kavan Modi amnd Vlatko Vedral · 2013
Cited alongside, same era.
Authentication amplification by synchronization
Ueli Maurer · 2013
Cited alongside, same era.
Secure bit commitment from relativistic constraints
Jȩdrzej Kaniewski, Marco Tomamichel, Esther Hänggi, and Stephanie Wehner · 2013
Cited alongside, same era.
Closest in time.
Witnessing causal nonseparability
Mateus Araújo, Cyril Branciard, Fabio Costa, Adrien Feix, Christina Giarmatzi, and Časlav Brukner · 2015
Closest in time.
Practical relativistic bit commitment
T. Lunghi, J. Kaniewski, F. Bussières, R. Houlmann, M. Tomamichel, S. Wehner, and H. Zbinden · 2015
Closest in time.
Deterministic relativistic quantum bit commitment
Emily Adlam and Adrian Kent · 2015
Closest in time.
Bounding quantum correlations with indefinite causal order
Časlav Brukner · 2015
Closest in time.
Causal and causally separable processes
Ognyan Oreshkov and Christina Giarmatzi · 2016
Closest in time.
Witnesses of causal nonseparability: an introduction and a few case studies
Cyril Branciard · 2016
Closest in time.
The simplest causal inequalities and their violation
Cyril Branciard, Mateus Araújo, Adrien Feix, Fabio Costa, and Časlav Brukner · 2016
Closest in time.
Device-independent test of causal order and relations to fixed-points
Ämin Baumeler and Stefan Wolf · 2016
Closest in time.
The space of logically consistent classical processes without causal order
Ämin Baumeler and Stefan Wolf · 2016
Closest in time.
Non-causal computation avoiding the grandfather and information antinomies
Ämin Baumeler and Stefan Wolf · 2016
Closest in time.
Operational quantum theory without predefined time
Ognyan Oreshkov and Nicolas J. Cerf · 2016
Closest in time.
Toward an algebraic theory of systems
Christian Matt, Ueli Maurer, Christopher Portmann, Renato Renner, and Björn Tackmann · 2016
Closest in time.
Theory of quantum information, 2016
John Watrous · 2016
Closest in time.
The role of quantum information in thermodynamics—a topical review
John Goold, Marcus Huber, Arnau Riera, Lídia del Rio, and Paul Skrzypczyk · 2016
Closest in time.
Quantum Coarse-Graining: An Information-Theoretic Approach to Thermodynamics
Philippe Faist · 2016
Closest in time.
Causally nonseparable processes admitting a causal model
Adrien Feix, Mateus Araújo, and Časlav Brukner · 2016
Closest in time.
Reformulating and reconstructing quantum theory
Lucien Hardy · 2066
Closest in time.