Measurement-based quantum computation and undecidable logic
From MaRDI portal
Publication:930147
Abstract: We establish a connection between measurement-based quantum computation and the field of mathematical logic. We show that the computational power of an important class of quantum states called graph states, representing resources for measurement-based quantum computation, is reflected in the expressive power of (classical) formal logic languages defined on the underlying mathematical graphs. In particular, we show that for all graph state resources which can yield a computational speed-up with respect to classical computation, the underlying graphs--describing the quantum correlations of the states--are associated with undecidable logic theories. Here undecidability is to be interpreted in a sense similar to Goedel's incompleteness results, meaning that there exist propositions, expressible in the above classical formal logic, which cannot be proven or disproven.
Recommendations
Cites work
Cited in
(14)- Boolean powers and quantum measurements
- Quantum logic is undecidable
- Undecidability of the Spectral Gap
- scientific article; zbMATH DE number 6746918 (Why is no real title available?)
- Topos logic in measurement-based quantum computation
- Undecidability and the problem of outcomes in quantum measurements
- Outcome determinism in measurement-based quantum computation with qudits
- Determinism and computational power of real measurement-based quantum computation
- Measurement-based quantum computation cannot avoid byproducts
- Epistemic horizons and the foundations of quantum mechanics
- Measurement theory in Deutsch's algorithm based on the truth values
- scientific article; zbMATH DE number 7339588 (Why is no real title available?)
- Interaction-free measurements and counterfactual computation in IBM quantum computers
- (Un)decidable Problems about Reachability of Quantum Systems
This page was built for publication: Measurement-based quantum computation and undecidable logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q930147)