Results 1  10
of
1,360
Nonunitary settheoretical solutions to the Quantum YangBaxter Equation Alexander
, 2000
"... We develop a theory of nonunitary settheoretical solutions to the Quantum YangBaxter equation. Our results generalize those obtained by Etingof, Schedler and the author in [ESS]. We remark that some of our constructions are similar to constructions obtained by Lu, Yan and Zhu in [LYZ]. 1 ..."
Abstract
 Add to MetaCart
We develop a theory of nonunitary settheoretical solutions to the Quantum YangBaxter equation. Our results generalize those obtained by Etingof, Schedler and the author in [ESS]. We remark that some of our constructions are similar to constructions obtained by Lu, Yan and Zhu in [LYZ]. 1
Nonunitary settheoretical solutions to the Quantum YangBaxter Equation Alexander
, 2000
"... We develop a theory of nonunitary settheoretical solutions to the Quantum YangBaxter equation. Our results generalize those obtained by Etingof, Schedler and the author in [ESS]. We remark that some of our constructions are similar to constructions obtained by Lu, Yan and Zhu in [LYZ]. 1 ..."
Abstract
 Add to MetaCart
We develop a theory of nonunitary settheoretical solutions to the Quantum YangBaxter equation. Our results generalize those obtained by Etingof, Schedler and the author in [ESS]. We remark that some of our constructions are similar to constructions obtained by Lu, Yan and Zhu in [LYZ]. 1
Nonunitary settheoretical solutions to the Quantum YangBaxter Equation Alexander
, 2000
"... We develop a theory of nonunitary settheoretical solutions to the Quantum YangBaxter equation. Our results generalize those obtained by Etingof, Schedler and the author in [ESS]. We remark that some of our constructions are similar to constructions obtained by Lu, Yan and Zhu in [LYZ]. 1 ..."
Abstract
 Add to MetaCart
We develop a theory of nonunitary settheoretical solutions to the Quantum YangBaxter equation. Our results generalize those obtained by Etingof, Schedler and the author in [ESS]. We remark that some of our constructions are similar to constructions obtained by Lu, Yan and Zhu in [LYZ]. 1
A Theory of Focus Interpretation
"... More or less final version. To appear in Natural Language Semantics. According to the alternative semantics for focus, the semantic reflex of intonational focus is a second semantic value, which in the case of a sentence is a set of propositions. We examine a range of semantic and pragmatic applicat ..."
Abstract

Cited by 488 (6 self)
 Add to MetaCart
More or less final version. To appear in Natural Language Semantics. According to the alternative semantics for focus, the semantic reflex of intonational focus is a second semantic value, which in the case of a sentence is a set of propositions. We examine a range of semantic and pragmatic
Quantum complexity theory
 in Proc. 25th Annual ACM Symposium on Theory of Computing, ACM
, 1993
"... Abstract. In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s model of a quantum Turing machine (QTM) [Proc. Roy. Soc. London Ser. A, 400 (1985), pp. 97–117]. This constructi ..."
Abstract

Cited by 574 (5 self)
 Add to MetaCart
be implemented and introduce some new, purely quantum mechanical primitives, such as changing the computational basis and carrying out an arbitrary unitary transformation of polynomially bounded dimension. We also consider the precision to which the transition amplitudes of a quantum Turing machine need
Elementary Gates for Quantum Computation
, 1995
"... We show that a set of gates that consists of all onebit quantum gates (U(2)) and the twobit exclusiveor gate (that maps Boolean values (x, y)to(x, x⊕y)) is universal in the sense that all unitary operations on arbitrarily many bits n (U(2 n)) can be expressed as compositions of these gates. We in ..."
Abstract

Cited by 280 (11 self)
 Add to MetaCart
We show that a set of gates that consists of all onebit quantum gates (U(2)) and the twobit exclusiveor gate (that maps Boolean values (x, y)to(x, x⊕y)) is universal in the sense that all unitary operations on arbitrarily many bits n (U(2 n)) can be expressed as compositions of these gates. We
On Beamforming with Finite Rate Feedback in Multiple Antenna Systems
, 2003
"... In this paper, we study a multiple antenna system where the transmitter is equipped with quantized information about instantaneous channel realizations. Assuming that the transmitter uses the quantized information for beamforming, we derive a universal lower bound on the outage probability for any f ..."
Abstract

Cited by 272 (14 self)
 Add to MetaCart
finite set of beamformers. The universal lower bound provides a concise characterization of the gain with each additional bit of feedback information regarding the channel. Using the bound, it is shown that finite information systems approach the perfect information case as (t 1)2 , where B
On Orthogonal and Symplectic Matrix Ensembles
 MATHEMATICAL PHYSICS
, 1996
"... The focus of this paper is on the probability, Eβ(Q; J), that a set J consisting of a finite union of intervals contains no eigenvalues for the finite N Gaussian Orthogonal (β = 1) and Gaussian Symplectic (β = 4) Ensembles and their respective scaling limits both in the bulk and at the edge of the ..."
Abstract

Cited by 259 (10 self)
 Add to MetaCart
The focus of this paper is on the probability, Eβ(Q; J), that a set J consisting of a finite union of intervals contains no eigenvalues for the finite N Gaussian Orthogonal (β = 1) and Gaussian Symplectic (β = 4) Ensembles and their respective scaling limits both in the bulk and at the edge
Results 1  10
of
1,360