The Cost of Quantum Gates
The cost of the most frequently used gates in quantum computation is estimated by counting the sequence of basic physical operations required for implementation on a quantum computer. The sequence of physical operations comprising each gate is minimized using a software algorithm based on commutatio...
| Main Authors: | , , , , |
|---|---|
| Format: | Journal article |
| Published: |
2006
|
| _version_ | 1826280219448705024 |
|---|---|
| author | Lee, S Lee, S Kim, T Lee, J Biamonte, J Perkowski, M |
| author_facet | Lee, S Lee, S Kim, T Lee, J Biamonte, J Perkowski, M |
| author_sort | Lee, S |
| collection | OXFORD |
| description | The cost of the most frequently used gates in quantum computation is estimated by counting the sequence of basic physical operations required for implementation on a quantum computer. The sequence of physical operations comprising each gate is minimized using a software algorithm based on commutation rules. Because operation costs are machine dependent, an ideal practical quantum computer is presented and used for calculations. The presented gate costs are not necessarily minimal; however at least they provide reference to the upper bound. |
| first_indexed | 2024-03-07T00:10:25Z |
| format | Journal article |
| id | oxford-uuid:79090b01-50fb-4c1a-a151-21887e19d958 |
| institution | University of Oxford |
| last_indexed | 2024-03-07T00:10:25Z |
| publishDate | 2006 |
| record_format | dspace |
| spelling | oxford-uuid:79090b01-50fb-4c1a-a151-21887e19d9582022-03-26T20:34:48ZThe Cost of Quantum GatesJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:79090b01-50fb-4c1a-a151-21887e19d958Department of Computer Science2006Lee, SLee, SKim, TLee, JBiamonte, JPerkowski, MThe cost of the most frequently used gates in quantum computation is estimated by counting the sequence of basic physical operations required for implementation on a quantum computer. The sequence of physical operations comprising each gate is minimized using a software algorithm based on commutation rules. Because operation costs are machine dependent, an ideal practical quantum computer is presented and used for calculations. The presented gate costs are not necessarily minimal; however at least they provide reference to the upper bound. |
| spellingShingle | Lee, S Lee, S Kim, T Lee, J Biamonte, J Perkowski, M The Cost of Quantum Gates |
| title | The Cost of Quantum Gates |
| title_full | The Cost of Quantum Gates |
| title_fullStr | The Cost of Quantum Gates |
| title_full_unstemmed | The Cost of Quantum Gates |
| title_short | The Cost of Quantum Gates |
| title_sort | cost of quantum gates |
| work_keys_str_mv | AT lees thecostofquantumgates AT lees thecostofquantumgates AT kimt thecostofquantumgates AT leej thecostofquantumgates AT biamontej thecostofquantumgates AT perkowskim thecostofquantumgates AT lees costofquantumgates AT lees costofquantumgates AT kimt costofquantumgates AT leej costofquantumgates AT biamontej costofquantumgates AT perkowskim costofquantumgates |