Pages that link to "Item:Q427292"
From MaRDI portal
The following pages link to Perfect state distinguishability and computational speedups with postselected closed timelike curves (Q427292):
Displaying 12 items.
- Computation with multiple CTCs of fixed length and width (Q256423) (← links)
- Mixedness and entanglement in the presence of localized closed timelike curves (Q331577) (← links)
- Time travel: Deutsch vs. teleportation (Q429925) (← links)
- Revisiting integer factorization using closed timelike curves (Q669871) (← links)
- Simulations of closed timelike curves (Q1709148) (← links)
- A note on superposition of two unknown states using Deutsch CTC model (Q2827976) (← links)
- One Time-traveling Bit is as Good as Logarithmically Many (Q2978537) (← links)
- Closed timelike curves make quantum and classical computing equivalent (Q3561861) (← links)
- The Weakness of CTC Qubits and the Power of Approximate Counting (Q4973873) (← links)
- Closed timelike curves and chronology protection in quantum and classical simulators (Q5161316) (← links)
- Operational quantum theory without predefined time (Q5855074) (← links)
- Postselected communication over quantum channels (Q6631660) (← links)