QuEra Computing Inc.’s Post

Quantum computing has a hype problem   "Established applications for quantum computers do exist. The best known is Peter Shor’s 1994 theoretical demonstration that a quantum computer can solve the hard problem of finding the prime factors of large numbers exponentially faster than all classical schemes. Prime factorization is at the heart of breaking the universally used RSA-based cryptography, so Shor’s factorization scheme immediately attracted the attention of national governments everywhere, leading to considerable quantum-computing research funding.  "   "There are proposals to use small-scale quantum computers for drug design, as a way to quickly calculate molecular structure, which is a baffling application given that quantum chemistry is a minuscule part of the whole process. Equally perplexing are claims that near-term quantum computers will help in finance. No technical papers convincingly demonstrate that small quantum computers, let alone NISQ machines, can lead to significant optimization in algorithmic trading or risk evaluation or arbitrage or hedging or targeting and prediction or asset trading or risk profiling. This however has not prevented several investment banks from jumping on the quantum-computing bandwagon."   By Sankar Das Sarma at MIT Technology Review   Link https://lnkd.in/ddjbKVws

NYU computer scientist Oded Regev has introduced a significant speed-up to Shor's quantum algorithm for factoring large numbers. As quantum computing continues to develop, Shor's algorithm may prove to be a viable method of breaking commonly used. public-key algorithms. The improvement in Regev's algorithm is significant, with the number of elementary logical steps in the quantum part proportional to n^1.5, compared to n^2 in Shor's original version. Reducing the steps in the quantum part of the process could enhance practical implementation. However, the improvement comes at a cost: Shor's algorithm needs n qubits, while Regev's original version requires n^1.5 qubits for 2,048-bit numbers. Of course, there are other significant quantum-specific issues (such as error handling) that need to be worked out before Shor's algorithm could be used in practice.  #quantum #quantumcomputing #cryptography  https://lnkd.in/gFiwhEZG

Advances and adoption of new quantum algorithms will enable more practical implementations of quantum circuits. This new algorithm is now adopted by IBM and Google and widely available. The Shukla–Vedula algorithm focuses on creating uniform quantum superposition states, a critical part of quantum computing, and drastically reduces the complexity of this step. This efficiency is not just theoretical—it has practical applications across various fields, including quantum search, optimization, solution of differential equations, signal processing, cryptography, finance and artificial intelligence. https://lnkd.in/eZas-x8w

