Real-Time Quantum Random Access Memory

A quantum method, comprising:

• at a first step, applying, by a quantum circuit, a number of Hadamard gates to a number of qubits;
• at a second step, applying, by the quantum circuit, between a particular number of qubits of a register |qy> and the register |A> so as to search about this address in the quantum circuit, wherein the second step transforms addresses of the register |A> so as to match the input addresses of the particular number of qubits of the register |qy>, into a state |1⊗n;
• at a third step, applying, by the quantum circuit, three gates;
• at a fourth step, applying, by the quantum circuit, a n+3-qubit Toffli gate, wherein the Toffli gate has n+2 control qubits which are n qubit of the register |A>, the qubit |c-sup>, the qubit |BI, and the target qubit is |dq;
• at a fifth step, applying, by the quantum circuit, 2(m+1) negation gates, and a Toffli gate;
• at a sixth step, applying, an input value in the qubits |qy_(n+1)>, |qy_(n+2)>, . . . , |qy_(n+m)> is written at the location data register |D_1>, |D_2>, . . . , |D_m>;
• at a seventh step, applying, by the quantum circuit, a particular set of m controlled-S gates/operator between each qubit of |qy_(n+1)>, |qy_(n+2)>, . . . , |qy_(n+m)> and its associated correspondence among the qbits |D_1>, |D_2>, . . . , |D_m>, wherein at the seventh step, a search is conducted for a value that can be written as a basis state |i> in the superposition;
• and
• at an eighth step, applying, by the quantum circuit, m+3-qubit Toffli gate.