Topic: Looking for little donat for quantum EDLP problem in btc address and pubkey (Read 185 times)

You ARE aware that IBM does not allow using their Quantum hardware to crack encryption right?
From their Responsible quantum computing page:

So in Conclusion : This code Here i already presented To Mrs @COBRAS ,,,The Code wil use your own CPU+GPU speeds to create a quantum circuit with grover itterations correspend to the btc_address you wanna attack with almost instant speed surley after Transpiling the full Quantum-Circuit into the quantum machine and if there is no pending jobs the progress will be about 2 sec into 1 minute only dpend on how bigger is the num_shots ( wich is how many times the program will shots The qubits inside the Q-circuit

9.b IBM Quantum may not be used for unlawful, obscene, offensive or fraudulent activity, such as advocating or causing harm, interfering with or violating the integrity or security of a network or system, evading filters, sending unsolicited, abusive, deceptive or disparaging messages, viruses or harmful code, violating third party rights, for the research, design, development, production, maintenance, repair, overhaul, or use of any offensive or defensive weapons of any kind, for attempting to defeat encryption, or for processing regulated data including personal information, financial data and health data. In addition, IBM may remove or refuse to accept or use any Content without limitation.

So in Conclusion : This code Here https://github.com/threealgos/Quantum-CRACKER i already presented To Mrs @COBRAS ,,,The Code wil use your own CPU+GPU speeds to create a quantum circuit with grover itterations correspend to the btc_address you wanna attack with almost instant speed surley after Transpiling the full Quantum-Circuit into the quantum machine and if there is no pending jobs the progress will be about 2 sec into 1 minute only dpend on how bigger is the num_shots ( wich is how many times the program will shots The qubits inside the Q-circuit
you can get the number easly by caclutation the square root of N where N is the total number of possibilites/Totalrange of the search Keyspace. and than if you succesed created that big nubmer of grover ittertaion fully
the next step it transpiling the circuit into the QPU-Backend wich is also limited for most of ibm-QPUs to certain number and than The QPU will use QFT quantum-fourier-transform to bruteforce through the circuit using all the 4 values of ( num_qubits , num_iterrations , target_state, publickey_x and Finlay uses an extra 1 ancilla qubits for Ancillarity num_ancillas=1 to reduce the Quantum Errors Results to get only the most frequents results counts retrived from QPU .
and if you know about how i made it --> The credits is for this ''oracles'' that can make you include some operations inside The QuantumCircuit.

well  i what i can say if RetiredCoder is realy doesnt want every one to unlock all next puzzles in the near future mybe thats why he didnt help me , what iam looking for our community is that we can all go into next step of using quantum algorithms instead of classical algorithms. To Unlock The Puzzles.