| CARVIEW |
Select Language
HTTP/2 200
date: Tue, 29 Jul 2025 00:48:46 GMT
content-type: text/html; charset=utf-8
cf-ray: 96689cceafa1c1bf-BLR
cf-cache-status: DYNAMIC
cache-control: private
set-cookie: prov=42e95590-a56b-4c03-9754-fdf264afe4b2; expires=Wed, 29 Jul 2026 00:48:46 GMT; domain=.stackexchange.com; path=/; secure; httponly
strict-transport-security: max-age=31536000; includeSubDomains
vary: Accept-Encoding
content-security-policy: upgrade-insecure-requests; frame-ancestors 'self' https://stackexchange.com
x-clacks-overhead: GNU Terry Pratchett
x-frame-options: SAMEORIGIN
x-request-guid: dcac883d-37e9-461d-a778-eee49f297158
x-worker-origin-response-time: 352000000
x-dns-prefetch-control: off
set-cookie: prov=42e95590-a56b-4c03-9754-fdf264afe4b2; Path=/; HttpOnly; Domain=stackexchange.com
set-cookie: __cf_bm=kLXMzCkPoc45XF7sWDtNb_nOHMpLt8f0nn5SF70cdGY-1753750126-1.0.1.1-0m5g2M0Bn9DAVsPEtYPhSe5gEz3hHQu_FGRQnYBE4vIGmHRBM63.cfENSrZioyRIo5mfidTFIM_vghm8_qsDuyn5L7ZQr5DSU7oNcEt3VtU; path=/; expires=Tue, 29-Jul-25 01:18:46 GMT; domain=.stackexchange.com; HttpOnly; Secure; SameSite=None
set-cookie: _cfuvid=8ELEugyKmAnC3sLPMGQeq1tJuTGce.dcLtIQh0uETj8-1753750126232-0.0.1.1-604800000; path=/; domain=.stackexchange.com; HttpOnly; Secure; SameSite=None
server: cloudflare
content-encoding: gzip
Newest 'classical-computing' Questions - Quantum Computing Stack Exchange
Skip to main content
Stack Exchange Network
Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Visit Stack Exchange
Teams
Q&A for work
Connect and share knowledge within a single location that is structured and easy to search.
Learn more about TeamsQuestions tagged [classical-computing]
For questions about the relation between quantum computing and classical computing, such as their relative performance.
160 questions
- Bountied 0
- Unanswered
- Frequent
- Score
- Trending
- Week
- Month
- Unanswered (my tags)
0
votes
1
answer
52
views
Disentangling qubits while loading classical data onto a quantum computer
I am working through this paper on loading classical data into a quantum computer. In section 2.5, they give a method to do this in the simple case of loading two bits in figure 17. I have worked ...
1
vote
0
answers
69
views
When can an algorithm be de-quantized?
Is there a general criterion to be able to figure out when a quantum algorithm may be de-quantizable? I'm studying an algorithm which involves preparing a superposition $\sum_{k} \alpha_k |k\rangle$, ...
0
votes
2
answers
134
views
are decoders based on syndrome equivalent to ones based on data
In Mackay book (page 559) I beleive the author claims that you get the same performance whether you decode using the raw received codeword (possibly soft LLR's) or using the syndrome of hard decision ...
4
votes
0
answers
87
views
How do I concatenate two classical codes by parity check matrices?
If I have two classical codes and I want to concatenate them, how do I find the parity check matrix of the concatenated code from the parity check matrices of the inner and outer code?
9
votes
0
answers
104
views
Computational complexity of perturbed classical algorithms
Take a classical algorithm and compile it into quantum gates. For example, let's take the addition of two n-bit numbers. Obviously there is an efficient classical algorithm to determine the most ...
6
votes
3
answers
2k
views
Are Quantum Algorithms better than classical algorithms for all problems?
My question basically boils down whether Quantum Computers are better computers or are they only different computers?
Is there a quantum algorithm for every problem which is at least as fast as the ...
1
vote
1
answer
85
views
How computationally advantageous are e-bits compared to probabilistically dependent classic bits
Let a "classical entangled bit" be defined as 2 classical bits put in a dependent probabilistic state like $\left| E\right> = \frac{1}{2} \left|00\right> + \frac{1}{2} \left|11\right&...
2
votes
1
answer
109
views
How does counting in classical 32-bit systems compare to quantum systems with 32 qubits in superposition? [closed]
I'm trying to understand how counting in a classical 32-bit system compares to a 32-qubit quantum system.
In a classical 32-bit system, we can count from 0 to the maximum value (i.e., ) using a CPU ...
0
votes
1
answer
111
views
Can quantum computers eventually be programmed "normally"?
They tell us that eventually quantum computers will break all current encryption methods. On the other hand, current quantum computers are programmed at a very low, mathematical level and for very ...
2
votes
1
answer
78
views
How quantum laws hold on macroscopic level in classical computers?
Disclaimer: I am not sure about whether my question is suitable for here, but I will ask it anyway.
I am making research about quantum cryptography, so I start reading a book. In one paragraph, it is ...
1
vote
3
answers
127
views
Intro book on classical and quantum computing by Thomas G Wong
Looking at his book, and am obviously new to studying this. Could someone help explain to me how the truth table is valid here?
To my understanding, when $C=0$, the circuit behaves like a reversible ...
-2
votes
2
answers
133
views
Are quantum advantages all about storing different weighted states with few qubits?
Consider pretty simple case of 2-qubit system (number of qubits $N=2$), which can be described as follows:
$$ |system\rangle = c_0|00\rangle+c_1|01\rangle+c_2|10\rangle+c_3|11\rangle,$$
as I ...
3
votes
1
answer
142
views
Will logical clock cycle time be a limiting factor for quantum computations?
Fault-tolerant quantum computation promises to strongly suppress the errors by scaling up the size of the systems. Right now, different physical implementations of proto quantum computers have very ...
4
votes
3
answers
618
views
Non-universal and non classically simulatable gate set?
The Gottesman-Knill theorem says that many circuits, including all Clifford curcuits can be simulated classically in polynomial time.
On the other hand it is believed that there is no polynomial time ...
2
votes
0
answers
73
views
Efficient Clifford circuit simulation for composite dimensional qudits
I'm looking for a reference that states that Clifford circuits can also be efficiently simulated classically for qudits with composite dimension $d$.
It is folklore that this result is true for qubits ...
- The Overflow Blog
-
- Featured on Meta
-
-
Related Tags
quantum-algorithms × 27
complexity-theory × 17
quantum-gate × 14
speedup × 14
quantum-advantage × 11
programming × 11
simulation × 11
quantum-state × 8
performance × 7
applications × 5
cryptography × 5
entanglement × 4
qiskit × 4
resource-request × 4
shors-algorithm × 4
error-correction × 4
cq-states × 4
nonclassicality × 4
quantum-circuit × 4
measurement × 3
more related tags
Hot Network Questions
- Extract archives within archives using 7zip CLI
- Why does Timor-Leste call itself a "Democratic Republic" despite little apparent Marxist-Leninist ideology?
- A national poll of 1000 French returns 25% of "Yes". Is it enough to say that it's quite impossible locally to be 0%, if we don't know the variance?
- Where does Nietzsche indicate the character of the Superman (Übermensch)?
- Why not use the "age" tool for encrypted backups?
- Can I combine 2 car reservations on adjacent dates with Hertz?
- Is the six million dollar hut challenge real?
- Seven-dimensional cross product
- Calculus Books or Websites Recommendation
- What is causing parts of my mesh to be shaded as smooth despite being outside the auto smoothing threshold?
- What did Sartre have to say about the unconscious?
- How to analytically sample from the conditional distribution of a t-statistic under normal data-generating process?
- Book recommendations for theistic books about God's existence
- Reason why golems do not run on wheels
- Strange behavior when using tikz-network and babel (french)
- Is this a violation of open source?
- Are all Universities this internally cut-throat?
- What is the proper course of action when a published paper utilizes my previously published methodology without providing citation?
- Why do we name and separate invisible bands even though the EM spectrum is continuous?
- Eleven Special Flashcards
- Where do I download Trackmania 2020 skins to?
- How can my dwarves keep humans from reverse engineering their technology?
- When using Da Capo, does that normally include a pick up?
- If I buy spell components for a different price than the official one, does that change anything about how they work as a component?