-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathadvantages_disadvantages.html
More file actions
167 lines (148 loc) · 7.97 KB
/
advantages_disadvantages.html
File metadata and controls
167 lines (148 loc) · 7.97 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
<!DOCTYPE html>
<html>
<head>
<link rel="stylesheet" href="styles.css">
<title>Advantages and Disadvantages</title>
<style>
td {
text-align: left;
}
</style>
</head>
<body>
<div class="allItems">
<header>
<h1 class="title">Advantages and Disadvantages of Quantum Computing</h1>
</header>
<main>
<!-- navigation bar, sticks out when less than 1000 pixels in width -->
<nav>
<ul class="navbar">
<li><a href="index.html">Overview of Quantum Computing</a></li>
<li><a href="history.html">History of Quantum Computers</a></li>
<li><a href="advantages_disadvantages.html">Advantages and Disadvantages</a></li>
<li><a href="future_applications.html">Future of Quantum Computing and Applications</a></li>
<li><a href="others.html">Quantum Computing Quiz</a></li>
</ul>
</nav>
<!-- main content -->
<article>
<h2 class="subtitle">Advantages</h2>
<h3 class="subtitle">Simultaneous Operations</h3>
<p>
Quantum computers can perform multiple simultaneous operations due to the properties of quantum
physics, specifically superposition and entanglement. Superposition allows a quantum bit (qubit) to
exist in multiple states simultaneously, while entanglement allows two or more qubits to be
'connected' in such a way that the state of each qubit is affected by the others.
<br><br>
This allows quantum computers to perform certain calculations much faster than classical computers
by taking advantage of the ability to exist in multiple states simultaneously. For example, if a
classical computer were to search a database for a specific entry, it would have to check each entry
one at a time. A quantum computer, on the other hand, could check all entries simultaneously.
<br><br>
(Note: This is extremely simplified. The actual process if much more complicated and involves a lot
more science.)
</p>
<br>
<h3 class="subtitle">Decision Problems: P vs BQP vs NP</h3>
<p>Another advantage of quantum computers is that they can solve certain problems much more efficently
than regular computers such as finding the prime factors of large numbers (using Shor's algorithm).
</p>
<br>
<!-- P vs BQP vs NP table -->
<table>
<tr>
<th>P: Polynomial Time</th>
<th>BQP: Bounded-error Quantum Polynomial time</th>
<th>NP: Nondeterministic Polynomial Time</th>
</tr>
<tr>
<td>
<ul>
<li>Can be solved efficiently (in polynomial time) by regular computers</li>
<li>Examples include: Most linear programming questoins, checking is a number is prime,
and checking for connectivity in a graph</li>
</ul>
</td>
<td>
<ul>
<li><u>Can be solved efficiently by quantum computers</u></li>
<li>Error probability must be less than 1/3</li>
</ul>
</td>
<td>
<ul>
<li>Solution to these problems can only be verified in polynomial time by regular
computers</li>
<li>Finding the solution to these problem cannot be done efficiently</li>
<li>Examples include the Travelling Salesman Problem (traversing all nodes and returning
to start) and Boolean Satisfiability Problem.</li>
</ul>
</td>
</tr>
</table>
<br>
<p class="image-description" style="font-weight: normal;">In the diagram, overlapping areas represent
problems in more than one category.<br> Eg. All
Polynomial time problems can be solve efficiently by quantum computers. The overlap between BQP and
NP means that quantum computers can solve some NP problems quickly (such as prime factorization).
</p>
<div style="text-align: center;">
<img src="https://qph.cf2.quoracdn.net/main-qimg-51a68b43777993cd6eed13a943268507" height="300px"
style="margin:25px" title="Source: qph.cf2.quoracdn.net.com" alt="p vs np vs bqp">
</div>
<h2 class="subtitle">Disadvantages</h2>
<table>
<colgroup>
<col style="background-color:rgb(224, 247, 255);">
<col style="background-color:rgb(216, 255, 238);">
</colgroup>
<!-- table about the disadvantages of quantum computers -->
<tr>
<td>
Accuracy of Calculations
</td>
<td>
Since the state of qubits depends on probabilities, errors can occur during calculations.
Error correction measures must be taken such as by using 'logical qubits', a group of
physical qubits working together that correct errors as they occur. However, doing this will
greatly increase the amount of qubits needed for the computer, thus increasing the cost.
</td>
</tr>
<tr>
<td>
Environmental Requirements
</td>
<td>
Quantum computers must be cooled to extremely low temperatures (close to absolute zero) to
ensure that environmental factors don't affect the quantum state of quantum computers. Once
again, this will increase the cost of building and maintaining a quantum computer.
</td>
</tr>
<tr>
<td>
Quantum Algorithms
</td>
<td>
Quantum computers cannot use the algorithms used on traditional computers, but need their
own special algorithms. Creating and optimizing these algorithms can be very time consuming.
</td>
</tr>
</table>
</article>
</main>
<!-- footer with extra info -->
<footer>
<p><b>- First Name - Last Name - 2023</b></p><br>
<p><u>Contact Information</u></p><br>
<p>Email: person@gmail.com</p>
<p>Phone: 987-654-3210</p>
<div style="text-align: right; margin-right: 5px;">
<img src="logo.png" width="45px">
</div>
</footer>
</div>
<button onclick="toTop()" id="backToTop" title="Go to the top of the page">Back to Top</button>
<script src="helper.js"></script>
</body>
</html>