English
Related papers

Related papers: Quantized State Hybrid Automata for Cyber-Physical…

200 papers

A quantum simulator is a restricted class of quantum computer that controls the interactions between quantum bits in a way that can be mapped to certain difficult quantum many-body problems. As more control is exerted over larger numbers of…

Quantum Physics · Physics 2018-02-07 J. Zhang , G. Pagano , P. W. Hess , A. Kyprianidis , P. Becker , H. Kaplan , A. V. Gorshkov , Z. -X. Gong , C. Monroe

Cyber-Physical Systems (CPSs), comprising both software and physical components, arise in many industry-relevant domains and are often mission- or safety-critical. System-Level Verification (SLV) of CPSs aims at certifying that given (e.g.,…

Software Engineering · Computer Science 2023-07-31 Toni Mancini , Igor Melatti , Enrico Tronci

Classical $(1+1)D$ cellular automata, as for instance Domany-Kinzel cellular automata, are paradigmatic systems for the study of non-equilibrium phenomena. Such systems evolve in discrete time-steps, and are thus free of time-discretisation…

Quantum Physics · Physics 2021-04-14 Edward Gillman , Federico Carollo , Igor Lesanovsky

Quantum computing allows for the manipulation of highly correlated states whose properties quickly go beyond the capacity of any classical method to calculate. Thus one natural problem which could lend itself to quantum advantage is the…

Quantum Physics · Physics 2024-12-19 Kevin Lively , Tim Bode , Jochen Szangolies , Jian-Xin Zhu , Benedikt Fauseweh

Generating accurate runtime safety estimates for autonomous systems is vital to ensuring their continued proliferation. However, exhaustive reasoning about future behaviors is generally too complex to do at runtime. To provide scalable and…

Logic in Computer Science · Computer Science 2023-03-30 Matthew Cleaveland , Oleg Sokolsky , Insup Lee , Ivan Ruchkin

Analog quantum simulators and digital quantum computers are two distinct paradigms driving near-term applications in modern quantum science, from probing many-body phenomena to identifying computational advantage over classical systems. A…

Quantum annealing (QA) has been proposed as a quantum enhanced optimization heuristic exploiting tunneling. Here, we demonstrate how finite range tunneling can provide considerable computational advantage. For a crafted problem designed to…

Quantum mechanical problems are among the hardest to simulate and, in some cases, remain intractable even for the most powerful computers. Quantum computing has emerged as a new technological platform to address such challenges, with rapid…

Quantum Physics · Physics 2025-09-01 Alexander Miessen

The past few years have witnessed the concrete and fast spreading of quantum technologies for practical computation and simulation. In particular, quantum computing platforms based on either trapped ions or superconducting qubits have…

Quantum Physics · Physics 2020-04-21 Francesco Tacchino , Alessandro Chiesa , Stefano Carretta , Dario Gerace

Quantum linear system algorithms (QLSAs) for gate-based quantum computing can provide exponential speedups for solving linear systems but face challenges when applied to finite element problems due to the growth of the condition number with…

Quantum Physics · Physics 2023-10-20 Osama Muhammad Raisuddin , Suvranu De

Characterization of quantum states is a fundamental requirement in quantum science and technology. As a promising framework, shadow tomography shows significant efficiency in estimating linear functions, however, for the challenging…

Quantum Physics · Physics 2024-04-19 Xu-Jie Peng , Qing Liu , Lu Liu , Ting Zhang , You Zhou , He Lu

The simulation of out-of-equilibrium dissipative quantum many body systems is a problem of fundamental interest to a number of fields in physics, ranging from condensed matter to cosmology. For unitary systems, tensor network methods have…

Quantum Physics · Physics 2019-10-30 Edward Gillman , Federico Carollo , Igor Lesanovsky

In this paper we present a quantization of Cellular Automata. Our formalism is based on a lattice of qudits, and an update rule consisting of local unitary operators that commute with their own lattice translations. One purpose of this…

Quantum Physics · Physics 2008-02-17 Carlos A. Perez-Delgado , Donny Cheung

Stress can increase the possibility of cognitive impairment and decrease the quality of life in older adults. Smart healthcare can deploy quantum machine learning to enable preventive and diagnostic support. This work introduces a unique…

Quantum Physics · Physics 2025-01-10 Md Saif Hassan Onim , Travis S. Humble , Himanshu Thapliyal

Entangled quantum states are essential ingredients for many quantum technologies, but they must be validated before they are used. As a full characterization is prohibitively resource-intensive, recent work has focused on developing methods…

In this paper we present a systematic view of Quantum Cellular Automata (QCA), a mathematical formalism of quantum computation. First we give a general mathematical framework with which to study QCA models. Then we present four different…

Quantum Physics · Physics 2007-05-23 Carlos A. Perez-Delgado , Donny Cheung

Determining ground state energies of quantum systems by hybrid classical/quantum methods has emerged as a promising candidate application for near-term quantum computational resources. Short of large-scale fault-tolerant quantum computers,…

Quantum Physics · Physics 2016-10-25 Nicholas C. Rubin

Digital quantum computers have the potential to study the dynamics of complex quantum systems. Nonequilibrium open quantum systems are, however, less straightforward to be implemented. Here we consider a collisional model representation of…

Quantum Physics · Physics 2023-10-02 Rebecca Erbanni , Xiansong Xu , Tommaso Demarie , Dario Poletti

We introduce a novel hybrid approach combining tensor network methods with the stabilizer formalism to address the challenges of simulating many-body quantum systems. By integrating these techniques, we enhance our ability to accurately…

Quantum Physics · Physics 2025-05-06 Antonio Francesco Mello , Alessandro Santini , Mario Collura

Intuitively, an (implementation) automata is simulated by a (specification) automata if every externally observable transition by the implementation automata can also be made by the specification automata. In this work, we present a…

Logic in Computer Science · Computer Science 2007-05-23 Farn Wang