Explore the vast range of titles available.

Formalisms for higher order quantum processes provide a theoretical formalisation of quantum processes where the order of agents’ operations need not be definite and acyclic, but may be subject to quantum superpositions. This has led to the concept of indefinite causal structures (ICS) which have garnered much interest. However, the interface between these information-theoretic approaches and spatiotemporal notions of causality is less understood, and questions relating to the physical realisability of ICS in a spatiotemporal context persist despite progress in their information-theoretic characterisation. Further, previous work suggests that composition of processes is not so straightforward in ICS frameworks, which raises the question of how this connects with the observed composability of physical experiments in spacetime. To address these points, we compare the formalism of quantum circuits with quantum control of causal order (QC-QC), which models an interesting class of ICS processes, with that of causal boxes, which models composable quantum information protocols in spacetime. We incorporate the set-up assumptions of the QC-QC framework into the spatiotemporal perspective and show that every QC-QC can be mapped to a causal box that satisfies these set up assumptions and acts on a Fock space while reproducing the QC-QC’s behaviour in a relevant subspace defined by the assumptions. Using a recently introduced concept of fine-graining, we show that the causal box corresponds to a fine-graining of the QC-QC, which unravels the original ICS of the QC-QC into a set of quantum operations with a well-defined and acyclic causal order, compatible with the spacetime structure. Our results also clarify how the composability of physical experiments is recovered, while highlighting the essential role of relativistic causality and the Fock space structure.

Mathematical modeling has become a major tool to guide the characterization and synthetic construction of cellular processes. However, models typically lose their capacity to explain or predict experimental outcomes as soon as any, even minor, modification of the studied system or its operating conditions is implemented. This limits our capacity to fully comprehend the functioning of natural biological processes and is a major roadblock for the de novo design of complex synthetic circuits. A common cause of this problem is that cell-to-cell variability creates couplings between single-cell circuits and population processes such as selection or growth. Altering the circuit may then have unforeseen consequences inside growing populations. Here we construct a yeast optogenetic differentiation system that exploits cell-to-cell variability to enable external control of the population composition.We show that a simple deterministic model can explain the dynamics of the core system. However, modifying the context of the circuit by expressing system components from plasmids leads to failure of model predictions. Subsequently, we deploy theory from stochastic chemical kinetics to construct models of the system’s components that simultaneously track single-cell and population processes and demonstrate that this allows us to quantitatively predict emerging dynamics of the plasmid-based system without any adjustment of model parameters. We conclude that carefully characterizing the dynamics of cell-to-cell variability using appropriate modeling theory may allow one to unravel the complex interplay of stochastic single-cell and population processes and to predict the functionality of complex synthetic circuits in growing populations before the circuit is constructed.

Entropy can signify different things. For instance, heat transfer in thermodynamics or a measure of information in data analysis. Many entropies have been introduced, and it can be difficult to ascertain their respective importance and merits. Here, we consider entropy in an abstract sense, as a functional on a probability space, and we review how being able to handle the trivial case of non-interacting systems, together with the subtle requirement of extensivity, allows for a systematic classification of the functional form.

Secure computation is a powerful cryptographic tool that encompasses the evaluation of any multivariate function with arbitrary inputs from mutually distrusting parties. The oblivious transfer primitive serves is a basic building block for the general task of secure multi-party computation. Therefore, analyzing the security in the universal composability framework becomes mandatory when dealing with multi-party computation protocols composed of oblivious transfer subroutines. Furthermore, since the required number of oblivious transfer instances scales with the size of the circuits, oblivious transfer remains as a bottleneck for large-scale multi-party computation implementations. Techniques that allow one to extend a small number of oblivious transfers into a larger one in an efficient way make use of the oblivious transfer variant called randomized oblivious transfer. In this work, we present randomized versions of two known oblivious transfer protocols, one quantum and another post-quantum with ring learning with an error assumption. We then prove their security in the quantum universal composability framework, in a common reference string model.

