Quantum circuit simplification using classical computers
Quantum Computing SEArchived Apr 19, 2026✓ Full text saved
Suppose that we have this kind of circuit where the first unitary operator U is used for the state preparation while the Hadamard operator is used of state detection. Let's say we try to run this circuit experimentally, but we don't have enough resources to operate two operators together. Let's imagine that we can use perform one arbitrary single unitary operation M as below: Compared to the first circuit, the operator M is equivalent to the multiplication of U and H such as $M=H\times U$ . To g
Full text archived locally
✦ AI Summary· Claude Sonnet
Quantum circuit simplification using classical computers
Ask Question
Asked 3 years, 3 months ago
Modified today
Viewed 198 times
2
Suppose that we have this kind of circuit where the first unitary operator U is used for the state preparation while the Hadamard operator is used of state detection.
Let's say we try to run this circuit experimentally, but we don't have enough resources to operate two operators together. Let's imagine that we can use perform one arbitrary single unitary operation M as below:
Compared to the first circuit, the operator M is equivalent to the multiplication of U and H such as
M=H×U
𝑀
=
𝐻
×
𝑈
. To generate the matrix
M
𝑀
as
H×U
𝐻
×
𝑈
, the classical computer is required to calculate the structure of the matrix, and afterwards we can run the same circuit in the second figure as
H×U
𝐻
×
𝑈
.
But I wonder if the usage of classical computers for this kind of simplification is generally allowable.
quantum-gatecircuit-constructionrandom-quantum-circuit
Share
Improve this question
Follow
edited Jan 20, 2023 at 13:25
asked Jan 20, 2023 at 2:02
William
1829
9 bronze badges
Add a comment
1 Answer
Sorted by:
Highest score (default)
Date modified (newest first)
Date created (oldest first)
0
Of course the "simplification" you are doing here is always possible and, more in general, any quantum circuit can be represented as a single
2
n
×
2
n
2
𝑛
×
2
𝑛
unitary matrix
M
𝑀
(acting on a
n
𝑛
-qubits quantum state). However, what you are probably missing here is that the linear algebra of unitary operators is just the mathematical tool that we use to describe quantum computation or, at most, to simulate quantum computers.
Once you come to the actual realization of your operator
M
𝑀
on a real quantum device, you have to consider that the hardware is constrained to use a quite limited set of quantum gates that are actually implemented on physical qubits (e.g. as microwave pulses on superconducting qubits). This means that, from the quantum hardware's point of view, applying first the
U
𝑈
gate and then the
H
𝐻
gate is perfectly equivalent to applying the resulting gate
M=H×U
𝑀
=
𝐻
×
𝑈
and there is no such a thing as a "simplification".
Share
Improve this answer
Follow
edited Mar 25, 2025 at 8:29
answered Jan 20, 2023 at 14:33
SimoneGasperini
1,6441
1 gold badge
4
4 silver badges
18
18 bronze badges
I know that the circuit simplification itself would be fine. But my questions is the process of the simplification here. If I want to build the M operator to be H x U, then I need to know how H x U is built by classical computers, and I wonder if this simplication by classical computers before running quantum circuits would be generic method. Isnt's there any speedup problem for this kind of classical-computer-based simplification? –
William
Commented
Jan 20, 2023 at 17:12
Taking a stab although I'm still not 100% sure what you're asking: decomposing an arbitrary, desired operation
M
𝑀
into its component operations that I can physically run using the relevant gate-set on my computer is not only a necessary, but also challenging and doing so efficiently/optimally is an open problem –
Chris E
Commented
Jan 20, 2023 at 20:54
@Chris E Thank you for your comment. What I'm saying is similar to what you are saying, which is decomposing the M operator to the H x U operation using classical computer. You said that it is an open problem and I wonder if this kind of decomposition using classical computer is reasonable generally. –
William
Commented
Jan 20, 2023 at 21:06
Oh, got it. I believe there are some schemes that work reasonably well for
N
𝑁
qubits, but the required number 1- and 2-qubit gates scales exponentially with
N
𝑁
. Classical algorithms that try to minimize the number of quantum gates are fairly complicated/expensive though (but spending the classical time to run more efficiently on quantum hardware is still a huge net benefit). For more details, you could look into quantum circuit compiling like arxiv.org/pdf/2101.02993.pdf –
Chris E
Commented
Jan 20, 2023 at 21:33
Add a comment
Your Answer
Sign up or log in
Sign up using Google
Sign up using Email and Password
Post as a guest
Name
Email
Required, but never shown
Post Your Answer
By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.
Start asking to get answers
Find the answer to your question by asking.
Ask question
Explore related questions
quantum-gatecircuit-constructionrandom-quantum-circuit
See similar questions with these tags.
The Overflow Blog
No country left behind with sovereign AI
Human input needed: take our survey on AI agents
Related
6
Classical XOR gate in Quantum Circuit
9
Understanding the Group Leaders Optimization Algorithm
6
Understanding Google's “Quantum supremacy using a programmable superconducting processor” (Part 3): sampling
3
What is the role of choosing the single-qubits randomly in Google quantum supremacy experiment?
10
Simplification of "rotation swapping" circuit
2
Group of commuting Pauli matrices doesn't permit synthesis
3
How does one convert a truth table to a square permutation matrix?
0
Quantum circuit for the symmetry operator
2
Is the 2-qubit singlet state invariant under bilateral projections?
Hot Network Questions
Are there any useful criteria for what constitutes using AI to make music?
How to ask supervisor for permission to do a tech internship without offending him
Callout a curve with another image
Replace the matching pattern with equal number of n characters
Why am I unable to run SMART checks on a WD Green HDD after diskutil error 69759?
How can I mount furniture to walls covered in foam panels?
"I have purpose"
Are there any math changes between the Project Hail Mary print and audio editions?
Lilypond: Aligning alterations of same step in different octaves in Scordatura key signature
What are "clowns" (as opposed to "fools") in Shakespeare?
Letter "F" in Vietnamese
How to remove blood from broom in Goblin Cleanup?
Identifying returning paths
Finding the area of the shaded region inside the square and the rectangle in a more elegant way
Can the extra Radiant damage from True Strike be added to an attack with Graze?
Is passing NULL valid when array parameter uses [static 0] in C99?
Where are CA root certificates being hidden?
Identity with Stirling numbers of the first kind
How do engineers evaluate trade-offs when multiple design solutions meet requirements?
Sort strings containing valid and invalid substrings by substring groups
providing a mathchancery alphabet
Translate Roman numerals to integer: (Final) Part 3
Question regarding Kirszbraun's theorem
LT1054 Large output voltage drop under load
Question feed
By continuing to use this website, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy. By exiting this window, default cookies will be accepted. To reject cookies, select an option from below.
Customize settings
Cookie Consent Preference Center
When you visit any of our websites, it may store or retrieve information on your browser, mostly in the form of cookies. This information might be about you, your preferences, or your device and is mostly used to make the site work as you expect it to. The information does not usually directly identify you, but it can give you a more personalized experience. Because we respect your right to privacy, you can choose not to allow some types of cookies. Click on the different category headings to find out more and manage your preferences. Please note, blocking some types of cookies may impact your experience of the site and the services we are able to offer.
Cookie Policy
Accept all cookies
Manage Consent Preferences
Strictly Necessary Cookies
Always Active
These cookies are necessary for the website to function and cannot be switched off in our systems. They are usually only set in response to actions made by you which amount to a request for services, such as setting your privacy preferences, logging in or filling in forms. You can set your browser to block or alert you about these cookies, but some parts of the site will not then work. These cookies do not store any personally identifiable information.
Targeting Cookies
Targeting Cookies
These cookies are used to make advertising messages more relevant to you and may be set through our site by us or by our advertising partners. They may be used to build a profile of your interests and show you relevant advertising on our site or on other sites. They do not store directly personal information, but are based on uniquely identifying your browser and internet device.
Performance Cookies
Performance Cookies
These cookies allow us to count visits and traffic sources so we can measure and improve the performance of our site. They help us to know which pages are the most and least popular and see how visitors move around the site. All information these cookies collect is aggregated and therefore anonymous. If you do not allow these cookies we will not know when you have visited our site, and will not be able to monitor its performance.
Functional Cookies
Functional Cookies
These cookies enable the website to provide enhanced functionality and personalisation. They may be set by us or by third party providers whose services we have added to our pages. If you do not allow these cookies then some or all of these services may not function properly.
Cookie List
Clear
checkbox label label
Apply Cancel
Consent Leg.Interest
checkbox label label
checkbox label label
checkbox label label
Necessary cookies only Confirm My Choices