相关论文: Safe Clockwork
In this work, we present a logical formalism for reasoning about quantum systems in finite dimension. Contrary to the usual approach in quantum logic, our formalism is based classical first-order logic, which allows us to use the tools of…
We study the stability of quantum motion of classically regular systems in presence of small perturbations. Onthe base of a uniform semiclassical theory we derive the fidelity decay which displays a quite complexbehaviour, from Gaussian to…
Despite the critical role of timing infrastructure in enabling essential services, from public key infrastructure and smart grids to autonomous navigation and high-frequency trading, modern timing stacks remain highly vulnerable to…
Feynman's model of a quantum computer provides an example of a continuous-time quantum walk. Its clocking mechanism is an excitation of a basically linear chain of spins with occasional controlled jumps which allow for motion on a planar…
We discuss protocols for quantum position verification schemes based on the standard quantum cryptographic assumption that a tagging device can keep classical data secure [Kent, 2011]. Our schemes use a classical key replenished by quantum…
Safe first-order formulas generalize the concept of a safe rule, which plays an important role in the design of answer set solvers. We show that any safe sentence is equivalent, in a certain sense, to the result of its grounding -- to the…
We propose a new composable and information-theoretically secure protocol to verify that a server has the power to sample from a sub-universal quantum machine implementing only commuting gates. By allowing the client to manipulate single…
Functional encryption is a powerful cryptographic primitive that enables fine-grained access to encrypted data and underlies numerous applications. Although the ideal security notion for FE (simulation security) has been shown to be…
We review recent suggestions for testing through B decays the flavor structure of CP violation in the Standard Model. Relative signs of CP asymmetries in U-spin related processes can by themselves test the Kobayashi-Maskawa mechanism in a…
In this paper, we propose a system-level approach for verifying the safety of neural network controlled systems, combining a continuous-time physical system with a discrete-time neural network based controller. We assume a generic model for…
The clockwork is a mechanism for generating light particles with exponentially suppressed interactions in theories which contain no small parameters at the fundamental level. We develop a general description of the clockwork mechanism valid…
Although the security of quantum cryptography is provable based on the principles of quantum mechanics, it can be compromised by the flaws in the design of quantum protocols and the noise in their physical implementations. So, it is…
This work presents a theoretical framework for the safety-critical control of time delay systems. The theory of control barrier functions, that provides formal safety guarantees for delay-free systems, is extended to systems with state…
We propose to analyse quantum protocols by applying formal verification techniques developed in classical computing for the analysis of communicating concurrent systems. One area of successful application of these techniques is that of…
In this survey we propose to cover the prose of post-quantum cryptography over classical cryptography. We talk about the various cryptographic methods that are being practiced to safeguard our information. The future of secure communication…
In this work we use the deformation procedure and explore the route to obtain distinct field theory models that present similar stability potentials. Starting from systems that interact polynomially or hyperbolically, we use a deformation…
We show that Feynman's Clock construction, in which the time-evolution of a closed quantum system is encoded as a ground state problem, can be extended to open quantum systems. In our formalism, the ground states of an ensemble of…
Based on our previous work on truly concurrent process algebras APTC, we use it to verify the security protocols. This work (called Secure APTC, abbreviated SAPTC) have the following advantages in verifying security protocols: (1) It has a…
We present a lattice-based scheme for homomorphic evaluation of quantum programs and proofs that remains secure against quantum adversaries. Classical homomorphic encryption is lifted to the quantum setting by replacing composite-order…
We search for the three-generation standard-like and/or Pati-Salam models from the $SO(32)$ heterotic string theory on smooth, quotient complete intersection Calabi-Yau threefolds with multiple line bundles, each with structure group…