English
Related papers

Related papers: A Transaction Represented with Weighted Finite-Sta…

200 papers

The partial transpose (PT) is an important function for entanglement testing and quantification and also for the study of geometrical aspects of the quantum state space. In this article, considering general bipartite and multipartite…

Quantum Physics · Physics 2016-11-09 Jonas Maziero

We propose TRAC, a tool for the specification and verification of coordinated multiparty distributed systems. Relying on finite-state machines (FSMs) where transition labels look like Hoare triples, \thetool can specify the coordination of…

Logic in Computer Science · Computer Science 2024-05-01 Joao Afonso , Elvis Konjoh Selabi , Maurizio Murgia , Antonio Ravara , Emilio Tuosto

Parameterized verification of coverability in broadcast networks with finite state processes has been studied for different types of models and topologies. In this paper, we attempt to develop a theory of broadcast networks in which the…

Logic in Computer Science · Computer Science 2018-09-11 A. R. Balasubramanian

The XX model with uniform couplings represents the most natural choice for quantum state transfer through spin chains. Given that it has long been established that single-qubit states cannot be transferred with perfect fidelity in this…

Quantum Physics · Physics 2014-12-04 Rúben Sousa , Yasser Omar

In a recent work (arXiv:2207.01954), we showed that a uniformly coupled chain could be symmetrically extended by engineered spin chains in such a way that we could choose part of the spectrum of the overall system. When combined with an…

Quantum Physics · Physics 2022-07-26 Alastair Kay

Quantum computers are not yet up to the task of providing computational advantages for practical stochastic diffusion models commonly used by financial analysts. In this paper we introduce a class of stochastic processes that are both…

Quantum Physics · Physics 2023-11-03 Eric Ghysels , Jack Morgan , Hamed Mohammadbagherpoor

In this note we propose a method based on artificial neural network to study the transition between states governed by stochastic processes. In particular, we aim for numerical schemes for the committor function, the central object of…

Machine Learning · Computer Science 2018-03-01 Yuehaw Khoo , Jianfeng Lu , Lexing Ying

In this document, some novel theoretical and computational techniques for constrained approximation of data-driven systems, are presented. The motivation for the development of these techniques came from structure-preserving matrix…

Optimization and Control · Mathematics 2019-07-22 Fredy Vides

In this paper, a framework for the analysis of the transmission-computation-energy tradeoff in wireless and fixed networks is introduced. The analysis of this tradeoff considers both the transmission energy as well as the energy consumed at…

Information Theory · Computer Science 2010-08-27 P. Rost , G. Fettweis

We present a suite of algorithmic techniques for handling substitution tilings by treating a tile's hierarchy of supertiles in a purely combinatorial fashion using finite state automata. The resulting techniques are very convenient for…

Combinatorics · Mathematics 2026-03-17 Simon Tatham

In this paper, we investigate a high-dimensional quantum state transfer protocol. An arbitrary unknown high-dimensional state can be transferred with high fidelity between two remote registers through a XX coupling spin chain of arbitrary…

Quantum Physics · Physics 2013-04-29 Wei Qin , Chuan Wang , Gui-Lu Long

Implementing smart contracts to automate the performance of high-value over-the-counter (OTC) financial derivatives is a formidable challenge. Due to the regulatory framework and the scale of financial risk if a contract were to go wrong,…

Software Engineering · Computer Science 2018-05-31 Christopher D. Clack , Gabriel Vanca

Transition path theory (TPT) is a mathematical framework for quantifying rare transition events between a pair of selected metastable states $A$ and $B$. Central to TPT is the committor function, which describes the probability to hit the…

Numerical Analysis · Mathematics 2026-01-22 Zezheng Song , Maria K. Cameron , Haizhao Yang

Transducers generalise automata by producing output word(s) for each input word, thereby defining a relation over words. A transducer is said to be finite-valued if, for every input word, it produces at most $k$ output words, for some…

Formal Languages and Automata Theory · Computer Science 2026-05-08 Prince Mathew , Saina Sunny

In this paper, we consider finite-time state agreement problems for continuous-time multi-agent systems and propose two protocols, which ensure that states of agents reach an agreement in a finite time. Moreover, the second protocol solves…

Dynamical Systems · Mathematics 2007-05-23 Feng Xiao , Long Wang

We prove that almost-linear-time high-fidelity state transfer is achievable in a quantum spin chain using loop weights at the second and second-to-last nodes. We provide specific parameter values, and using a careful analysis of the…

Quantum Physics · Physics 2026-01-29 Gabor Lippner , Yujia Shi

We present a switching control strategy based on Lyapunov control for arbitrary state transitions in open qubit systems. With coherent vector representation, we propose a switching control strategy, which can prevent the state of the qubit…

Quantum Physics · Physics 2024-03-29 Guangpu Wu , Shibei Xue , Shan Ma , Sen Kuang , Daoyi Dong , Ian R. Petersen

An option is a financial agreement between two parties to trade two assets. One party is given the right, but not the obligation, to complete the swap before a specified termination time. In todays financial markets, an option is considered…

Cryptography and Security · Computer Science 2022-05-09 Daniel Engel , Yingjie Xue

We analyse the sensitivity of a spin chain modelled by an undirected weighted connected graph exhibiting perfect state transfer to small perturbations in readout time and edge weight in order to obtain physically relevant bounds on the…

Quantum Physics · Physics 2016-03-23 Whitney Gordon , Steve Kirkland , Chi-Kwong Li , Sarah Plosker , Xiaohong Zhang

In this paper we propose I/O state transition diagrams for service description In contrast to other techniques like for example Statecharts we allow to model non atomic services by sequences of transitions This is especially important in a…

Software Engineering · Computer Science 2014-09-26 Barbara Paech , Bernhard Rumpe
‹ Prev 1 3 4 5 6 7 10 Next ›