quantum-computing | 易学教程

Are there public key cryptography algorithms that are provably NP-hard to defeat? [closed]

阅读更多关于 Are there public key cryptography algorithms that are provably NP-hard to defeat? [closed]

问题 Closed. This question is off-topic. It is not currently accepting answers. Want to improve this question? Update the question so it's on-topic for Stack Overflow. Closed 7 years ago . Should practical quantum computing become a reality, I am wondering if there are any public key cryptographic algorithms that are based on NP-complete problems, rather than integer factorization or discrete logarithms. Edit: Please check out the "Quantum computing in computational complexity theory" section of

Quantum Computing and Encryption Breaking

阅读更多关于 Quantum Computing and Encryption Breaking

问题 I read a while back that Quantum Computers can break most types of hashing and encryption in use today in a very short amount of time(I believe it was mere minutes). How is it possible? I've tried reading articles about it but I get lost at the a quantum bit can be 1, 0, or something else . Can someone explain how this relates to cracking such algorithms in plain English without all the fancy maths? 回答1: Preamble: Quantum computers are strange beasts that we really haven't yet tamed to the

Quantum Computing and Encryption Breaking

阅读更多关于 Quantum Computing and Encryption Breaking

Quantum Program The name 'BellTest' does not exist in the current context

阅读更多关于 Quantum Program The name 'BellTest' does not exist in the current context

问题 This is my first Q# program and i'm following this getting started link.https://docs.microsoft.com/en-us/quantum/quantum-writeaquantumprogram?view=qsharp-preview Error is The name 'BellTest' does not exist in the current context but its defined in the Bell.cs I followed the steps and when building its having errors. I'm not sure how to import the operations from .qs file to driver c# file as this error looks like it can't find that operation. Any help is really appreciated Here is the code

Solve ode in python with complex matrix as initial value

阅读更多关于 Solve ode in python with complex matrix as initial value

问题 I have a von Neumann equation which looks like: dr/dt = - i [H, r] , where r and H are square matricies of complex numbers and I need to find r(t) using python script. Is there any standart instruments to integrate such equations? When I was solving another aquation with a vector as initial value, like Schrodinger equation: dy/dt = - i H y , I used scipy.integrate.ode function ('zvode'), but trying to use the same function for von Neumann equation gives me the following error: **scipy

Factoring a quantum state

阅读更多关于 Factoring a quantum state

问题 I'm looking for algorithms that take an arbitrary quantum state made up of a sum of weighted classical states made up of bits, like this: |0000>/2 - |0011>/2 + |0100>/2 - |0111>/2 and factor it into a more compact form using tensor products, like this: |0> x (|0> + |1>) x (|00> - |11>) / 2 I want to use the algorithm as a way of visualizing/simplifying the state of a (simulated) quantum circuit. For individual qubits I know I can just pair all the states with the state where the bit is

Solve ode in python with complex matrix as initial value

阅读更多关于 Solve ode in python with complex matrix as initial value

I have a von Neumann equation which looks like: dr/dt = - i [H, r] , where r and H are square matricies of complex numbers and I need to find r(t) using python script. Is there any standart instruments to integrate such equations? When I was solving another aquation with a vector as initial value, like Schrodinger equation: dy/dt = - i H y , I used scipy.integrate.ode function ('zvode'), but trying to use the same function for von Neumann equation gives me the following error: **scipy/integrate/_ode.py:869: UserWarning: zvode: Illegal input detected. (See printed message.) ZVODE-- ZWORK length

Is it possible to use Q# to control my own quantum computer?

阅读更多关于 Is it possible to use Q# to control my own quantum computer?

In short: If I have access to a real quantum computer, is there a possibility to control it using Q#? Before you downvote this into nirvana because "there's no quantum computer available yet": I'm a physicist and our group is able to do real gates on real world qubits. I also have some background in programming (mostly C++). So for the sake of this question, let's pretend someone has access to a real world device which is able to perform certain quantum operations on a number of qubits. Obviously the number of qubits might be limited and so might be the possible operations. Let's also say

Are there public key cryptography algorithms that are provably NP-hard to defeat? [closed]

阅读更多关于 Are there public key cryptography algorithms that are provably NP-hard to defeat? [closed]

Should practical quantum computing become a reality, I am wondering if there are any public key cryptographic algorithms that are based on NP-complete problems, rather than integer factorization or discrete logarithms. Edit: Please check out the "Quantum computing in computational complexity theory" section of the wiki article on quantum computers. It points out that the class of problems quantum computers can answer (BQP) is believed to be strictly easier than NP-complete. Edit 2: 'Based on NP-complete' is a bad way of expressing what I'm interested in. What I intended to ask is for a Public

Unable to load DLL 'Microsoft.Quantum.Simulator.Runtime.dll'

阅读更多关于 Unable to load DLL 'Microsoft.Quantum.Simulator.Runtime.dll'

问题 Getting Unable to load DLL 'Microsoft.Quantum.Simulator.Runtime.dll' error while trying to validate my Q# environment by running the teleport sample program. dotnet build dotnet run platform windows 7 64 bit with AVX enabled. vscode with .NET Core SDK 2.0 Unhandled Exception: System.DllNotFoundException: Unable to load DLL 'Microsoft.Quantum.Simulator.Runtime.dll': The specified module could not be found. (Exception from HRESULT: 0x8007007E) at Microsoft.Quantum.Simulation.Simulators