Deposits of clastic carbonate-dominated (calciclastic) sedimentary slope systems in the rock record have been identified mostly as linearly-consistent carbonate apron deposits, even though most ancient clastic carbonate slope deposits fit the submarine fan systems better. Calciclastic submarine fans are consequently rarely described and are poorly understood. Subsequently, very little is known especially in mud-dominated calciclastic submarine fan systems. Presented in this study are a sedimentological core and petrographic characterisation of samples from eleven boreholes from the Lower Carboniferous of Bowland Basin (Northwest England) that reveals a >250 m thick calciturbidite complex deposited in a calciclastic submarine fan setting. Seven facies are recognised from core and thin section characterisation and are grouped into three carbonate turbidite sequences. They include: 1) Calciturbidites, comprising mostly of highto low-density, wavy-laminated bioclast-rich facies; 2) low-density densite mudstones which are characterised by planar laminated and unlaminated muddominated facies; and 3) Calcidebrites which are muddy or hyper-concentrated debrisflow deposits occurring as poorly-sorted, chaotic, mud-supported floatstones. These

Phd by thesis

All our former experience with application of quantum theory seems to say:
{\it what is predicted by quantum formalism must occur in laboratory} But the
essence of quantum formalism - entanglement, recognized by Einstein, Podolsky,
Rosen and Schr\"odinger - waited over 70 years to enter to laboratories as a
new resource as real as energy This holistic property of compound quantum systems, which involves
nonclassical correlations between subsystems, is a potential for many quantum
processes, including ``canonical'' ones: quantum cryptography, quantum
teleportation and dense coding However, it appeared that this new resource is
very complex and difficult to detect Being usually fragile to environment, it
is robust against conceptual and mathematical tools, the task of which is to
decipher its rich structure This article reviews basic aspects of entanglement including its
characterization, detection, distillation and quantifying In particular, the
authors discuss various manifestations of entanglement via Bell inequalities,
entropic inequalities, entanglement witnesses, quantum cryptography and point
out some interrelations They also discuss a basic role of entanglement in
quantum communication within distant labs paradigm and stress some
peculiarities such as irreversibility of entanglement manipulations including
its extremal form - bound entanglement phenomenon A basic role of entanglement
witnesses in detection of entanglement is emphasized

Quantum entanglement

/pdf/convex-analysisnoer-san-nojin-zhan-nituite-5dl2rbmoyr.pdf

Convex Analysisの二,三の進展について

Quantum networks provide opportunities and challenges across a range of intellectual and technical frontiers, including quantum computation, communication and metrology. The realization of quantum networks composed of many nodes and channels requires new scientific capabilities for generating and characterizing quantum coherence and entanglement. Fundamental to this endeavour are quantum interconnects, which convert quantum states from one physical system to those of another in a reversible manner. Such quantum connectivity in networks can be achieved by the optical interactions of single photons and atoms, allowing the distribution of entanglement across the network and the teleportation of quantum states between nodes.

The quantum internet

This is an updated version of supplementary information to accompany "Quantum supremacy using a programmable superconducting processor", an article published in the October 24, 2019 issue of Nature. The main article is freely available at this https URL. Summary of changes since arXiv:1910.11333v1 (submitted 23 Oct 2019): added URL for qFlex source code; added Erratum section; added Figure S41 comparing statistical and total uncertainty for log and linear XEB; new References [1,65]; miscellaneous updates for clarity and style consistency; miscellaneous typographical and formatting corrections.

/pdf/supplementary-information-for-quantum-supremacy-using-a-3tkhfafpzk.pdf

Supplementary information for "Quantum supremacy using a programmable superconducting processor"

