Google Unveils 72-Qubit Quantum Computer With Low Error Rates

Google's Bristlecone quantum computer

Google announced a 72-qubit universal quantum computer that promises the same low error rates the company saw in its first 9-qubit quantum computer. Google believes that this quantum computer, called Bristlecone, will be able to bring us to an age of quantum supremacy.

Latest Videos FromTom's Hardware
Contributor

Lucian Armasu is a Contributing Writer for Tom's Hardware US. He covers software news and the issues surrounding privacy and security.

  • Chettone
    So, investing in Quantum Computers research could destroy any crypto currency dreams in the long term? Bitcoins in 10 years will be as easy to break as it is now to break a 64bit zip file.
    Reply
  • nings
    Not even bitcoins but bank acces, certificates and all things who protect our datas..
    And without a quantum processor you can't encrypt all your data with a quantum key because take too much time for encrypt/uncrypt the message. The futur is pretty bad for security.
    Reply
  • alextheblue
    Quantum AI lab? It's always a good idea to run Skynet on systems with a high error rate!

    Also, call me when they have quantum speedup on a range of tasks as broad as a GPU can handle. That's probably going to take a crapload of qubits. If it can only accelerate very specific problems, it's more in line with a custom ASIC.
    Reply
  • derekullo
    20766040 said:
    Quantum AI lab? It's always a good idea to run Skynet on systems with a high error rate!

    Also, call me when they have quantum speedup on a range of tasks as broad as a GPU can handle. That's probably going to take a crapload of qubits. If it can only accelerate very specific problems, it's more in line with a custom ASIC.

    A.I life will find a way!!!!!
    Reply
  • pauly-chops
    Apologies for sounding ignorant but these "real world problems", what are they referring to? What calculations are too far out of reach, or take too long to compute, for the super computers we have today? What are these super complex problems and what will happen when answers are found?
    Reply
  • turkey3_scratch
    20765724 said:
    Not even bitcoins but bank acces, certificates and all things who protect our datas..
    And without a quantum processor you can't encrypt all your data with a quantum key because take too much time for encrypt/uncrypt the message. The futur is pretty bad for security.

    If you are implying something along the lines of password cracking via trillions of attempts per second, something like this is avoidable through time delay implementations.
    Reply
  • therealduckofdeath
    It's not really trillions per second, more like trillions simultaneously. The error accuracy in picking the correct one is what I assume is the likelihood of getting it right-right. If it will ever be "error free" digital encryption won't exist any more. Not that it matters. SkyNet will be our glorious overlord long before we'd have to worry about that reality. :D
    Reply
  • TJ Hooker
    20766242 said:
    20765724 said:
    Not even bitcoins but bank acces, certificates and all things who protect our datas..
    And without a quantum processor you can't encrypt all your data with a quantum key because take too much time for encrypt/uncrypt the message. The futur is pretty bad for security.

    If you are implying something along the lines of password cracking via trillions of attempts per second, something like this is avoidable through time delay implementations.
    It's not about brute force guessing a password really quickly, it's about breaking the encryption itself.

    For example, AFAIK a lot of public key cryptography is based around the difficulty of integer factorization for traditional computers. Public key cryptography forms the basis for most encrypted electronic communication. Quantum computers have the potential to be much faster at factorization than traditional computers, and thus can break said encryption.

    Or to quote wikipedia: "The problem with currently popular algorithms is that their security relies on one of three hard mathematical problems: the integer factorization problem, the discrete logarithm problem or the elliptic-curve discrete logarithm problem. All of these problems can be easily solved on a sufficiently powerful quantum computer running Shor's algorithm."https://en.wikipedia.org/wiki/Post-quantum_cryptography
    Reply
  • brandonjclark
    The biggest hurdle AFTER the cooling problem is obviously memory. Quantum computers require insane counts of memory to work. Yes, that memory will catch up, SOMEDAY. But it's not coming that soon where mass market of these things could be even remotely cost-effective for regular consumers.

    Unfortunately, I believe AI to require a QC-core to be extremely effective, so we might have to wait awhile before we can see real-world benefits.
    Reply
  • dezeyay
    @Chettone: Quantum Resistant Ledger is the first cryptocurrency that will be quantum secure. They use XMSS which is mathematically provable quantum secure. Existing blockchains can not be 100% quantum secure after forking an update, because all existing wallets need to be unlinked from their old non-quantum secure private key manually by their owners. Which a % of people will not do, because --> humans. But there is also a % of people who are locked out of their wallets. So these wallets can't be accessed ever again and so a % of the criculating supply of coins will always be vulnerable for quantum attacks.
    Reply