The document covers the fundamentals of quantum programming, highlighting its reliance on vectors, probabilities, and superpositions in contrast to classical programming. It introduces key concepts like qubits, quantum gates, and the potential applications of quantum computing in fields such as AI and machine learning. Additionally, it discusses the current state of quantum technology and specific programming implementations, particularly in relation to Microsoft's Q# language.

1. Quantum Programming in a nutshell

2. Quantum
Programming in a
nutshell
@RaduVunvulea

4. RADU VUNVULEA
Technology Enthusiast
Microsoft Azure MVP
Speaker & Trainer
Writer & Blogger
Idealist Software
Architecture Crafter

5. RADU VUNVULEA
- NO deep knowledge
on Quantum Computing
- You will not know to
write a real program in
Q#
- It’s all about probability
and vectors

6. Sneak preview on
quantum programming
concepts

7. Core concept of
Quantum theory

8. Energy, like matter, consists
of discrete units, rather than
solely as a continuous waves

9. Quantum computing takes advantage
of the strange ability of subatomic particles
to exist in more than one state at any time

10. Absolute values does not exists, just
an infinite values between 0 to 1
- superpositions -

11. GENESIS

12. Math
•Vectors
•Linear
Algebra
•Statistics
Particle
physics
• Photon
• Electron
Genesis

13. Schrödinger’s Cat

14. Dead or
Alive?

15. 0.42342423423
• Absolute values like 0 or 1 does
not exist
• Statistics and multiple states is
what quantum defines

16. WHAT IS QUANTUM
COMPUTING?

17. BITS
Classical computer
ON OFF

18. Qubit
Qubit
ON

19. Qubit
Qubit
ON

20. Qubit
Qubit
ON
Bloch sphere

21. N qubits
2 𝑁
paths
QSPHERE
Superpositions
|0)
|1)
1 2(|0) + |1)) 1 2(|0) + |1))
|00000)
|00010)
|00110)
|01110)
|11111)
|11110)
|11010)
|01010)
BLOCK SPHERE QSPHERE

22. N qubits
2 𝑁
paths
QSPHERE
Superpositions
|0)
|1)
1 2(|0) + |1)) 1 2(|0) + |1))
|00000)
|00010)
|00110)
|01110)
|11111)
|11110)
|11010)
|01010)
BLOCK SPHERE QSPHERE
Number of calculation in
a single step

23. Nitrogen
fixation
100-200 qubits
Carbon
capture
100-200 qubits
Materials
science
100-1000qubits
Machine
Learning
100-1000qubits
Problems and Reqs

24. Classical
AND OR NOT Not-linear
Quantum
NOT
(Pauli-X)
Pauli-Z Hadamard CNOT Linear
Classical VS Quantum gates

25. Input Output
0 0 0 0
0 1 0 1
1 0 1 1
1 1 1 0
CNOT

26. • Quantum simulator
–2 𝑛
(n represents the no. of qubits)
–Multiple positions (superpositions)
• Traditional computer
–3 bits (2X2X2 – 8 combinations)
–7 bits (2X2X2X2X2X2X2 – 128 combinations)
How does the simulator works

27. • States
–30 qubits : 16 Gb on traditional computer
–31 qubits : 32 Gb
–70 qubits : 16 Zb
• Gate simulation
–30 qubits : 1s of normal computer
–40 qubits : 1s of super computer
–260 qubits : Age of Universe 
How does the simulator works

29. What we have now?
IBM: 50-qubit
Google: 72-qubit
Microsoft: 0-qubit

30. What we have now?
IBM: 50-qubit
Google: 72-qubit
Microsoft: 0-qubit
Hold the quantum
microstates 90
microseconds

31. • In the past:
–9 qubits (1 computational and 8 correctional)
• IBM breakthrough:
– 5 qubits (1 computational and 4 correctional)
Current problems

32. Current problems
Interfaces
Collapse
Error
correction
Output
observance

33. Quantum and
Microsoft

34. • Based on Majorana
particles
• Scalable
• Stable
• Error-prone
• Low cost
Microsoft Vision

35. Q#

36. Q#
Just another coprocessor like GPUs or
FPGAs

37. Windows,
Linux, maxOS
Development
libraries are
Open Source
Integrated with
Visual Studio
Interoperability
with Python
Q#

38. Application runs in a classical manner and when required a
sub-program runs inside quantum processor
Main concept

39. • Input data
• Setup
• Trigger quantum
processing
Classical
computation
• Run quantum
algorithm
Quantum
computation • Output data
• Present to the
user
Classical
computation

40. Domain Specific
Programming
Language
Used to write sub-
programs for
Quantum
processor
It is under control
of a classical host
Data type
• Primitive types
• Tuple
• Arrays
Basic Procedural
• Loops
• IF/ELSE
Q#

42. Q#
Int, Bool,
Qubit
Pauli (I,X,Y,Z)
Arrays []
Tuples ()
Result Zero One
User defined types

43. 1. Int integer = 10;
2. Bool boolean = true;
3. Qubit qubit = Qubit[5];
4. Int[] array = Int[5];
5. (String, Qubit) tuple2 = (2, qubit[0]);
6. newtype event = (String, String);

44. 1. set
2. newtype LogicalRegister = Qubit[]; //Callable expression
3. newtype EncodeOp = ((Qubit[], Qubit[]) =>
LogicalRegister);
4. // Range expression
5. 1..1..4; // 1234
6. 1..3..9; // 1369
7. 3..8..8; // 3
8. 1..-1..2; //Empty
9. array[1..2..5]; // Items on the index 1,3,5

45. 1. let itcamp = 2018; // Immutable 'variable' /
symbol
2. mutable mutableValue = 200;
3. let imutableValue = mutableValue;
4. set mutableValue = 400;// imutableValue == 200
5. fail $"Exception occured";
6. return Zero;

46. Conclusion

47. • Quantum programming is all about vectors and
probabilities
• It is another programming paradigm
• Big potential for predictions and simulations
– AI, ML
Conclusion

48. Conclusion
• Quantum programming is all
about vectors and probabilities
• It is another programming
paradigm
• Big potential for predictions and
simulations
– AI, ML

49. Q & A

50. 50
THANK YOU!
@RaduVunvulea
RADU VUNVULEA