Tools

Explore

Videos Channels Figures

Atmrix

Tools

Explore

Videos Channels Figures

Atmrix

SB

Simon Benjamin

05/26/18

@ Y Combinator

The gap between the theoretical usefulness of quantum computers at around 50 qubits and the practical requirements for tasks like code-breaking, which may need thousands of qubits, highlights the current limitations in quantum computing capabilities.

Video

Simon Benjamin on Architectures for Quantum Computing

@ Y Combinator

Simon Benjamin on Architectures for Quantum Computing

05/26/18

Related Takeaways

Simon Benjamin

05/26/18

@ Y Combinator

To be genuinely useful, a quantum computer needs to exceed 50 qubits, as tasks requiring fewer qubits can still be efficiently simulated by classical computers, making them less impactful.

Simon Benjamin

05/26/18

@ Y Combinator

The potential for quantum computers to simulate chemistry and material systems could lead to breakthroughs in various scientific fields, although the exact number of qubits required for these tasks remains uncertain.

Simon Benjamin

05/26/18

@ Y Combinator

The challenge in quantum computing lies in scaling; while achieving high fidelity with a small number of qubits is possible, creating a robust system that consistently performs well with a larger number of qubits is a significant engineering problem.

Simon Benjamin

05/26/18

@ Y Combinator

The threshold for effective quantum computing has improved to around 99% fidelity, meaning that if a quantum computer operates correctly 99% of the time, it can effectively manage errors and perform complex calculations.

Brian Cox

04/03/25

@ Big Think

The number of configurations in a quantum system grows exponentially with the number of qubits, making quantum computers potentially capable of computations beyond the reach of classical computers.

John Preskill

05/16/18

@ Y Combinator

The practical impact of quantum computing will likely be seen in better methods for simulating quantum systems, which classical computers struggle to solve effectively.

John Preskill

05/16/18

@ Y Combinator

Quantum computers pose a risk to current encryption schemes, particularly public key cryptography, which relies on the difficulty of certain computational problems.

John Preskill

05/16/18

@ Y Combinator

Peter Shor's suggestion that quantum computers could solve problems related to numbers, like finding the prime factors of large integers, sparked significant excitement due to its implications for cryptography.

Brian Cox

04/03/25

@ Big Think

Quantum technologies, such as quantum computers, are based on the principles of quantum mechanics and are becoming increasingly relevant in practical applications.