{"title":"一种利用量子图灵机高效求解SAT的方法","authors":"T. Mihara, T. Nishino","doi":"10.1109/PHYCMP.1994.363683","DOIUrl":null,"url":null,"abstract":"In this paper, under an assumption that superposed physical states can be observed without collapsing the superposition, we show that the satisfiability problem (SAT, for short) can be solved by a quantum Turing machine in O(2/sup n/4/) time. This assumption is not widely accepted among physicists, however, (Aharonov et al., 1993) conjecture that a physical state actually exists as a superposition and can be observed without collapsing the superposition.<<ETX>>","PeriodicalId":378733,"journal":{"name":"Proceedings Workshop on Physics and Computation. PhysComp '94","volume":"1997 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"On a method of solving SAT efficiently using the quantum Turing machine\",\"authors\":\"T. Mihara, T. Nishino\",\"doi\":\"10.1109/PHYCMP.1994.363683\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, under an assumption that superposed physical states can be observed without collapsing the superposition, we show that the satisfiability problem (SAT, for short) can be solved by a quantum Turing machine in O(2/sup n/4/) time. This assumption is not widely accepted among physicists, however, (Aharonov et al., 1993) conjecture that a physical state actually exists as a superposition and can be observed without collapsing the superposition.<<ETX>>\",\"PeriodicalId\":378733,\"journal\":{\"name\":\"Proceedings Workshop on Physics and Computation. PhysComp '94\",\"volume\":\"1997 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-11-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Workshop on Physics and Computation. PhysComp '94\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PHYCMP.1994.363683\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Workshop on Physics and Computation. PhysComp '94","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PHYCMP.1994.363683","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
摘要
本文在假设可以观察到叠加的物理状态而不使叠加坍缩的情况下，证明了量子图灵机可以在O(2/sup n/4/)时间内解决可满足性问题(简称SAT)。然而，这一假设并未被物理学家广泛接受，(Aharonov et al.， 1993)推测，一种物理状态实际上是以叠加态存在的，并且可以在不坍塌叠加态的情况下观察到。
On a method of solving SAT efficiently using the quantum Turing machine
In this paper, under an assumption that superposed physical states can be observed without collapsing the superposition, we show that the satisfiability problem (SAT, for short) can be solved by a quantum Turing machine in O(2/sup n/4/) time. This assumption is not widely accepted among physicists, however, (Aharonov et al., 1993) conjecture that a physical state actually exists as a superposition and can be observed without collapsing the superposition.<>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
