Bio Intelligence-based search engine; coming soon. Building blocks if you think about it with the whole Synthetic DNA storage, connected cell circuitry to make buildings, machines, devices, etc. living. We needed quantum in the infrastructure to ensure things like bio-intelligence, autonomous machines, and connected super humans could eventually happen while reducing risks and threats. Now, we’re watching the ramp up of synthetic bio systems. Definitely exciting especially when we could see in our lifetime mobile devices no longer needed.
(Tech Xplore)—Allen Institute for Artificial Intelligence is in the news with its smart search engine, Semantic Scholar.
Namely, they are expanding their intelligence-based search engine service into neuroscience research.
Nicola Jones said Friday in Nature that Semantic Scholar “is expanding its corpus of papers to cover some 10 million research articles in computer science and neuroscience.”
Worried about security for your bitcoin in the face of quantum computing? According to computer researchers, there’s no reason to be.
Source: https://hacked.com/breathe-easy-bitcoiners-quantum-computing…encryption
Some people assume that once quantum computing comes along modern encryption technologies will be outpowered. But experts are starting to posit that hash functions and asymmetric encryption could defend not only against modern computers, but also against quantum attackers from the future.
Matthew Amy from Canada’s University of Waterloo proposes just this in a paper by the International Association of Cryptologic Research.
Amy, and researchers from Perimeter Institute for Theoretical Physics and the Canadian Institute for Advanced Research, examined attacks against SHA-2 and SHA-3 with Grover’s algorithm.
Grover’s algorithm is a quantum algorithm that finds with high probability the input to black box functions that produce particular, and predictable, output values.
Grover’s algorithm could brute-force a 128-bit symmetric cryptographic key in roughly 264iterations,” Wikipedia states, “or a 256-bit key in roughly 2128 iterations. As a result, it is sometimes suggested that symmetric key lengths be doubled to protect against future quantum attacks.”
Researchers surmise SHA-256 and SHA3-256 need 2166 “logical qubit cycles” to break, and the paper suggests quantum papers pose little threat, though classical processors will need to manage them.
The paper notes: “The main difficulty is that the coherence time of physical qubits is finite. Noise in the physical system will eventually corrupt the state of any long computation,” the paper states. “Preserving the state of a logical qubit is an active process that requires periodic evaluation of an error detection and correction routine.”
With ASICs running at a few million hashes per second, it would take Grover’s algorithm 1032 years to crack SHA-256 or SHA3-256. That is longer than the universe has existed.
As The Register adds: “Even if you didn’t care about the circuit footprint and used a billion-hash-per-second Bitcoin-mining ASIC, the calculation still seems to be in the order of 1029 years.”
SHA-2 is the set of cryptographic hash functions designed by the National Security Agency (NSA), an intelligence branch of the US government under scrutiny for ubiquitous surveillance due to revelations released by Edward Snowden. SHA stands for “Secure Hash Algorithm.”
These hash functions represent mathematical operations run by digital means Cryptographic hash functions boast collision resistance, which means attackers cannot find two different input values that result in the same hash output. The SHA-2 family is comprised of altogether six hash functions with hash values that are 224, 256, 384 or 512 bits: SHA-224, SHA-256, SHA-384, SHA-512, SHA-512/224, SHA-512/256.
SHA-256 and SHA-512 are novel hash functions computed with 32-bit and 64-bit words, respectively.
Weird quantum effects are so delicate it seems they could only happen in a lab. How on Earth can life depend on them?
The point of the most famous thought-experiment in quantum physics is that the quantum world is different from our familiar one. Imagine, suggested the Austrian physicist Erwin Schrödinger, that we seal a cat inside a box. The cat’s fate is linked to the quantum world through a poison that will be released only if a single radioactive atom decays. Quantum mechanics says that the atom must exist in a peculiar state called ‘superposition’ until it is observed, a state in which it has both decayed and not decayed. Furthermore, because the cat’s survival depends on what the atom does, it would appear that the cat must also exist as a superposition of a live and a dead cat until somebody opens the box and observes it. After all, the cat’s life depends on the state of the atom, and the state of the atom has not yet been decided.
Yet nobody really believes that a cat can be simultaneously dead and alive. There is a profound difference between fundamental particles, such as atoms, which do weird quantum stuff (existing in two states at once, occupying two positions at once, tunnelling through impenetrable barriers etc) and familiar classical objects, such as cats, that apparently do none of these things. Why don’t they? Simply put, because the weird quantum stuff is very fragile.
Quantum computing is about to get more complex. Researchers have evidence that large molecules made of nickel and chromium can store and process information in the same way bytes do for digital computers. The researchers present algorithms proving it’s possible to use supramolecular chemistry to connect “qubits,” the basic units for quantum information processing, in Chem on November 10. This approach would generate several kinds of stable qubits that could be connected together into structures called “two-qubit gates.”
“We have shown that the chemistry is achievable for bringing together two-qubit gates,” says senior author Richard Winpenny, Head of the University of Manchester School of Chemistry. “The molecules can be made and the two-qubit gates assembled. The next step is to show that these two-qubit gates work.”
