Reducing the number of ancilla qubits and the gate count required for creating large controlled operations
| dc.authorid | 0000-0002-1497-5031 | |
| dc.contributor.author | Brown, Katherine L. | |
| dc.contributor.author | Daskin, Anmer | |
| dc.contributor.author | Kais, Sabre | |
| dc.contributor.author | Dowling, Jonathan P. | |
| dc.date.accessioned | 2025-05-10T19:47:33Z | |
| dc.date.issued | 2015 | |
| dc.department | İstanbul Medeniyet Üniversitesi | |
| dc.description.abstract | In this paper, we show that it is possible to adapt a qudit scheme for creating a controlled-Toffoli created by Ralph et al. (Phys Rev A 75:022313, 2007) to be applicable to qubits. While this scheme requires more gates than standard schemes for creating large controlled gates, we show that with simple adaptations, it is directly equivalent to the standard scheme in the literature. This scheme is the most gateefficient way of creating large controlled unitaries currently known; however, it is expensive in terms of the number of ancilla qubits used. We go on to show that using a combination of these standard techniques presented by Barenco et al. (Phys Rev A 52(5): 3457, 1995), we can create an n-qubit version of the Toffoli using less gates and the same number of ancilla qubits as recent work using computer optimization. This would be useful in any architecture of quantum computing where gates are cheap but qubit initialization is expensive. | |
| dc.description.sponsorship | Intelligence Advanced Research Projects Activity (IARPA) via Department of Interior National Business Center [D11PC20168]; NSF CCI [CHE-1037992]; NSF; AFOSR; Direct For Mathematical & Physical Scien; Division Of Physics [1403105] Funding Source: National Science Foundation | |
| dc.description.sponsorship | Katherine Brown and Jonathan Dowling are supported by the Intelligence Advanced Research Projects Activity (IARPA) via Department of Interior National Business Center contract number D11PC20168. The U.S. Government is authorized to reproduce and distribute reprints for Governmental purposes notwithstanding any copyright annotation thereon. Disclaimer: The views and conclusions contained herein are those of the authors and should not be interpreted as necessarily representing the official policies or endorsements, either expressed or implied, of IARPA, DoI/NBC, or the U.S. Government. Sabre Kais thanks NSF CCI Award CHE-1037992. Jonathan Dowling also acknowladges the NSF & the AFOSR. | |
| dc.identifier.doi | 10.1007/s11128-014-0900-1 | |
| dc.identifier.endpage | 899 | |
| dc.identifier.issn | 1570-0755 | |
| dc.identifier.issn | 1573-1332 | |
| dc.identifier.issue | 3 | |
| dc.identifier.scopusquality | Q2 | |
| dc.identifier.startpage | 891 | |
| dc.identifier.uri | https://doi.org/10.1007/s11128-014-0900-1 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.14730/11418 | |
| dc.identifier.volume | 14 | |
| dc.identifier.wos | WOS:000349377900007 | |
| dc.identifier.wosquality | Q1 | |
| dc.indekslendigikaynak | Web of Science | |
| dc.language.iso | en | |
| dc.publisher | Springer | |
| dc.relation.ispartof | Quantum Information Processing | |
| dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | |
| dc.rights | info:eu-repo/semantics/closedAccess | |
| dc.snmz | KA_WOS_20250302 | |
| dc.subject | Quantum computing | |
| dc.subject | Gate decompositions | |
| dc.subject | Resource reduction | |
| dc.subject | Mutli-qubit operations | |
| dc.title | Reducing the number of ancilla qubits and the gate count required for creating large controlled operations | |
| dc.type | Article |










