Pages that link to "Item:Q291464"
From MaRDI portal
The following pages link to Quantum computation with coherent spin states and the close Hadamard problem (Q291464):
Displaying 12 items.
- Gaussian quantum computation with oracle-decision problems (Q352994) (← links)
- New method of calculating a multiplication by using the generalized Bernstein-Vazirani algorithm (Q726023) (← links)
- Efficient quantum algorithms of finding the roots of a polynomial function (Q1616488) (← links)
- Creating very true quantum algorithms for quantum energy based computing (Q1643461) (← links)
- Quantum cryptography based on the Deutsch-Jozsa algorithm (Q1685724) (← links)
- A note of coherence for duality quantum computers acting on pure states (Q1740856) (← links)
- Necessary and sufficient condition for quantum computing (Q1740946) (← links)
- Quantum communication based on an algorithm of determining a matrix (Q1740965) (← links)
- Some theoretically organized algorithm for quantum computers (Q2300853) (← links)
- Quantum algorithm for the root-finding problem (Q2329950) (← links)
- Universal quantum computation with spin-\(1/2\) pairs and Heisenberg exchange (Q2837657) (← links)
- Realistic cost for the model of coherent computing (Q2958428) (← links)
