Model Checking Quantum Continuous-Time Markov Chains

• URL: http://arxiv.org/abs/2105.00382v1
• Date: Sun, 2 May 2021 02:46:19 GMT
• Title: Model Checking Quantum Continuous-Time Markov Chains
• Authors: Ming Xu, Jingyi Mei, Ji Guan and Nengkun Yu
• Abstract summary: We initialised the model checking of quantum continuous-time Markov chain (QCTMC) As a real-time system, we specify the temporal properties on QCTMC by signal temporal logic (STL)
• Score: 11.182363315152399
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Verifying quantum systems has attracted a lot of interests in the last decades. In this paper, we initialised the model checking of quantum continuous-time Markov chain (QCTMC). As a real-time system, we specify the temporal properties on QCTMC by signal temporal logic (STL). To effectively check the atomic propositions in STL, we develop a state-of-art real root isolation algorithm under Schanuel's conjecture; further, we check the general STL formula by interval operations with a bottom-up fashion, whose query complexity turns out to be linear in the size of the input formula by calling the real root isolation algorithm. A running example of an open quantum walk is provided to demonstrate our method.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Quantum Dissipative Search via Lindbladians [0.0]
  We analyze the convergence criteria and the convergence speed of a Markovian, purely dissipative quantum random walk on an unstructured search space. We map the results onto an actual implementation to correctly estimate the potential and show that it is no more efficient than classical search.
  arXiv  Detail & Related papers  (2024-07-16T14:39:18Z)
• Measurement-based Verification of Quantum Markov Chains [5.2309491455961465]
  We propose the measurement-based linear-time temporal logic MLTL to check quantitative properties. We use it to simultaneously verify linear-time properties of both quantum and classical random walks.
  arXiv  Detail & Related papers  (2024-05-09T15:00:39Z)
• Parallel-in-time quantum simulation via Page and Wootters quantum time [0.0]
  We present quantum algorithms for parallel-in-time simulations inspired by the Page and Wooters formalism. We show that our algorithms can compute temporal properties over $N$ different times of many-body systems. We rigorously prove that the entanglement created between the system qubits and the clock qubits has operational meaning.
  arXiv  Detail & Related papers  (2023-08-24T17:32:41Z)
• Robust Extraction of Thermal Observables from State Sampling and Real-Time Dynamics on Quantum Computers [49.1574468325115]
  We introduce a technique that imposes constraints on the density of states, most notably its non-negativity, and show that this way, we can reliably extract Boltzmann weights from noisy time series. Our work enables the implementation of the time-series algorithm on present-day quantum computers to study finite temperature properties of many-body quantum systems.
  arXiv  Detail & Related papers  (2023-05-30T18:00:05Z)
• Real-Time Krylov Theory for Quantum Computing Algorithms [0.0]
  New approaches using subspaces generated by real-time evolution have shown efficiency in extracting eigenstate information. We develop the variational quantum phase estimation (VQPE) method, a compact and efficient real-time algorithm to extract eigenvalues on quantum hardware. We discuss its application to fundamental problems in quantum computation such as electronic structure predictions for strongly correlated systems.
  arXiv  Detail & Related papers  (2022-08-01T18:00:48Z)
• Adiabatic Quantum Computing for Multi Object Tracking [170.8716555363907]
  Multi-Object Tracking (MOT) is most often approached in the tracking-by-detection paradigm, where object detections are associated through time. As these optimization problems are often NP-hard, they can only be solved exactly for small instances on current hardware. We show that our approach is competitive compared with state-of-the-art optimization-based approaches, even when using of-the-shelf integer programming solvers.
  arXiv  Detail & Related papers  (2022-02-17T18:59:20Z)
• Algebraic Compression of Quantum Circuits for Hamiltonian Evolution [52.77024349608834]
  Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware. We present an algorithm that compresses the Trotter steps into a single block of quantum gates. This results in a fixed depth time evolution for certain classes of Hamiltonians.
  arXiv  Detail & Related papers  (2021-08-06T19:38:01Z)
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
  We present a constructive algorithm for generating quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
  arXiv  Detail & Related papers  (2021-04-01T19:06:00Z)
• Fast and differentiable simulation of driven quantum systems [58.720142291102135]
  We introduce a semi-analytic method based on the Dyson expansion that allows us to time-evolve driven quantum systems much faster than standard numerical methods. We show results of the optimization of a two-qubit gate using transmon qubits in the circuit QED architecture.
  arXiv  Detail & Related papers  (2020-12-16T21:43:38Z)
• Open quantum systems beyond Fermi's golden rule: Diagrammatic expansion of the steady-state time-convolutionless master equation [0.0]
  We develop a diagrammatic approach to evaluate the steady-state TCL generator based on operators rather than superoperators. We benchmark our method on a single non-interacting level coupled to Fermi reservoirs, where we recover the exact expansion to next-to-leading order.
  arXiv  Detail & Related papers  (2020-10-19T20:27:31Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.