Pages that link to "Item:Q2978537"
From MaRDI portal
The following pages link to One Time-traveling Bit is as Good as Logarithmically Many (Q2978537):
Displaying 5 items.
- Computation with multiple CTCs of fixed length and width (Q256423) (← links)
- Perfect state distinguishability and computational speedups with postselected closed timelike curves (Q427292) (← links)
- Closed timelike curves make quantum and classical computing equivalent (Q3561861) (← links)
- Computational tameness of classical non-causal models (Q4556871) (← links)
- The Weakness of CTC Qubits and the Power of Approximate Counting (Q4973873) (← links)