Lattice ICO Anti-Quantum

[lattice4crypto]

Quantum Computing for blockchain

[lattice4crypto]

Lattice
Torelant and Fastest with Quantumn Computer

The era of quantum computer is already in front of me. In the cryptography used in the current cryptographic currency, it is broken by the quantum computer, and its cryptographic currency becomes useless. In the quantum era, we developed a cryptographic currency that can be safely used. By using the quantum computer in reverse, we theoretically succeeded in drastically improving the remittance speed of the block chain.

[lattice4crypto]

D-Wave Systems Inc.
Logo dwave.png
Type
Privately held company
Industry   Computer hardware
Founded   1999; 19 years ago
Headquarters   Burnaby, British Columbia, Canada
Key people
Vern Brownell, CEO
Geordie Rose, Founder
Eric Ladizinsky, CS
V. Paul Lee, Chair
Products   D-Wave One, D-Wave Two, D-Wave 2X, D-Wave 2000Q
Revenue   N/A
Net income
N/A
Number of employees
Approx. 100+
Subsidiaries   D-Wave Government dwavefederal.com/leadership//
Website   www.dwavesys.com//
D-Wave Systems, Inc. [1] is a quantum computing company, based in Burnaby, British Columbia, Canada. D-Wave is the world's first company to sell quantum computers.[2]

The D-Wave One was built on early prototypes such as D-Wave's Orion Quantum Computer. The prototype was a 16-qubit quantum annealing processor, demonstrated on February 13, 2007 at the Computer History Museum in Mountain View, California.[3] D-Wave demonstrated what they claimed to be a 28-qubit quantum annealing processor on November 12, 2007.[4] The chip was fabricated at the NASA Jet Propulsion Laboratory Microdevices Lab in Pasadena, California.[5]

The underlying ideas for the D-Wave approach arose from experimental results in condensed matter physics, and in particular work on quantum annealing in magnets performed by Dr. Gabriel Aeppli.[6] These ideas were later recast in the language of quantum computation by MIT physicists Ed Farhi, Seth Lloyd, Terry Orlando and Bill Kaminsky, whose publications in 2000 [7] and 2004 [8] provided both a theoretical model for quantum computation that fit with the earlier work in quantum magnetism (specifically the adiabatic quantum computing model and quantum annealing, its finite temperature variant), and a specific enablement of that idea using superconducting flux qubits which is a close cousin to the designs D-Wave produced.

[lattice4crypto]

https://www.quantamagazine.org/job-one-for-quantum-computers-boost-artificial-intelligence-20180129/

[lattice4crypto]

The era of quantum computer is already in front of me. In the cryptography used in the current cryptographic currency, it is broken by the quantum computer, and its cryptographic currency becomes useless. In the quantum era, we developed a cryptographic currency that can be safely used. By using the quantum computer in reverse, we theoretically succeeded in drastically improving the remittance speed of the block chain.

[lattice4crypto]

Our Blockchain is the fastest.

[lattice4crypto]

Lattice-based cryptographic constructions are the leading candidates for public-key post-quantum cryptography.[17] Indeed, the main alternatives to lattice-based cryptography are schemes based on the hardness factoring and related problems and schemes based on the hardness of the discrete logarithm and related problems. However, both factoring and the discrete logarithm are known to be solvable in polynomial time on a quantum computer.[18] Furthermore, algorithms for factorization tend to yield algorithms for discrete logarithm, and vice versa. This further motivates the study of constructions based on alternative assumptions, such as the hardness of lattice problems.

[lattice4crypto]

Finally, upon termination of the algorithm, the result needs to be read off. In the case of a classical computer, we sample from the probability distribution on the three-bit register to obtain one definite three-bit string, say 000. Quantum mechanically, one measures the three-qubit state, which is equivalent to collapsing the quantum state down to a classical distribution (with the coefficients in the classical state being the squared magnitudes of the coefficients for the quantum state, as described above), followed by sampling from that distribution. This destroys the original quantum state. Many algorithms will only give the correct answer with a certain probability. However, by repeatedly initializing, running and measuring the quantum computer's results, the probability of getting the correct answer can be increased. In contrast, counterfactual quantum computation allows the correct answer to be inferred when the quantum computer is not actually running in a technical sense, though earlier initialization and frequent measurements are part of the counterfactual computation protocol.

For more details on the sequences of operations used for various quantum algorithms, see universal quantum computer, Shor's algorithm, Grover's algorithm, Deutsch–Jozsa algorithm, amplitude amplification, quantum Fourier transform, quantum gate, quantum adiabatic algorithm and quantum error correction.

[lattice4crypto]

Elements of a conventional general [1] computer (hereinafter, "classical computer") such as an electronic type treat information with "bit" which can have only one state which expresses some binary value such as "0 or 1" . Quantum computers deal with information by superposition state by "qubit" (qubit; quantum bit).

[merridaa]

how can i find out in detail about this project
I am curious about Quantum Computing
why not stick your whitepaper and website

[GeoManna]

Pretty nice

[hashcoin]

The announcement about quantum and every updates in my opinion is difficult to understand. better all updates on this project are made into one thread and a website with full information on all of these quantum projects.

[wiarw]

Need more info to get your point, seems brand new project

[corlinddd]

Project looks interesting. I will be looking out for more information, let's see another opinion giving to this project & how this project will turn out. I'll support as far as possible

[jackychan1209]

I'm curious. But you have too little information. Please make a clear description in this thread about how your project works. Thanks