Questions tagged [reversible-computation]
For questions related to reversible computing, i.e. computing models where each elementary operation (and hence every computation) can be undone.
9
questions
2
votes
1
answer
120
views
What role does Landauer's principle play in quantum reversibility?
In section 3.2.5 of Nielsen and Chuang (starting page 153) they talk about Landauer’s principle, where they discuss the lower bound on the thermodynamic cost of erasing information.
In irreversible ...
CommunityBot
- 1
1
vote
1
answer
58
views
Does the Bell's state entanglement violate the reversibility property of unitary matrices?
I read unitary matrices are reversible, so when we apply a unitary operator $U$ on some input state and got an output state, then if we apply $U^\dagger$ (transpose conjugate) we get back the original ...
- 1,320
3
votes
1
answer
184
views
How does one convert a truth table to a square permutation matrix?
Given a classical circuit of $m$ inputs and $n$ outputs, composed of various AND gates, OR gates, NOT gates, etc., a truth table is a $2^{m}\times(m+n)$-sized matrix, where, in general, the first $m$ ...
- 1,058
7
votes
0
answers
165
views
Thermodynamic Speed Limit to Quantum Computing
There's a lot of mystifying jargon in the field of quantum computation, so I would like to pose a question from elementary physics to maybe help clarify things. Is it not true that the speed of a real-...
- 71
2
votes
1
answer
148
views
"Bennett’s trick" for reversible circuits
A textbook approach, attributed to Charlie Bennett, for creating reversible circuit which outputs the input qubits and the initialized ancilla qubits involves copying the function output between the ...
- 9,346
3
votes
1
answer
119
views
How to build a quantum circuit of a given reversible function?
Given a function $f : \{0,1\}^n \longrightarrow \{0,1\}^m$ and a function $g : \{0,1\}^m \longrightarrow \{0,1\}^n$ that both can be computed by polynomial-size classical circuits such that $g(f(x))=x$...
- 9,346
7
votes
2
answers
668
views
How universal is the Toffoli gate for classical reversible computing?
It is easy to see that no finite set of classical reversible gates can be strictly universal (without ancilla) for classical reversible computation: for any reversible gate on $n$ bits, in its action ...
- 30.1k
1
vote
2
answers
90
views
Can there be different gate implementations of same oracle implementation?
I have been reading about Bernstein-Vazirani Algorithm, and it uses what is known as a phase oracle. Basically, it is CNOT gate with several controls attached to the ancilla qubit $|-\rangle$ (it is ...
- 262
4
votes
0
answers
110
views
Universality for reversible classical computation
Is there any way to check whether a set of gates (for example, take the set comprising of the CNOT gate and the Hadamard gate) is universal for reversible classical computation?
I can think of trial ...
- 1,119