aqora

Study on mixed-state ensemble quantum computation by numerical simulations

暁齋藤

Mar 23, 20070 citations

Ensemble fluid simulations on quantum computers

Sauro Succi A, Wael Itani, Claudio Sanavio +2 more

arXiv:2304.05410Computers & FluidsDec 9, 202323 citations

General approaches in ensemble quantum computing

V. Vimalan, Narayanan Chandrakumar

Journal of Chemical SciencesJan 1, 20082 citations

Quantifiable Simulation of Quantum Computation beyond Stochastic Ensemble Computation (Adv. Quantum Technol. 2/2018)

Jeongho Bang, Junghee Ryu, Chang‐Woo Lee +3 more

A model of quantum computation (QC) is compared with a generalized classical computation model, named stochastic ensemble computation (SEnC), in article number 1800037 by Jeongho Bang, Jinhyoung Lee, Wonmin Son and co-workers. SEnC runs in an ensemble consisting of finite copies of single probabilistic entities, and hence is a generalized probabilistic Turing machine. Impossibility of simulating a QC in the SEnC is proved, manifesting “QC is characterized beyond any classical probabilistic computation,” i.e., SEnC ⊆ QC.A model of quantum computation (QC) is compared with a generalized classical computation model, named stochastic ensemble computation (SEnC), in article number 1800037 by Jeongho Bang, Jinhyoung Lee, Wonmin Son and co-workers. SEnC runs in an ensemble consisting of finite copies of single probabilistic entities, and hence is a generalized probabilistic Turing machine. Impossibility of simulating a QC in the SEnC is proved, manifesting “QC is characterized beyond any classical probabilistic computation,” i.e., SEnC ⊆ QC.

Advanced Quantum TechnologiesOct 1, 20180 citations

Quantifiable Simulation of Quantum Computation beyond Stochastic Ensemble Computation

Jeongho Bang, Junghee Ryu, Chang‐Woo Lee +3 more

Abstract In this study, a distinctive feature of quantum computation (QC) is characterized. To this end, a seemingly‐powerful classical computing model, called “stochastic ensemble machine (SEnM),” is considered. The SEnM runs with an ensemble consisting of finite copies of a single probabilistic machine, hence is as powerful as a probabilistic Turing machine (PTM). Then the hypothesis—that is, the SEnM can effectively simulate a general circuit model of QC—is tested by introducing an information‐theoretic inequality, named readout inequality. The inequality is satisfied by the SEnM and imposes a critical condition: if the hypothesis holds, the inequality should be satisfied by the probing model of QC. However, it is shown that the above hypothesis is not generally accepted with the inequality violation; namely, such a simulation necessarily fails, implying that PTM ⊆ QC.Abstract In this study, a distinctive feature of quantum computation (QC) is characterized. To this end, a seemingly‐powerful classical computing model, called “stochastic ensemble machine (SEnM),” is considered. The SEnM runs with an ensemble consisting of finite copies of a single probabilistic machine, hence is as powerful as a probabilistic Turing machine (PTM). Then the hypothesis—that is, the SEnM can effectively simulate a general circuit model of QC—is tested by introducing an information‐theoretic inequality, named readout inequality. The inequality is satisfied by the SEnM and imposes a critical condition: if the hypothesis holds, the inequality should be satisfied by the probing model of QC. However, it is shown that the above hypothesis is not generally accepted with the inequality violation; namely, such a simulation necessarily fails, implying that PTM ⊆ QC.

arXiv:1604.07517Advanced Quantum TechnologiesAug 24, 20184 citations

Simulation of Quantum Computation

Tzvetan S. Metodi, Arvin I. Faruque, Frederic T. Chong

Synthesis lectures on computer architectureJan 1, 20111 citation

A simulator for ensemble quantum computing

Related papers

A simulator for ensemble quantum computing

Related papers