We investigate the universal inequalities relating the alpha-Renyi entropies of the marginals of a multi-partite quantum state. This is in analogy to the same question for the Shannon and von Neumann entropy (alpha=1) which are known to satisfy several non-trivial inequalities such as strong subadditivity. Somewhat surprisingly, we find for 0 1 we show analogously that there are no non-trivial homogeneous (in particular no linear) inequalities. On the other hand, it is known that there are further, non-linear and indeed non-homogeneous, inequalities delimiting the alpha-entropies of a general quantum state. Finally, we also treat the case of Renyi entropies restricted to classical states (i.e. probability distributions), which in addition to non-negativity are also subject to monotonicity. For alpha different from 0 and 1 we show that this is the only other homogeneous relation.

The structure of R\'enyi entropic inequalities

Motivated by the recent discovery of a quantum Chernoff theorem for asymptotic state discrimination, we investigate the distinguishability of two bipartite mixed states under the constraint of local operations and classical communication (LOCC), in the limit of many copies. While for two pure states a result of Walgate et al. shows that LOCC is just as powerful as global measurements, data hiding states (DiVincenzo et al.) show that locality can impose severe restrictions on the distinguishability of even orthogonal states. Here we determine the optimal error probability and measurement to discriminate many copies of particular data hiding states (extremal d times d Werner states) by a linear programming approach. Surprisingly, the single-copy optimal measurement remains optimal for n copies, in the sense that the best strategy is measuring each copy separately, followed by a simple classical decision rule. We also put a lower bound on the bias with which states can be distinguished by separable operations. This is a shortened version of a paper [1] recently submitted to Communications in Mathematical Physics; here the proofs have been omitted.

/pdf/on-the-chernoff-distance-for-asymptotic-locc-discrimination-iyd22f0h28.pdf

On the Chernoff distance for asymptotic LOCC discrimination of bipartite quantum states

We analyse the entanglement of the antisymmetric state in dimension d x d and present two main results. First, we show that the amount of secrecy that can be extracted from the state is low, more precisely, the distillable key is bounded by O(1/d). Second, we show that the state is highly entangled in the sense that a large number of ebits are needed in order to create the state: entanglement cost is larger than a constant, independent of d. The second result is shown to imply that the regularised relative entropy with respect to separable states is also lower bounded by a constant. Finally, we note that the regularised relative entropy of entanglement is asymptotically continuous in the state. Elementary and advanced facts from the representation theory of the unitary group, including the concept of plethysm, play a central role in the proofs of the main results.

/pdf/entanglement-of-the-antisymmetric-state-23jfbfm14t.pdf

Entanglement of the Antisymmetric State

When describing the eﬀective dynamics of an observable in a many-body system, the repeated randomness assumption , which states that the system returns in a short time to a maximum entropy state, is a crucial hypothesis to guarantee that the eﬀective dynamics is classical, Markovian and obeys local detailed balance. While the latter behaviour is frequently observed in naturally occur-ring processes, the repeated randomness assumption is in blatant contradiction to the microscopic reversibility of the system. Here, we show that the use of the repeated randomness assumption can be justiﬁed in the description of the eﬀective dynamics of an observable that is both slow and coarse , two properties we will deﬁne rigorously. Then, our derivation will invoke essentially only the eigenstate thermalization hypothesis and typicality arguments. While the assumption of a slow observable is subtle, as it provides only a necessary but not suﬃcient condition, it also oﬀers a unifying perspective applicable to, e.g., open systems as well as collective observables of many-body systems. All our ideas are numerically veriﬁed by studying density waves in spin chains.

Classicality, Markovianity and local detailed balance from pure state dynamics

We bring together two subjects in the realm of quantum information theory that might at first glance seem far apart: the theory of universal computation in a quantum computer, and noise resistant coding of classical information in quantum channels.

http://ieeexplore.ieee.org/iel5/7942/21920/01023342.pdf

Andreas Winter

Papers

The structure of R\'enyi entropic inequalities

On the Chernoff distance for asymptotic LOCC discrimination of bipartite quantum states

Entanglement of the Antisymmetric State

Classicality, Markovianity and local detailed balance from pure state dynamics

Scalable programmable quantum gates and a new aspect of the additivity problem for the classical capacity of quantum channels