相关论文: How the no-cloning theorem got its name

Although it is widely accepted that `no-broadcasting' -- the nonclonability of quantum information -- is a fundamental principle of quantum mechanics, an impossibility theorem for the broadcasting of general density matrices has not yet…

The research process includes many decisions, e.g., how to entitle and where to publish the paper. In this paper, we introduce a general framework for investigating the effects of such decisions. The main difficulty in investigating the…

This paper addresses one of the fundamental open questions in the realm of existential rules: the conjecture on the finite controllability of bounded derivation depth rule sets (bdd $\Rightarrow$ fc). We take a step toward a positive…

This talk is a digest of Ref.[1](E.Gotsman,E. Levin and U. Maor: TAUP 2416/97, hep-ph/9705205,Phys. Lett. (in press)) where a new mechanism for hard inclusive production, which leads to a violation of the factorization theorem (FT), is…

The possible existence of closed timelike curves (CTCs) draws attention to fundamental questions about what is physically possible and what is not. An example is the "no cloning theorem" in quantum mechanics, which states that no physical…

This paper provides a variational treatment of the effect of external charges on the free charges in an infinite free-standing graphene sheet within the Thomas-Fermi theory. We establish existence, uniqueness and regularity of the energy…

Despite peer-reviewing being an essential component of academia since the 1600s, it has repeatedly received criticisms for lack of transparency and consistency. We posit that recent work in machine learning and explainable AI provide tools…

We show that when a narrow beam is incident upon a dielectric interface near the critical angle for total internal reflection it will be transmitted into the far-field with an angular deflection from the direction predicted by Snell's Law,…

This paper provides a theoretical explanation on the clustering aspect of nonnegative matrix factorization (NMF). We prove that even without imposing orthogonality nor sparsity constraint on the basis and/or coefficient matrix, NMF still…

It is demonstrated that remarks and criticism in work [1] (arXiv:1005.2436 nucl-th) have resulted from inattentive reading of work [2] (Phys. Rev.C 81, 035501 (2010)) or just some misunderstanding and do not influence conclusions of work…

We prove generic versions of the no-cloning and no-broadcasting theorems, applicable to essentially {\em any} non-classical finite-dimensional probabilistic model that satisfies a no-signaling criterion. This includes quantum theory as well…

The paper contains a new proof of the theorem by Krieger which establishes the canonicity of the future cover of a sofic shift. In addition the paper describes a method to produce new canonical covers from a given one, resulting in…

The no-cloning theorem asserts that, unlike classical information, quantum information cannot be copied. This seemingly undesirable phenomenon is harnessed in quantum cryptography. Uncloneable cryptography studies settings in which the…

Consider a countably infinite set of nodes, which sequentially make decisions between two given hypotheses. Each node takes a measurement of the underlying truth, observes the decisions from some immediate predecessors, and makes a decision…

It is known that the classical information like strings of bits can be copied. In 1982, Wootters and Zurek proposed the quantum no-cloning principle. No-cloning principle says that it is impossible to make an identical copy of an arbitrary…

We correct a mistake in a lemma in the paper cited in the title and show that it did not affect any of the other results of the paper. To this end we prove results on linearly disjoint field extensions that do not seem to be commonly known.…

Noether's first theorem does not establish a one-way explanatory arrow from symmetries to conservation laws, but such an arrow is widely assumed in discussions of the theorem in the physics and philosophy literature. It is argued here that…

In contrast to other fields where conferences are typically for less polished or in-progress research, computing has long relied on referred conference papers as a venue for the final publication of completed research. While frequently a…

This paper presents a generalized flux-corrected transport (FCT) algorithm, which is shown to be total variation diminishing under some conditions. The new algorithm has improved properties from the standpoint of use and analysis. Results…

The paper is withdrawn by the author because it is superseded by cond-mat/0303357 .