arXiv subjects

F. Javier Thayer

Publications and source records attributed to F. Javier Thayer.

6 recordsLinked to original sources

arXiv2018

Enrich-by-need Protocol Analysis for Diffie-Hellman (Extended Version)

Enrich-by-need protocol analysis is a style of symbolic protocol analysis that characterizes all executions of a protocol that extend a given scenario. In effect, it computes a strongest security goal the protocol achieves in that scenario. CPSA, a Cryptographic Protocol Shapes Analyzer, implements enrich-by-need protocol analysis. In this paper, we describe how to analyze protocols using the Diffie-Hellman mechanism for key agreement (DH) in the enrich-by-need style. DH, while widespread, has been challenging for protocol analysis because of its algebraic structure. DH essentially involves fields and cyclic groups, which do not fit the standard foundational framework of symbolic protocol analysis. By contrast, we justify our analysis via an algebraically natural model. This foundation makes the extended CPSA implementation reliable. Moreover, it provides informative and efficient results. An appendix explains how unification is efficiently done in our framework.

cs.CR↗

arXiv2005

Quantum Computer Condition: Stability, Classical Computation and Norms

The Quantum Computer Condition (QCC) provides a rigorous and completely general framework for carrying out analyses of questions pertaining to fault-tolerance in quantum computers. In this paper we apply the QCC to the problem of fluctuations and systematic errors in the values of characteristic parameters in realistic systems. We show that fault-tolerant quantum computation is possible despite variations in these parameters. We also use the QCC to explicitly show that reliable classical computation can be carried out using as input the results of fault-tolerant, but imperfect, quantum computation. Finally, we consider the advantages and disadvantages of the superoperator and diamond norms in connection with application of the QCC to various quantum information-theoretic problems.

quant-ph↗

arXiv2005

Comment on "Operator Quantum Error Correction"

The attempt to equate operator quantum error correction (quant-ph/0504189v1) with the quantum computer condition (quant-ph/0507141) in version two of quant-ph/0504189 is shown to be invalid.

quant-ph↗

arXiv2005

A Theory of Physical Quantum Computation: The Quantum Computer Condition

In this paper we present a new unified theoretical framework that describes the full dynamics of quantum computation. Our formulation allows any questions pertaining to the physical behavior of a quantum computer to be framed, and in principle, answered. We refer to the central organizing principle developed in this paper, on which our theoretical structure is based, as the *Quantum Computer Condition* (QCC), a rigorous mathematical statement that connects the irreversible dynamics of the quantum computing machine, with the reversible operations that comprise the quantum computation intended to be carried out by the quantum computing machine. Armed with the QCC, we derive a powerful result that we call the *Encoding No-Go Theorem*. This theorem gives a precise mathematical statement of the conditions under which fault-tolerant quantum computation becomes impossible in the presence of dissipation and/or decoherence. In connection with this theorem, we explicitly calculate a universal critical damping value for fault-tolerant quantum computation. In addition we show that the recently-discovered approach to quantum error correction known as "operator quantum error-correction" (OQEC) is a special case of our more general formulation. Our approach furnishes what we will refer to as "operator quantum fault-tolerance" (OQFT). In particular, we show how the QCC allows one to derive error thresholds for fault tolerance in a completely general context. We prove the existence of solutions to a class of time-dependent generalizations of the Lindblad equation. Using the QCC, we also show that the seemingly different circuit, graph- (including cluster-) state, and adiabatic paradigms for quantum computing are in fact all manifestations of a single, universal paradigm for all physical quantum computation.

quant-ph↗

arXiv2002

Quasidiagonal $C^\ast$-algebras and Nonstandard Analysis

Suppose B is an ultraproduct of finite dimensional C^\ast-algebras. We consider mapping and injectability properties for separable C^\ast-algebras into B. In the case of approximately finite C^\ast-algebras, we obtain a classification of these mappings up to inner conjugacy. Using a Theorem of Voiculescu, we show that for nuclear C^\ast-algebras injectability into an ultraproduct of finite dimensional C^\ast-algebras is equivalent to quasidiagonality.

math.OA↗

arXiv2001

Nonstandard Analysis of Graphs

This paper shows certain classes of metric spaces characterized by volume growth properties of balls can viewed as graphs with infinitesimal edges. Our approach is based on nonstandard analysis.

math.LO↗