In this paper we develop an approach to model-checking for timed automata via reachability testin... more In this paper we develop an approach to model-checking for timed automata via reachability testing. As our specification formalism, we consider a dense-time property language with clocks. This property language may be used to express safety and bounded liveness properties of real-time systems. We show how to automatically synthesize, for every formula ϕ, a test automaton Tϕ in such a way that checking whether a system S satisfies the property ϕ can be reduced to a reachability question over the system obtained by making Tϕ interact with S.
We show that the phase sensitivity $\Delta \theta$ of a Mach-Zehnder interferometer fed by a cohe... more We show that the phase sensitivity $\Delta \theta$ of a Mach-Zehnder interferometer fed by a coherent state in one input port and squeezed-vacuum in the other one is i) independent from the true value of the phase shift and ii) can reach the Heisenberg limit $\Delta \theta \sim 1/N_T$, where $N_T$ is the average number of particles of the input states. We also show that the Cramer-Rao lower bound, $\Delta \theta \propto 1/ \sqrt{|\alpha|^2 e^{2r} + \sinh^2r}$, can be saturated for arbitrary values of the squeezing parameter $r$ and the amplitude of the coherent mode $|\alpha|$ by a Bayesian phase inference protocol.
We show that the quantum Fisher information provides a sufficient condition to recognize multipar... more We show that the quantum Fisher information provides a sufficient condition to recognize multiparticle entanglement in a N qubit state. The same criterion gives a necessary and sufficient condition for sub shot-noise phase sensitivity in the estimation of a collective rotation angle θ. The analysis therefore singles out the class of entangled states which are useful to overcome classical phase sensitivity in metrology and sensors. We finally study the creation of useful entangled states by the non-linear dynamical evolution of two decoupled Bose-Einstein condensates or trapped ions.
We experimentally demonstrate phase sensitivity at the standard quantum limit independent of phas... more We experimentally demonstrate phase sensitivity at the standard quantum limit independent of phase using Bayesian phase estimation. This technique is unbiased and saturates the Cramer-Rao lower bound representing the optimum technique using coherent states.
We study the quantum dynamics of a BEC condensate trapped in a double-well potential with a risin... more We study the quantum dynamics of a BEC condensate trapped in a double-well potential with a rising interwell barrier. We analytically find the characteristic time scales of the splitting process and compare our results with numerical analyses available in the literature. In first stage of the dynamics, the condensate follows adiabatically the rising of the interwell barrier. At a critical time $t_{ad}$, small amplitude fluctuations around the average trajectory increase exponentially fast, signaling the break-down of adiabaticity. We have found a highly non-trivial dependence of the dephasing time $t_D$, defined by $\sigma_{\phi}(t_D)=1$, where $\sigma_{\phi}(t)$ is the dynamical quantum phase spreading, on $t_{ad}$ and on the ramping time of the interwell barrier.
In this paper we develop an approach to model-checking for timed automata via reachability testin... more In this paper we develop an approach to model-checking for timed automata via reachability testing. As our specification formalism, we consider a dense-time logic with clocks. This logic may be used to express safety and bounded liveness properties of real-time systems. We show how to automatically synthesize, for every logical formula ϕ, a socalled test automaton Tϕ in such a way that checking whether a system S satisfies the property ϕ can be reduced to a reachability question over the system obtained by making Tϕ interact with S. The testable logic we consider is both of practical and theoretical interest. On the practical side, we have used the logic, and the associated approach to model-checking via reachability testing it supports, in the specification and verification in Uppaal of a collision avoidance protocol. On the theoretical side, we show that the logic is powerful enough to permit the definition of characteristic properties, with respect to a timed version of the ready simulation preorder, for nodes of deterministic, τ -free timed automata. This allows one to compute behavioural relations via our model-checking technique, therefore effectively reducing the problem of checking the existence of a behavioural relation among states of a timed automaton to a reachability problem.
In this paper we develop an approach to model-checking for timed automata via reachability testin... more In this paper we develop an approach to model-checking for timed automata via reachability testing. As our specification formalism, we consider a dense-time property language with clocks. This property language may be used to express safety and bounded liveness properties of real-time systems. We show how to automatically synthesize, for every formula ϕ, a test automaton Tϕ in such a way that checking whether a system S satisfies the property ϕ can be reduced to a reachability question over the system obtained by making Tϕ interact with S.
We show that the phase sensitivity $\Delta \theta$ of a Mach-Zehnder interferometer fed by a cohe... more We show that the phase sensitivity $\Delta \theta$ of a Mach-Zehnder interferometer fed by a coherent state in one input port and squeezed-vacuum in the other one is i) independent from the true value of the phase shift and ii) can reach the Heisenberg limit $\Delta \theta \sim 1/N_T$, where $N_T$ is the average number of particles of the input states. We also show that the Cramer-Rao lower bound, $\Delta \theta \propto 1/ \sqrt{|\alpha|^2 e^{2r} + \sinh^2r}$, can be saturated for arbitrary values of the squeezing parameter $r$ and the amplitude of the coherent mode $|\alpha|$ by a Bayesian phase inference protocol.
We show that the quantum Fisher information provides a sufficient condition to recognize multipar... more We show that the quantum Fisher information provides a sufficient condition to recognize multiparticle entanglement in a N qubit state. The same criterion gives a necessary and sufficient condition for sub shot-noise phase sensitivity in the estimation of a collective rotation angle θ. The analysis therefore singles out the class of entangled states which are useful to overcome classical phase sensitivity in metrology and sensors. We finally study the creation of useful entangled states by the non-linear dynamical evolution of two decoupled Bose-Einstein condensates or trapped ions.
We experimentally demonstrate phase sensitivity at the standard quantum limit independent of phas... more We experimentally demonstrate phase sensitivity at the standard quantum limit independent of phase using Bayesian phase estimation. This technique is unbiased and saturates the Cramer-Rao lower bound representing the optimum technique using coherent states.
We study the quantum dynamics of a BEC condensate trapped in a double-well potential with a risin... more We study the quantum dynamics of a BEC condensate trapped in a double-well potential with a rising interwell barrier. We analytically find the characteristic time scales of the splitting process and compare our results with numerical analyses available in the literature. In first stage of the dynamics, the condensate follows adiabatically the rising of the interwell barrier. At a critical time $t_{ad}$, small amplitude fluctuations around the average trajectory increase exponentially fast, signaling the break-down of adiabaticity. We have found a highly non-trivial dependence of the dephasing time $t_D$, defined by $\sigma_{\phi}(t_D)=1$, where $\sigma_{\phi}(t)$ is the dynamical quantum phase spreading, on $t_{ad}$ and on the ramping time of the interwell barrier.
In this paper we develop an approach to model-checking for timed automata via reachability testin... more In this paper we develop an approach to model-checking for timed automata via reachability testing. As our specification formalism, we consider a dense-time logic with clocks. This logic may be used to express safety and bounded liveness properties of real-time systems. We show how to automatically synthesize, for every logical formula ϕ, a socalled test automaton Tϕ in such a way that checking whether a system S satisfies the property ϕ can be reduced to a reachability question over the system obtained by making Tϕ interact with S. The testable logic we consider is both of practical and theoretical interest. On the practical side, we have used the logic, and the associated approach to model-checking via reachability testing it supports, in the specification and verification in Uppaal of a collision avoidance protocol. On the theoretical side, we show that the logic is powerful enough to permit the definition of characteristic properties, with respect to a timed version of the ready simulation preorder, for nodes of deterministic, τ -free timed automata. This allows one to compute behavioural relations via our model-checking technique, therefore effectively reducing the problem of checking the existence of a behavioural relation among states of a timed automaton to a reachability problem.
Uploads
Papers by luca augusto