Invariant-free deduction systems for temporal logic

In this thesis we propose a new approach to deduction methods for temporal logic. Our proposal is based on an inductive definition of eventualities that is different from the usual one. On the basis of this non-customary inductive definition for eventualities, we first provide dual systems of tableaux and sequents for Propositional Linear-time Temporal Logic (PLTL). Then, we adapt the deductive approach introduced by means of these dual tableau and sequent systems to the resolution framework and we present a clausal temporal resolution method for PLTL. Finally, we make use of this new clausal temporal resolution method for establishing logical foundations for declarative temporal logic programming languages. The key element in the deduction systems for temporal logic is to deal with eventualities and hidden invariants that may prevent the fulfillment of eventualities. Different ways of addressing this issue can be found in the works on deduction systems for temporal logic. Traditional tableau systems for temporal logic generate an auxiliary graph in a first pass.Then, in a second pass, unsatisfiable nodes are pruned. In particular, the second pass must check whether the eventualities are fulfilled. The one-pass tableau calculus introduced by S. Schwendimann requires an additional handling of information in order to detect cyclic branches that contain unfulfilled eventualities. Regarding traditional sequent calculi for temporal logic, the issue of eventualities and hidden invariants is tackled by making use of a kind of inference rules (mainly, invariant-based rules or infinitary rules) that complicates their automation. A remarkable consequence of using either a two-pass approach based on auxiliary graphs or aone-pass approach that requires an additional handling of information in the tableau framework, and either invariant-based rules or infinitary rules in the sequent framework, is that temporal logic fails to carry out the classical correspondence between tableaux and sequents. In this thesis, we first provide a one-pass tableau method TTM that instead of a graph obtains a cyclic tree to decide whether a set of PLTL-formulas is satisfiable. In TTM tableaux are classical-like. For unsatisfiable sets of formulas, TTM produces tableaux whose leaves contain a formula and its negation. In the case of satisfiable sets of formulas, TTM builds tableaux where each fully expanded open branch characterizes a collection of models for the set of formulas in the root. The tableau method TTM is complete and yields a decision procedure for PLTL. This tableau method is directly associated to a one-sided sequent calculus called TTC. Since TTM is free from all the structural rules that hinder the mechanization of deduction, e.g. weakening and contraction, then the resulting sequent calculus TTC is also free from this kind of structural rules. In particular, TTC is free of any kind of cut, including invariant-based cut. From the deduction system TTC, we obtain a two-sided sequent calculus GTC that preserves all these good freeness properties and is finitary, sound and complete for PLTL. Therefore, we show that the classical correspondence between tableaux and sequent calculi can be extended to temporal logic. The most fruitful approach in the literature on resolution methods for temporal logic, which was started with the seminal paper of M. Fisher, deals with PLTL and requires to generate invariants for performing resolution on eventualities. In this thesis, we present a new approach to resolution for PLTL. The main novelty of our approach is that we do not generate invariants for performing resolution on eventualities. Our method is based on the dual methods of tableaux and sequents for PLTL mentioned above. Our resolution method involves translation into a clausal normal form that is a direct extension of classical CNF. We first show that any PLTL-formula can be transformed into this clausal normal form. Then, we present our temporal resolution method, called TRS-resolution, that extends classical propositional resolution. Finally, we prove that TRS-resolution is sound and complete. In fact, it finishes for any input formula deciding its satisfiability, hence it gives rise to a new decision procedure for PLTL. In the field of temporal logic programming, the declarative proposals that provide a completeness result do not allow eventualities, whereas the proposals that follow the imperative future approach either restrict the use of eventualities or deal with them by calculating an upper bound based on the small model property for PLTL. In the latter, when the length of a derivation reaches the upper bound, the derivation is given up and backtracking is used to try another possible derivation. In this thesis we present a declarative propositional temporal logic programming language, called TeDiLog, that is a combination of the temporal and disjunctive paradigms in Logic Programming. We establish the logical foundations of our proposal by formally defining operational and logical semantics for TeDiLog and by proving their equivalence. Since TeDiLog is, syntactically, a sublanguage of PLTL, the logical semantics of TeDiLog is supported by PLTL logical consequence. The operational semantics of TeDiLog is based on TRS-resolution. TeDiLog allows both eventualities and always-formulas to occur in clause heads and also in clause bodies. To the best of our knowledge, TeDiLog is the first declarative temporal logic programming language that achieves this high degree of expressiveness. Since the tableau method presented in this thesis is able to detect that the fulfillment of an eventuality is prevented by a hidden invariant without checking for it by means of an extra process, since our finitary sequent calculi do not include invariant-based rules and since our resolution method dispenses with invariant generation, we say that our deduction methods are invariant-free.

Long-lived oscillatory incoherent electron dynamics in molecules: trans-polyacetylene oligomers

We identify an intriguing feature of the electron-vibrational dynamics of molecular systems via a computational examination of trans-polyacetylene oligomers. Here, via the vibronic interactions, the decay of an electron in the conduction band resonantly excites an electron in the valence band, and vice versa, leading to oscillatory exchange of electronic population between two distinct electronic states that lives for up to tens of picoseconds. The oscillatory structure is reminiscent of beating patterns between quantum states and is strongly suggestive of the presence of long-lived molecular electronic coherence. Significantly, however, a detailed analysis of the electronic coherence properties shows that the oscillatory structure arises from a purely incoherent process. These results were obtained by propagating the coupled dynamics of electronic and vibrational degrees of freedom in a mixed quantum-classical study of the Su-Schrieffer-Heeger Hamiltonian for polyacetylene. The incoherent process is shown to occur between degenerate electronic states with distinct electronic configurations that are indirectly coupled via a third auxiliary state by vibronic interactions. A discussion of how to construct electronic superposition states in molecules that are truly robust to decoherence is also presented

