Ultimate Limits to Computation: Anharmonic Oscillator
Motivated by studies of ultimate speed of computers, we examine the question of minimum time of orthogonalization in a simple anharmonic oscillator and find an upper bound on the rate of computations. Furthermore, we investigate the growth rate of complexity of operation when the system undergoes a...
Gespeichert in:
| Veröffentlicht in: | arXiv.org 2023-01 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | arXiv.org |
| container_volume | |
| creator | Khorasani, Fatemeh Tanhayi, Mohammad Reza Pirmoradian, Reza |
| description | Motivated by studies of ultimate speed of computers, we examine the question of minimum time of orthogonalization in a simple anharmonic oscillator and find an upper bound on the rate of computations. Furthermore, we investigate the growth rate of complexity of operation when the system undergoes a definite perturbation. At the phase space of the parameters, by numerical analysis, we find the critical point where beyond that the rate of complexity changes its behavior. |
| doi_str_mv | 10.48550/arxiv.2103.03124 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_2103_03124</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2497372390</sourcerecordid><originalsourceid>FETCH-LOGICAL-a954-9e8fd1892e35d38377f03b7b16657d4836efbec728932a0ef6ba7b62b47a65ef3</originalsourceid><addsrcrecordid>eNotj81Kw0AURgdBsNQ-gCsDrhNn7p2_uCtBrRDopq7DJJnglCQTJxPRt7e2rr7N4eMcQu4YzbgWgj6a8O2-MmAUM4oM-BVZASJLNQe4IZt5PlJKQSoQAldEvPfRDSbapHSDi3MSfVL4YVqiic6PT8l2_DBh8KNrkv3cuL430Ydbct2Zfrab_12Tw8vzodil5f71rdiWqckFT3Oru5bpHCyKFjUq1VGsVc2kFKrlGqXtatso0DmCobaTtVG1hJorI4XtcE3uL7fnpmoKJ9PwU_21Vee2E_FwIabgPxc7x-rolzCenCrguUIFmFP8BbyWUMw</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2497372390</pqid></control><display><type>article</type><title>Ultimate Limits to Computation: Anharmonic Oscillator</title><source>arXiv.org</source><source>Free E- Journals</source><creator>Khorasani, Fatemeh ; Tanhayi, Mohammad Reza ; Pirmoradian, Reza</creator><creatorcontrib>Khorasani, Fatemeh ; Tanhayi, Mohammad Reza ; Pirmoradian, Reza</creatorcontrib><description>Motivated by studies of ultimate speed of computers, we examine the question of minimum time of orthogonalization in a simple anharmonic oscillator and find an upper bound on the rate of computations. Furthermore, we investigate the growth rate of complexity of operation when the system undergoes a definite perturbation. At the phase space of the parameters, by numerical analysis, we find the critical point where beyond that the rate of complexity changes its behavior.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.2103.03124</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Anharmonicity ; Complexity ; Perturbation ; Physics - High Energy Physics - Theory ; Physics - Quantum Physics ; Quantum computing ; Quantum theory ; Upper bounds</subject><ispartof>arXiv.org, 2023-01</ispartof><rights>2023. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,784,885,27925</link.rule.ids><backlink>$$Uhttps://doi.org/10.48550/arXiv.2103.03124$$DView paper in arXiv$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.1140/epjp/s13360-022-02900-7$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink></links><search><creatorcontrib>Khorasani, Fatemeh</creatorcontrib><creatorcontrib>Tanhayi, Mohammad Reza</creatorcontrib><creatorcontrib>Pirmoradian, Reza</creatorcontrib><title>Ultimate Limits to Computation: Anharmonic Oscillator</title><title>arXiv.org</title><description>Motivated by studies of ultimate speed of computers, we examine the question of minimum time of orthogonalization in a simple anharmonic oscillator and find an upper bound on the rate of computations. Furthermore, we investigate the growth rate of complexity of operation when the system undergoes a definite perturbation. At the phase space of the parameters, by numerical analysis, we find the critical point where beyond that the rate of complexity changes its behavior.</description><subject>Anharmonicity</subject><subject>Complexity</subject><subject>Perturbation</subject><subject>Physics - High Energy Physics - Theory</subject><subject>Physics - Quantum Physics</subject><subject>Quantum computing</subject><subject>Quantum theory</subject><subject>Upper bounds</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GOX</sourceid><recordid>eNotj81Kw0AURgdBsNQ-gCsDrhNn7p2_uCtBrRDopq7DJJnglCQTJxPRt7e2rr7N4eMcQu4YzbgWgj6a8O2-MmAUM4oM-BVZASJLNQe4IZt5PlJKQSoQAldEvPfRDSbapHSDi3MSfVL4YVqiic6PT8l2_DBh8KNrkv3cuL430Ydbct2Zfrab_12Tw8vzodil5f71rdiWqckFT3Oru5bpHCyKFjUq1VGsVc2kFKrlGqXtatso0DmCobaTtVG1hJorI4XtcE3uL7fnpmoKJ9PwU_21Vee2E_FwIabgPxc7x-rolzCenCrguUIFmFP8BbyWUMw</recordid><startdate>20230121</startdate><enddate>20230121</enddate><creator>Khorasani, Fatemeh</creator><creator>Tanhayi, Mohammad Reza</creator><creator>Pirmoradian, Reza</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>GOX</scope></search><sort><creationdate>20230121</creationdate><title>Ultimate Limits to Computation: Anharmonic Oscillator</title><author>Khorasani, Fatemeh ; Tanhayi, Mohammad Reza ; Pirmoradian, Reza</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a954-9e8fd1892e35d38377f03b7b16657d4836efbec728932a0ef6ba7b62b47a65ef3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Anharmonicity</topic><topic>Complexity</topic><topic>Perturbation</topic><topic>Physics - High Energy Physics - Theory</topic><topic>Physics - Quantum Physics</topic><topic>Quantum computing</topic><topic>Quantum theory</topic><topic>Upper bounds</topic><toplevel>online_resources</toplevel><creatorcontrib>Khorasani, Fatemeh</creatorcontrib><creatorcontrib>Tanhayi, Mohammad Reza</creatorcontrib><creatorcontrib>Pirmoradian, Reza</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Access via ProQuest (Open Access)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>arXiv.org</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Khorasani, Fatemeh</au><au>Tanhayi, Mohammad Reza</au><au>Pirmoradian, Reza</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Ultimate Limits to Computation: Anharmonic Oscillator</atitle><jtitle>arXiv.org</jtitle><date>2023-01-21</date><risdate>2023</risdate><eissn>2331-8422</eissn><abstract>Motivated by studies of ultimate speed of computers, we examine the question of minimum time of orthogonalization in a simple anharmonic oscillator and find an upper bound on the rate of computations. Furthermore, we investigate the growth rate of complexity of operation when the system undergoes a definite perturbation. At the phase space of the parameters, by numerical analysis, we find the critical point where beyond that the rate of complexity changes its behavior.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.2103.03124</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | EISSN: 2331-8422 |
| ispartof | arXiv.org, 2023-01 |
| issn | 2331-8422 |
| language | eng |
| recordid | cdi_arxiv_primary_2103_03124 |
| source | arXiv.org; Free E- Journals |
| subjects | Anharmonicity Complexity Perturbation Physics - High Energy Physics - Theory Physics - Quantum Physics Quantum computing Quantum theory Upper bounds |
| title | Ultimate Limits to Computation: Anharmonic Oscillator |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-23T21%3A34%3A21IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_arxiv&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Ultimate%20Limits%20to%20Computation:%20Anharmonic%20Oscillator&rft.jtitle=arXiv.org&rft.au=Khorasani,%20Fatemeh&rft.date=2023-01-21&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.2103.03124&rft_dat=%3Cproquest_arxiv%3E2497372390%3C/proquest_arxiv%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2497372390&rft_id=info:pmid/&rfr_iscdi=true |