Y2Q, or Years to Quantum, is a funny way to refer to the years leading up to the day when a sufficiently powerful quantum computer executes Shor's algorithm, thus compromising the public cryptography algorithms currently in use. We have good reason to believe that this 'Quantum apocalypse' could occur sometime in the 2030s (It will only be an apocalypse if we fail to update the algorithms; otherwise, it will be a remarkable scientific and technological achievement). Naturally, the estimation for the Y2Q value fluctuates as our knowledge expands. It can go in either direction. A paper published last August, also covered in a great article by Quanta Magazine, has reduced estimations on Y2Q. Let's consider the minimum necessary set of quantum computer resources and performance metrics required to successfully run Shor's algorithm within a predefined time for, let's say, a 2048-bit number. Let's designate it with Q_shor. Q_shor encompasses more than just the minimum number of qubits; it also includes error rates, coherence times, connectivity, and more. Now, let's assume the 'best' current quantum computer is characterized by the parameter set Q. The Quantum apocalypse occurs when the two variables meet: Q = Q_shor. The paper demonstrated that both variables are dynamic over time. Q naturally grows over time, similar to the exponential growth of processor power (Moore's law) over the past several decades. This paper also established that Q_shor is not static and can be reduced. In particular, the number of logical qubits necessary to break an n-bit integer, scales as n^1.5, compared to the original n^2. This is a huge difference for large n. There is however a potential difficulty with the new implementation, as it might require more memory qubits to store intermediate results. In conclusion, without succumbing to inflated hype, the key takeaway is that organizations should start contemplating a migration to quantum-safe cybersecurity. The risks are simply too high not to do so. Disclaimer: The paper is published on ArXiv and it seems it still hasn't gone through a peer review process. #deloitteriskadvisory #deloitte #shors #quantumsafe #postquantum #y2q https://lnkd.in/dCHrjtHF https://lnkd.in/d5ubv44w

The most recent email you sent was likely encrypted using a tried-and-true method that relies on the idea that even the fastest computer would be unable to efficiently break a gigantic number into factors.Quantum computers, on the other hand, promise to rapidly crack complex cryptographic systems that a classical computer might never be able to unravel. This promise is based on a quantum factoring algorithm proposed in 1994 by Peter Shor, who is now a professor at MIT.But while researchers have taken great strides in the last 30 years, scientists have yet to build a quantum computer powerful enough to run Shor’s algorithm.As some researchers work to build larger quantum computers, o ...

This post by QuEra Computing Inc. sounds very interesting. From my understanding, they claim to have developed a "Pseudomagic quantum state"—a type of quantum state necessary for achieving quantum supremacy, which is indistinguishable from a random quantum state with limited computational resources. Indeed, such a state could be crucial for sophisticated quantum calculations. However, I need to study quantum algorithms further to fully understand the significance of this work.

A new study published in Physical Review Letters introduces pseudomagic quantum states, which mimic the properties of complex nonstabilizer states but are simpler to construct. These states are computationally indistinguishable from random states to limited observers, potentially advancing quantum supremacy. The research highlights their implications for quantum cryptography, quantum chaos, and fault-tolerant quantum computing, paving the way for practical quantum applications. Pseudomagic quantum states: A path to quantum supremacy https://hubs.ly/Q02B_kGD0

Researchers are redefining quantum encryption by proving that even in a world where most computational problems are easy, secure encryption remains possible, based on quantum theory itself. 🔒 Quantum encryption breakthrough: Cryptographers have discovered that security can be built on the difficulty of specific quantum problems, even if classical cryptography fails. 💡 Historical evolution: Starting in the 1960s, physicists laid the foundation for using quantum principles like measurement disturbance to secure information, but it wasn’t until recent years that these concepts were fully realized. 🔍 Hard problems redefined: A specific quantum task, distinguishing between two similar quantum states, has become central to ensuring encryption remains secure, even in extreme computational scenarios. 🧠 New era in cryptography: This quantum-based approach suggests a more profound shift, making traditional cryptography and quantum cryptography distinct fields with different security guarantees. #QuantumEncryption #Cryptography #QuantumComputing 📜 Research has shifted from depending on NP-hard problems to quantum challenges. 🤖 Advances highlight how quantum complexity can outpace classical cryptographic methods. 🔐 Implications for cybersecurity, especially as quantum computing grows. https://lnkd.in/gNcySsJp

The Rise of Quantum Computing: Potential and Challenges Quantum computing represents a paradigm shift in computational power, offering capabilities that surpass traditional computing systems. This emerging technology holds promise for solving complex problems across scientific research, cryptography, optimization, and machine learning. Understanding Quantum Computing Quantum computers operate on principles of quantum mechanics, using quantum ... [...] #QuantumComputing Read more... https://lnkd.in/dJKzDhvx

A Quantum Leap in Factoring – Communications of the ACM: In the mid-1990s, Peter Shor developed the first quantum computing algorithms, demonstrating their potential to vastly outperform classical computers in factoring large numbers, a task crucial for public-key cryptography. Oded Regev of New York University has recently proposed a new scheme that shows promise for significantly reducing the resources required for factoring. However, while Regev's innovation represents an asymptotic improvement, its practical consequences are yet to be determined. Regev's approach involves looking for periodicity in a higher-dimensional space, leading to a more efficient computation process. It also requires more qubits but can be optimized for space. The introduction of new quantum algorithms has sparked optimism for future improvements, but the practical implications and implementation of these advancements remain uncertain.