Practical application of Shor's algorithm to break RSA-2048 encryption using a real quantum computer is a significant challenge & likely not feasible..

Relying on a single quantum machine equipped with 20 million qubits, it's feasible to distribute the workload across 8 or 9 separate quantum machines, each equipped with approximately 4 million qubits. The key to making this distributed approach work effectively is connecting these quantum machines via quantum channels with 'substantial bandwidths', each operating at around 150 qubits/second.. (IBM Osprey is a 433-qbit QC).

Consequently, there’s a growing urgency to replace traditional RSA encryption with post-quantum, quantum-resistant algorithms due to the potential vulnerabilities of existing public-key encryption methods when faced with quantum attacks. I ignore the 8 empirical conjectures used in their process or otherwise it can be 'extended & quantum extended Church-Turing thesis', 'NISQ=LDP conjecture', 'bipolar aximatization conjecture'..

https://web.archive.org/web/20121115112940/http://people.ccmr.cornell.edu/~mermin/qcomp/chap3.pdf nostr:note10wydguqhnp6qhultadlterr4f50wwrllxua36udax4x7qmsuy6wqw8c7f4