Questions tagged [quantum-computing]

Quantum Computation deals with considering computation as fundamentally physical, as well as replacing the classical binary digit (bit) with the quantum binary digit (qubit). While the classical bit is either 0 or 1, the qubit can be in a superposition of these states. Computation systems that use quantum phenomena, such as superposition and entanglement, can solve certain complex problems very quickly.

Related Links

Quantum Computing on Wikipedia

(Textbook) Quantum Computation and Quantum Information: The de-facto standard textbook for learning about quantum computing.

(Video Series) Quantum computing for the determined: Khan-academy-style videos explaining quantum computation, by Michael Nielson (co-author of Quantum Computation and Quantum Information).

Quantum Computing Q&A site on the Stack Exchange network.

369 questions
30
votes
1 answer

Is Haskell suitable for quantum computing?

I have just read an article talking about quantum physics. One interesting thing is that in a Haskell programmer's view there are some similarities between these two fields. First of all, measurement in the quantum world seems similar to lazy…
Earth Engine
  • 10,048
  • 5
  • 48
  • 78
29
votes
9 answers

Software simulation of a quantum computer

While we are waiting for our quantum computers, is it possible to write a software simulation of one? I suspect the answer is no, but hope the reasons why not will throw some light on the mystery.
Geog
  • 291
  • 3
  • 3
29
votes
6 answers

Does anyone know what "Quantum Computing" is?

In physics, its the ability for particles to exist in multiple/parallel dynamic states at a particular point in time. In computing, would it be the ability of a data bit to equal 1 or 0 at the same time, a third value like NULL[unknown] or multiple…
Joe R.
  • 2,032
  • 4
  • 36
  • 72
26
votes
10 answers

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…
Earlz
  • 62,085
  • 98
  • 303
  • 499
24
votes
11 answers

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

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…
Steve Steiner
  • 5,299
  • 4
  • 32
  • 43
13
votes
4 answers

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…
Anedar
  • 4,235
  • 1
  • 23
  • 41
11
votes
2 answers

What is the difference between a physical and a logical qubit?

What is the difference between a physical and a logical qubit? I hope someone can help me with this question, I can't figure out exactly what the difference is. Best, Dirma
9
votes
1 answer

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…
Craig Gidney
  • 17,763
  • 5
  • 68
  • 136
7
votes
2 answers

Turing complete and parallel programming (true concurrency)

I often see people say if you can do X in some language you can do Y in another language which is the Turing Complete argument. So You'll have often (usually in a snide comment) "sure you can do t with y because y is also Turing complete. I took CS…
Adam Gent
  • 47,843
  • 23
  • 153
  • 203
7
votes
0 answers

Quantum Computers: can we start programming it?

Although we'll have to wait at least two or three decades until we can see a practical QC, it seems that theoretical studies are improving dramatically (studies using the free QLC language are good examples). However, does that make us expect that…
6
votes
2 answers

Qiskit Transpiler for quantum circuits

Okay, so, in Qiskit there is the transpile() function (see documentation). My understanding of a transpiler is best described as a way of converting one set of gate operations to another set of gate operations, with the intent of running an…
6
votes
1 answer

Can I use lambda in Q# to operate on qubits?

I have a use case in Q# where I have qubit register qs and need to apply the CNOT gate on every qubit except the first one, using the first one as control. Using a for loop I can do it as follows: for (i in 1..Length(qs)-1) { CNOT(qs[0],…
Wojciech Gac
  • 1,538
  • 1
  • 16
  • 30
6
votes
2 answers

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://learn.microsoft.com/en-us/quantum/quantum-writeaquantumprogram?view=qsharp-preview Error is The name 'BellTest' does not exist in the current context but its…
sumeet kumar
  • 2,628
  • 1
  • 16
  • 24
6
votes
1 answer

Unable to create new Q# project using Microsoft Quantum Development Kit

Having just installed the Microsoft Quantum Development Kit, creating a new Q# project fails with the obscure message: Argument can't be null: Parameter name: node. (I am using a clean install of Visual Studio 2017 Community, with latest updates…
Lemonseed
  • 1,644
  • 1
  • 15
  • 29
6
votes
2 answers

Quantum tic-tac-toe with alpha-beta pruning - best representation of states?

For my AI class, I have to make a quantum tic-tac-toe game using alpha-beta pruning. I'm thinking about the best way to represent a state of the board - my first intuition is to use a sort of neighborhood matrix, that is, a 9x9 matrix, and on M[i,j]…
1
2 3
24 25