A formalism based on moments for classical and quantum cosmology

Spanish Relativity Meeting (ERE 2014) Valencia, SPAIN, SEP 01-05, 2014

Classical and quantum approaches to the interaction of light and matter at the nanoscale

168 p.

Quantum simulations of relativistic quantum physics in circuit QED

We present a scheme for simulating relativistic quantum physics in circuit quantum electrodynamics. By using three classical microwave drives, we show that a superconducting qubit strongly coupled to a resonator field mode can be used to simulate the dynamics of the Dirac equation and Klein paradox in all regimes. Using the same setup we also propose the implementation of the Foldy-Wouthuysen canonical transformation, after which the time derivative of the position operator becomes a constant of the motion.

From transistor to trapped-ion computers for quantum chemistry

Over the last few decades, quantum chemistry has progressed through the development of computational methods based on modern digital computers. However, these methods can hardly fulfill the exponentially-growing resource requirements when applied to large quantum systems. As pointed out by Feynman, this restriction is intrinsic to all computational models based on classical physics. Recently, the rapid advancement of trapped-ion technologies has opened new possibilities for quantum control and quantum simulations. Here, we present an efficient toolkit that exploits both the internal and motional degrees of freedom of trapped ions for solving problems in quantum chemistry, including molecular electronic structure, molecular dynamics, and vibronic coupling. We focus on applications that go beyond the capacity of classical computers, but may be realizable on state-of-the-art trapped-ion systems. These results allow us to envision a new paradigm of quantum chemistry that shifts from the current transistor to a near-future trapped-ion-based technology.

Embedding quantum simulators

79 p.

The Forbidden Quantum Adder

Quantum information provides fundamentally different computational resources than classical information. We prove that there is no unitary protocol able to add unknown quantum states belonging to different Hilbert spaces. This is an inherent restriction of quantum physics that is related to the impossibility of copying an arbitrary quantum state, i.e., the no-cloning theorem. Moreover, we demonstrate that a quantum adder, in absence of an ancillary system, is also forbidden for a known orthonormal basis. This allows us to propose an approximate quantum adder that could be implemented in the lab. Finally, we discuss the distinct character of the forbidden quantum adder for quantum states and the allowed quantum adder for density matrices.

Redes sociales y correspondencia epistolar. Del análisis cualitativo de las relaciones personales a la reconstrucción de redes egocentradas

[ES] En Historia, la correspondencia epistolar privada, en cuanto medio de comunicación entre personas, es la única fuente documental que revela las interacciones directas, no mediatizadas institucionalmente, entre actores sociales. El artículo explora las posibilidades de esta fuente tanto para el análisis cualitativo e intensivo de las relaciones personales como para reconstruir la “red egocentrada” del receptor de las cartas y llevar a cabo un análisis efectivo de redes sociales, aplicando los métodos y parámetros del “Social Network Analysis”. A partir de dos ejemplos centrados en epistolarios del siglo XVIII, los autores muestran las posibilidades y limitaciones de los análisis cualitativos clásicos y el interés de las aportaciones específicas del análisis de redes egocentradas, abogando por la combinación de ambas metodologías.

Is General Relativity a simplified theory?

IARD 8th Biennial Conference on Classical and Quantum Relativistic Dynamics of Particles and Fields - Galileo Galilei Inst Theoret Phys (GGI), Florence, ITALY - MAY 29-JUN 01, 2012. Edited by:Horowitz, LP

Pumped double quantum dot with spin-orbit coupling

We study driven by an external electric field quantum orbital and spin dynamics of electron in a one-dimensional double quantum dot with spin-orbit coupling. Two types of external perturbation are considered: a periodic field at the Zeeman frequency and a single half-period pulse. Spin-orbit coupling leads to a nontrivial evolution in the spin and orbital channels and to a strongly spin-dependent probability density distribution. Both the interdot tunneling and the driven motion contribute into the spin evolution. These results can be important for the design of the spin manipulation schemes in semiconductor nanostructures.

Optimally robust shortcuts to population inversion in two-level quantum systems

19 p.

The effects of disorder in dimerized quantum magnets in mean field approximations

15 p.

Dual-path methods for propagating quantum microwaves

We study quantum state tomography, entanglement detection and channel noise reconstruction of propagating quantum microwaves via dual-path methods. The presented schemes make use of the following key elements: propagation channels, beam splitters, linear amplifiers and field quadrature detectors. Remarkably, our methods are tolerant to the ubiquitous noise added to the signals by phase-insensitive microwave amplifiers. Furthermore, we analyse our techniques with numerical examples and experimental data, and compare them with the scheme developed in Eichler et al (2011 Phys. Rev. Lett. 106 220503; 2011 Phys. Rev. Lett. 107 113601), based on a single path. Our methods provide key toolbox components that may pave the way towards quantum microwave teleportation and communication protocols.

Design and synthesis of biofunctional magnetic/fluorescent glyco-nanoparticles and quantum dots and their application as specific molecular imaging probes

206 p.