1,032 research outputs found
False Valor: Amending the Stolen Valor Act to Conform with the First Amendment\u27s Fraudulent Speech Exception
The Stolen Valor Act (SVA or “the Act”) was enacted to protect against “fraudulent claims” of receipt of military honors or decorations. It does so by criminalizing false verbal or written claims regarding such awards. However, the Act failed to include all of the elements of an anti-fraud measure required by the First Amendment. Most critically, the SVA fails to require actual reliance on the part of the defrauded. Although fraud is generally not protected by the First Amendment, courts cannot construe the SVA as an anti-fraud measure if the statute does not require actual reliance. Therefore, the SVA as written has been subject to the higher strict scrutiny standard when challenged on First Amendment grounds. However, this oversight is easily remedied. Congress should amend the SVA to require that targets of the fraudulent claim alter their behavior based upon the false representation of military honors without necessarily suffering an economic injury. By modifying the SVA in this limited fashion, Congress will enable courts to construe the SVA as an anti-fraud measure while protecting against harm caused by false claims of military honors
Generalization of entanglement to convex operational theories: Entanglement relative to a subspace of observables
We define what it means for a state in a convex cone of states on a space of
observables to be generalized-entangled relative to a subspace of the
observables, in a general ordered linear spaces framework for operational
theories. This extends the notion of ordinary entanglement in quantum
information theory to a much more general framework. Some important special
cases are described, in which the distinguished observables are subspaces of
the observables of a quantum system, leading to results like the identification
of generalized unentangled states with Lie-group-theoretic coherent states when
the special observables form an irreducibly represented Lie algebra. Some open
problems, including that of generalizing the semigroup of local operations with
classical communication to the convex cones setting, are discussed.Comment: 19 pages, to appear in proceedings of Quantum Structures VII, Int. J.
Theor. Phy
Bringing Demonstrative Evidence in from the Cold: The Academy\u27s Role in Developing Model Rules
To this day, judges and advocates struggle with the definition and use of demonstrative evidence. The ambiguity of this term (or its close cousins illustrative evidence and evidence offered for illustrative purposes only ) infects the judicial process with uncertainty, hindering advocates when preparing for trial and, in some cases, producing erroneous verdicts. For example, the Seventh Circuit recently reversed a case for improper use of a demonstrative exhibit, and on retrial the result swung from a defense verdict to an $11 million plaintiffs victory. Uncertainty about the admission and use of demonstrative evidence has festered for decades. Lawyers innovate in presenting their cases, forcing judges to make case-by-case rulings. This is increasingly significant as technology becomes commonly used throughout trial practice. Law professors in turn solidify this unpredictable practice by teaching subsequent generations that the admission of demonstrative evidence is subject only to the unbounded discretion of the trial court. While this confusion has been long acknowledged and ably documented, it has not galvanized reform. Trial advocacy and evidence professors should meet at this intersection of their respective areas of scholarship and teaching; they should capitalize on their collective knowledge and influence and propose to the Advisory Committee on the Federal Rules of Evidence a set of uniform, analytically sound Model Rules for Demonstrative Evidence. Until evidence rules are amended to address the problem, professors should teach the Model Rules alongside the current unpredictable, ad hoc practice. Exposure to such standardized criteria during law school will influence a generation of future lawyers and judges, promoting consistency in the handling of demonstrative evidence in the courtroom
Hamiltonian Oracles
Hamiltonian oracles are the continuum limit of the standard unitary quantum
oracles. In this limit, the problem of finding the optimal query algorithm can
be mapped into the problem of finding shortest paths on a manifold. The study
of these shortest paths leads to lower bounds of the original unitary oracle
problem. A number of example Hamiltonian oracles are studied in this paper,
including oracle interrogation and the problem of computing the XOR of the
hidden bits. Both of these problems are related to the study of geodesics on
spheres with non-round metrics. For the case of two hidden bits a complete
description of the geodesics is given. For n hidden bits a simple lower bound
is proven that shows the problems require a query time proportional to n, even
in the continuum limit. Finally, the problem of continuous Grover search is
reexamined leading to a modest improvement to the protocol of Farhi and
Gutmann.Comment: 16 pages, REVTeX 4 (minor corrections in v2
Lossless quantum data compression and variable-length coding
In order to compress quantum messages without loss of information it is
necessary to allow the length of the encoded messages to vary. We develop a
general framework for variable-length quantum messages in close analogy to the
classical case and show that lossless compression is only possible if the
message to be compressed is known to the sender. The lossless compression of an
ensemble of messages is bounded from below by its von-Neumann entropy. We show
that it is possible to reduce the number of qbits passing through a quantum
channel even below the von-Neumann entropy by adding a classical side-channel.
We give an explicit communication protocol that realizes lossless and
instantaneous quantum data compression and apply it to a simple example. This
protocol can be used for both online quantum communication and storage of
quantum data.Comment: 16 pages, 5 figure
Indeterminate-length quantum coding
The quantum analogues of classical variable-length codes are
indeterminate-length quantum codes, in which codewords may exist in
superpositions of different lengths. This paper explores some of their
properties. The length observable for such codes is governed by a quantum
version of the Kraft-McMillan inequality. Indeterminate-length quantum codes
also provide an alternate approach to quantum data compression.Comment: 32 page
Report of Cost Committee of American Boiler Manufacturers Association
It is safe to say that boiler manufacturers as a whole have been more backward in the development of their financial accounting and cost accounting than they have in the development of greater efficiency in their plants; they have looked upon cost accounting as something to do with red tape or something that may be all right for the other fellow. It is our conclusion that the interests of the Association can best be served and the work of our Committee productive of most good, through the distribution of this booklet which we might consider as a primer on cost accounting for our industry, and to this end we present it with the hope that it will be given your careful consideration. In this booklet we will endeavor to outline in a simple manner, a procedure that if followed will make it possible for any manufacturer, large or small, to compute his cost of production with a reasonable degree of accuracy
Generalized remote state preparation: Trading cbits, qubits and ebits in quantum communication
We consider the problem of communicating quantum states by simultaneously
making use of a noiseless classical channel, a noiseless quantum channel and
shared entanglement. We specifically study the version of the problem in which
the sender is given knowledge of the state to be communicated. In this setting,
a trade-off arises between the three resources, some portions of which have
been investigated previously in the contexts of the quantum-classical trade-off
in data compression, remote state preparation and superdense coding of quantum
states, each of which amounts to allowing just two out of these three
resources. We present a formula for the triple resource trade-off that reduces
its calculation to evaluating the data compression trade-off formula. In the
process, we also construct protocols achieving all the optimal points. These
turn out to be achievable by trade-off coding and suitable time-sharing between
optimal protocols for cases involving two resources out of the three mentioned
above.Comment: 15 pages, 2 figures, 1 tabl
No Signalling and Quantum Key Distribution
Standard quantum key distribution protocols are provably secure against
eavesdropping attacks, if quantum theory is correct. It is theoretically
interesting to know if we need to assume the validity of quantum theory to
prove the security of quantum key distribution, or whether its security can be
based on other physical principles. The question would also be of practical
interest if quantum mechanics were ever to fail in some regime, because a
scientifically and technologically advanced eavesdropper could perhaps use
post-quantum physics to extract information from quantum communications without
necessarily causing the quantum state disturbances on which existing security
proofs rely. Here we describe a key distribution scheme provably secure against
general attacks by a post-quantum eavesdropper who is limited only by the
impossibility of superluminal signalling. The security of the scheme stems from
violation of a Bell inequality.Comment: Clarifications and minor revisions in response to comments. Final
version; to appear in Phys. Rev. Let
- …