Perfect state distinguishability and computational speedups with postselected closed timelike curves
From MaRDI portal
Publication:427292
DOI10.1007/s10701-011-9601-0zbMath1243.81023arXiv1008.0433OpenAlexW2113645261WikidataQ59832633 ScholiaQ59832633MaRDI QIDQ427292
Publication date: 13 June 2012
Published in: Foundations of Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1008.0433
General and philosophical questions in quantum theory (81P05) Quantum computation (81P68) Quantum measurement theory, state operations, state preparations (81P15) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)
Related Items (6)
Mixedness and entanglement in the presence of localized closed timelike curves ⋮ Time travel: Deutsch vs. teleportation ⋮ Simulations of closed timelike curves ⋮ Revisiting integer factorization using closed timelike curves ⋮ Operational quantum theory without predefined time ⋮ Computation with multiple CTCs of fixed length and width
Cites Work
- Unnamed Item
- Revisiting consistency conditions for quantum states of systems on closed timelike curves: an epistemic perspective
- Quantum cryptography: public key distribution and coin tossing
- Unambiguous discrimination between linearly independent quantum states.
- Closed timelike curves make quantum and classical computing equivalent
- Closed timelike curves produced by pairs of moving cosmic strings: Exact solutions
- Quantum cryptography using any two nonorthogonal states
- Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
- Quantum computing, postselection, and probabilistic polynomial-time
- The complexity of theorem-proving procedures
- An Example of a New Type of Cosmological Solutions of Einstein's Field Equations of Gravitation
This page was built for publication: Perfect state distinguishability and computational speedups with postselected closed timelike curves