The chemical industry and subsequent value chain of plastics are facing significant challenges from the viewpoints of resource conversion and environmental burden. Now is the time to explore the future direction of plastics, which will require an integrated scheme using resource circulation, carbon neutrality, and a social system to promote after-use treatment under the concept of a circular economy. Polylactic acid (PLA) should help reduce greenhouse gas (GHG) emissions as a biobased material and contribute to waste management after use due to its biodegradability if managed properly. That is, it will be necessary to treat biodegradable products appropriately in closed systems such as composting facilities after use and recovery. To realize the implementation of fully approved composting facilities in society, simply evaluating biodegradability in the laboratory is insufficient. In this study, a pilot-scale test using PLA under actual composting conditions was conducted in accordance with both international standards and domestic evaluation methods. The results not only confirm its biodegradability and disintegration, but also demonstrate that the presence of a biodegradable plastic product has a negligible impact on the composting process. The obtained compost did not adversely affect plant germination or growth, demonstrating its safety and high quality. Such a multifaceted perspective makes this study unique and useful for creating a social framework.

Quantum computing has seen tremendous progress in the past few years. However, due to limitations in the scalability of quantum technologies, it seems that we are far from constructing universal quantum computers for everyday users. A more feasible solution is the delegation of computation to powerful quantum servers on the network. This solution was proposed in previous studies of blind quantum computation, with guarantees for both the secrecy of the input and of the computation being performed. In this work, we further develop this idea of computing over encrypted data, to propose a multiparty delegated quantum computing protocol in the measurement-based quantum computing framework. We prove the security of the protocol against a dishonest server and against dishonest clients, under the assumption of common classical cryptographic constructions.

Constructing a knowledge structure using the variable precision FT ‐rough set model is an effective approach. Because directly constructing a knowledge structure for a subject or field is challenging, synthesizing global information from local information is a viable solution. However, local information often overlaps (partially); therefore, ensuring consistency between global and local information is crucial, which is an urgent issue to address. Therefore, based on the variable precision FT ‐rough set model and the knowledge structure constructed from it, this paper proposes and proves the conditions for the composability of knowledge structures constructed using the lower (upper) inverse operator of the variable precision FT- rough set. Under these conditions, the knowledge structures constructed, respectively, from the local fuzzy approximation spaces can be integrated into the global knowledge structure.

In this paper, using the full security framework for continuous-variable quantum key distribution (CV-QKD), we provide a composable security proof for the CV-QKD system in a realistic implementation. We take into account equipment losses and contributions from various components of excess noise and evaluate performance against collective and coherent attacks assuming trusted hardware noise. The calculation showed that the system remains operable at channel losses up to 10.2 dB in the presence of collective attacks and up to 7.5 dB in the presence of coherent ones.

Everlasting security models the setting where hardness assumptions hold during the execution of a protocol but may get broken in the future. Due to the strength of this adversarial model, achieving any meaningful security guarantees for composable protocols is impossible without relying on hardware assumptions (Müller-Quade and Unruh, JoC’10). For this reason, a rich line of research has tried to leverage physical assumptions to construct well-known everlasting cryptographic primitives, such as commitment schemes. The only known everlastingly UC secure commitment scheme, due to Müller-Quade and Unruh (JoC’10), assumes honestly generated hardware tokens. The authors leave the possibility of constructing everlastingly UC secure commitments from malicious hardware tokens as an open problem. Goyal et al. (Crypto’10) constructs unconditionally UC-secure commitments and secure computation from malicious hardware tokens, with the caveat that the honest tokens must encapsulate other tokens. This extra restriction rules out interesting classes of hardware tokens, such as physically uncloneable functions (PUFs). In this work, we present the first construction of an everlastingly UC-secure commitment scheme in the fully malicious token model without requiring honest token encapsulation. Our scheme assumes the existence of PUFs and is secure in the common reference string model. We also show that our results are tight by giving an impossibility proof for everlasting UC-secure computation from non-erasable tokens (such as PUFs), even with trusted setup.

The linkable ring signature supporting stealth addresses (SALRS) is a recently proposed cryptographic primitive, which is designed to comprehensively address the soundness and privacy requirements associated with concealing the identities of both the payer and payee in cryptocurrency transactions. However, concerns regarding the scalability of SALRS have been underexplored. This becomes notably pertinent in intricate blockchain systems where multiple cryptographic primitives operate concurrently. To bridge this gap, our work revisited and formalized the ideal functionality of SALRS within the universal composability (UC) model. This encapsulates all correctness, soundness, and privacy considerations. Moreover, we established that the newly proposed UC-security property for SALRS is equivalent to the concurrent satisfaction of signer-unlinkability, signer-non-slanderability, signer-anonymity, and master-public-key-unlinkability. These properties represent the four crucial game-based security aspects of SALRS. This result ensures the ongoing security of previously presented SALRS constructions within the UC framework. It also underscores their adaptability for seamless integration with other UC-secure primitives in complex blockchain systems.