Efficient Quantum Control via Automatic Control Skips Article Swipe
YOU?
·
· 2025
· Open Access
·
· DOI: https://doi.org/10.48550/arxiv.2505.18256
Control of quantum operations is a crucial yet expensive construct for quantum computation. Efficient implementations of controlled operations often avoid applying control to certain subcircuits, which can significantly reduce the number of gates and overall circuit depth. However, these methods are specialized and circuits frequently need to be implemented manually. This paper presents a generic method for finding "skippable" patterns without having to tailor implementations for each algorithm. We prove that finding the optimal operations to be skipped is generally NP-hard. Nevertheless, sub-optimal, polynomial approximation algorithms that find skippable subcircuits can lead to over $50\%$ improvement in circuit metrics for real-world applications.
Related Topics
- Type
- preprint
- Language
- en
- Landing Page
- http://arxiv.org/abs/2505.18256
- https://arxiv.org/pdf/2505.18256
- OA Status
- green
- OpenAlex ID
- https://openalex.org/W4414581142
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4414581142Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.48550/arxiv.2505.18256Digital Object Identifier
- Title
-
Efficient Quantum Control via Automatic Control SkipsWork title
- Type
-
preprintOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2025Year of publication
- Publication date
-
2025-05-23Full publication date if available
- Authors
-
Peleg Emanuel, Eyal Cornfeld, R. Alon, Shmuel Ur, Israel ReichentalList of authors in order
- Landing page
-
https://arxiv.org/abs/2505.18256Publisher landing page
- PDF URL
-
https://arxiv.org/pdf/2505.18256Direct link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
greenOpen access status per OpenAlex
- OA URL
-
https://arxiv.org/pdf/2505.18256Direct OA link when available
- Cited by
-
0Total citation count in OpenAlex
Full payload
| id | https://openalex.org/W4414581142 |
|---|---|
| doi | https://doi.org/10.48550/arxiv.2505.18256 |
| ids.doi | https://doi.org/10.48550/arxiv.2505.18256 |
| ids.openalex | https://openalex.org/W4414581142 |
| fwci | |
| type | preprint |
| title | Efficient Quantum Control via Automatic Control Skips |
| biblio.issue | |
| biblio.volume | |
| biblio.last_page | |
| biblio.first_page | |
| topics[0].id | https://openalex.org/T10020 |
| topics[0].field.id | https://openalex.org/fields/17 |
| topics[0].field.display_name | Computer Science |
| topics[0].score | 0.9264000058174133 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/1702 |
| topics[0].subfield.display_name | Artificial Intelligence |
| topics[0].display_name | Quantum Information and Cryptography |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| language | en |
| locations[0].id | pmh:oai:arXiv.org:2505.18256 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S4306400194 |
| locations[0].source.issn | |
| locations[0].source.type | repository |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | |
| locations[0].source.is_core | False |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | arXiv (Cornell University) |
| locations[0].source.host_organization | https://openalex.org/I205783295 |
| locations[0].source.host_organization_name | Cornell University |
| locations[0].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[0].license | |
| locations[0].pdf_url | https://arxiv.org/pdf/2505.18256 |
| locations[0].version | submittedVersion |
| locations[0].raw_type | text |
| locations[0].license_id | |
| locations[0].is_accepted | False |
| locations[0].is_published | False |
| locations[0].raw_source_name | |
| locations[0].landing_page_url | http://arxiv.org/abs/2505.18256 |
| locations[1].id | doi:10.48550/arxiv.2505.18256 |
| locations[1].is_oa | True |
| locations[1].source.id | https://openalex.org/S4306400194 |
| locations[1].source.issn | |
| locations[1].source.type | repository |
| locations[1].source.is_oa | True |
| locations[1].source.issn_l | |
| locations[1].source.is_core | False |
| locations[1].source.is_in_doaj | False |
| locations[1].source.display_name | arXiv (Cornell University) |
| locations[1].source.host_organization | https://openalex.org/I205783295 |
| locations[1].source.host_organization_name | Cornell University |
| locations[1].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[1].license | |
| locations[1].pdf_url | |
| locations[1].version | |
| locations[1].raw_type | article |
| locations[1].license_id | |
| locations[1].is_accepted | False |
| locations[1].is_published | |
| locations[1].raw_source_name | |
| locations[1].landing_page_url | https://doi.org/10.48550/arxiv.2505.18256 |
| indexed_in | arxiv, datacite |
| authorships[0].author.id | https://openalex.org/A5115090015 |
| authorships[0].author.orcid | |
| authorships[0].author.display_name | Peleg Emanuel |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Emanuel, Peleg |
| authorships[0].is_corresponding | False |
| authorships[1].author.id | https://openalex.org/A5075397712 |
| authorships[1].author.orcid | https://orcid.org/0000-0002-4540-5824 |
| authorships[1].author.display_name | Eyal Cornfeld |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Cornfeld, Eyal |
| authorships[1].is_corresponding | False |
| authorships[2].author.id | https://openalex.org/A5005606025 |
| authorships[2].author.orcid | https://orcid.org/0000-0001-9161-6369 |
| authorships[2].author.display_name | R. Alon |
| authorships[2].author_position | middle |
| authorships[2].raw_author_name | Alon, Ravid |
| authorships[2].is_corresponding | False |
| authorships[3].author.id | https://openalex.org/A5112810878 |
| authorships[3].author.orcid | |
| authorships[3].author.display_name | Shmuel Ur |
| authorships[3].author_position | middle |
| authorships[3].raw_author_name | Ur, Shmuel |
| authorships[3].is_corresponding | False |
| authorships[4].author.id | https://openalex.org/A5036584521 |
| authorships[4].author.orcid | |
| authorships[4].author.display_name | Israel Reichental |
| authorships[4].author_position | last |
| authorships[4].raw_author_name | Reichental, Israel |
| authorships[4].is_corresponding | False |
| has_content.pdf | False |
| has_content.grobid_xml | False |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://arxiv.org/pdf/2505.18256 |
| open_access.oa_status | green |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Efficient Quantum Control via Automatic Control Skips |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-06T06:51:31.235846 |
| primary_topic.id | https://openalex.org/T10020 |
| primary_topic.field.id | https://openalex.org/fields/17 |
| primary_topic.field.display_name | Computer Science |
| primary_topic.score | 0.9264000058174133 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/1702 |
| primary_topic.subfield.display_name | Artificial Intelligence |
| primary_topic.display_name | Quantum Information and Cryptography |
| cited_by_count | 0 |
| locations_count | 2 |
| best_oa_location.id | pmh:oai:arXiv.org:2505.18256 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4306400194 |
| best_oa_location.source.issn | |
| best_oa_location.source.type | repository |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | |
| best_oa_location.source.is_core | False |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | arXiv (Cornell University) |
| best_oa_location.source.host_organization | https://openalex.org/I205783295 |
| best_oa_location.source.host_organization_name | Cornell University |
| best_oa_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| best_oa_location.license | |
| best_oa_location.pdf_url | https://arxiv.org/pdf/2505.18256 |
| best_oa_location.version | submittedVersion |
| best_oa_location.raw_type | text |
| best_oa_location.license_id | |
| best_oa_location.is_accepted | False |
| best_oa_location.is_published | False |
| best_oa_location.raw_source_name | |
| best_oa_location.landing_page_url | http://arxiv.org/abs/2505.18256 |
| primary_location.id | pmh:oai:arXiv.org:2505.18256 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S4306400194 |
| primary_location.source.issn | |
| primary_location.source.type | repository |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | |
| primary_location.source.is_core | False |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | arXiv (Cornell University) |
| primary_location.source.host_organization | https://openalex.org/I205783295 |
| primary_location.source.host_organization_name | Cornell University |
| primary_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| primary_location.license | |
| primary_location.pdf_url | https://arxiv.org/pdf/2505.18256 |
| primary_location.version | submittedVersion |
| primary_location.raw_type | text |
| primary_location.license_id | |
| primary_location.is_accepted | False |
| primary_location.is_published | False |
| primary_location.raw_source_name | |
| primary_location.landing_page_url | http://arxiv.org/abs/2505.18256 |
| publication_date | 2025-05-23 |
| publication_year | 2025 |
| referenced_works_count | 0 |
| abstract_inverted_index.a | 5, 53 |
| abstract_inverted_index.We | 68 |
| abstract_inverted_index.be | 47, 76 |
| abstract_inverted_index.in | 96 |
| abstract_inverted_index.is | 4, 78 |
| abstract_inverted_index.of | 1, 15, 31 |
| abstract_inverted_index.to | 22, 46, 62, 75, 92 |
| abstract_inverted_index.and | 33, 42 |
| abstract_inverted_index.are | 40 |
| abstract_inverted_index.can | 26, 90 |
| abstract_inverted_index.for | 10, 56, 65, 99 |
| abstract_inverted_index.the | 29, 72 |
| abstract_inverted_index.yet | 7 |
| abstract_inverted_index.This | 50 |
| abstract_inverted_index.each | 66 |
| abstract_inverted_index.find | 87 |
| abstract_inverted_index.lead | 91 |
| abstract_inverted_index.need | 45 |
| abstract_inverted_index.over | 93 |
| abstract_inverted_index.that | 70, 86 |
| abstract_inverted_index.avoid | 19 |
| abstract_inverted_index.gates | 32 |
| abstract_inverted_index.often | 18 |
| abstract_inverted_index.paper | 51 |
| abstract_inverted_index.prove | 69 |
| abstract_inverted_index.these | 38 |
| abstract_inverted_index.which | 25 |
| abstract_inverted_index.$50\%$ | 94 |
| abstract_inverted_index.depth. | 36 |
| abstract_inverted_index.having | 61 |
| abstract_inverted_index.method | 55 |
| abstract_inverted_index.number | 30 |
| abstract_inverted_index.reduce | 28 |
| abstract_inverted_index.tailor | 63 |
| abstract_inverted_index.Control | 0 |
| abstract_inverted_index.certain | 23 |
| abstract_inverted_index.circuit | 35, 97 |
| abstract_inverted_index.control | 21 |
| abstract_inverted_index.crucial | 6 |
| abstract_inverted_index.finding | 57, 71 |
| abstract_inverted_index.generic | 54 |
| abstract_inverted_index.methods | 39 |
| abstract_inverted_index.metrics | 98 |
| abstract_inverted_index.optimal | 73 |
| abstract_inverted_index.overall | 34 |
| abstract_inverted_index.quantum | 2, 11 |
| abstract_inverted_index.skipped | 77 |
| abstract_inverted_index.without | 60 |
| abstract_inverted_index.However, | 37 |
| abstract_inverted_index.NP-hard. | 80 |
| abstract_inverted_index.applying | 20 |
| abstract_inverted_index.circuits | 43 |
| abstract_inverted_index.patterns | 59 |
| abstract_inverted_index.presents | 52 |
| abstract_inverted_index.Efficient | 13 |
| abstract_inverted_index.construct | 9 |
| abstract_inverted_index.expensive | 8 |
| abstract_inverted_index.generally | 79 |
| abstract_inverted_index.manually. | 49 |
| abstract_inverted_index.skippable | 88 |
| abstract_inverted_index.algorithm. | 67 |
| abstract_inverted_index.algorithms | 85 |
| abstract_inverted_index.controlled | 16 |
| abstract_inverted_index.frequently | 44 |
| abstract_inverted_index.operations | 3, 17, 74 |
| abstract_inverted_index.polynomial | 83 |
| abstract_inverted_index.real-world | 100 |
| abstract_inverted_index."skippable" | 58 |
| abstract_inverted_index.implemented | 48 |
| abstract_inverted_index.improvement | 95 |
| abstract_inverted_index.specialized | 41 |
| abstract_inverted_index.subcircuits | 89 |
| abstract_inverted_index.computation. | 12 |
| abstract_inverted_index.sub-optimal, | 82 |
| abstract_inverted_index.subcircuits, | 24 |
| abstract_inverted_index.Nevertheless, | 81 |
| abstract_inverted_index.applications. | 101 |
| abstract_inverted_index.approximation | 84 |
| abstract_inverted_index.significantly | 27 |
| abstract_inverted_index.implementations | 14, 64 |
| cited_by_percentile_year | |
| countries_distinct_count | 0 |
| institutions_distinct_count | 5 |
| citation_normalized_percentile |