Home »
Academic Articles & Research Papers
Showing 20 of 49 academic articles
David G. Cory, Amr F. Fahmy, Timothy F. Havel • Proceedings of the National Academy of Sciences
(1997)
A quantum computer (QC) can operate in parallel on all its possible inputs at once, but the amount of information that can be extracted from the result is limited by the phenomenon of wave function collapse. We present a new computational m...
OPENALEX
Open Access
DOI: https://doi.org/10.1073/pnas.94.5.1634
PMC: 19968
Atiye Zeynali, Zahra Bakhshi • Scientific Reports
(2026)
Abstract Simulating open quantum system dynamics via exact density-matrix propagation faces exponential complexity, scaling as $$\mathcal{O}(4^n)$$ and becoming intractable beyond approximately 15 chromophores on classical hardware—despite ...
DOAJ
Open Access (DOAJ)
DOI: 10.1038/s41598-026-60704-6
Pil Hun Song, Dima L. Shepelyansky • Physical Review Letters
(2001)
We study numerically the imperfection effects in the quantum computing of the kicked rotator model in the regime of quantum chaos. It is shown that there are two types of physical characteristics: for one of them the quantum computation err...
OPENALEX
Open Access
DOI: https://doi.org/10.1103/physrevlett.86.2162
Xiangyu Li, Xiaolong Yin, Nathan Wiebe, Jaehun Chun et al. • Physical Review Research
(2025)
Numerical simulation of turbulent fluid dynamics needs to either parametrize turbulence—which introduces large uncertainties—or explicitly resolve the smallest scales—which is prohibitively expensive. Here, we provide evidence through analy...
DOAJ
Open Access (DOAJ)
DOI: 10.1103/PhysRevResearch.7.013036
Babinkostova Liljana, Chin Ariana, Kirtland Aaron, Nazarchuk Vladyslav et al. • Journal of Mathematical Cryptology
(2022)
As quantum computing advances rapidly, guaranteeing the security of cryptographic protocols resistant to quantum attacks is paramount. Some leading candidate cryptosystems use the learning with errors (LWE) problem, attractive for its simpl...
DOAJ
Open Access (DOAJ)
DOI: 10.1515/jmc-2020-0035
Scott Aaronson • Physical Review A
(2005)
This paper initiates the study of hidden variables from a quantum computing perspective. For us, a hidden-variable theory is simply a way to convert a unitary matrix that maps one quantum state to another into a stochastic matrix that maps ...
OPENALEX
Open Access
DOI: https://doi.org/10.1103/physreva.71.032325
Daniel Mills, Seyon Sivarajah, Travis L. Scholten, Ross Duncan • Quantum
(2021)
Quantum computing systems need to be benchmarked in terms of practical tasks they would be expected to do. Here, we propose 3 "application-motivated" circuit classes for benchmarking: deep (relevant for state preparation in the variational ...
DOAJ
Open Access (DOAJ)
DOI: 10.22331/q-2021-03-22-415
Louis Hirsch Kauffman • Contemporary mathematics - American Mathematical Society
(2002)
This paper is an exploration of relationships between the Jones polynomial and quantum computing. We discuss the structure of the Jones polynomial in relation to representations of the Temperley Lieb algebra, and give an example of a unitar...
OPENALEX
Open Access
DOI: https://doi.org/10.1090/conm/305/05218
Cristian S. Calude, Michael J. Dinneen, Karl Svozil • Complexity
(2000)
In this rather speculative note three problems pertaining to the power and limits of quantum computing are posed and partially answered: (a) when are quantum speedups possible? (b) is fixed-point computing a better model for quantum computi...
OPENALEX
DOI: https://doi.org/10.1002/1099-0526(200009/10)6:1<35::aid-cplx1005>3.0.co;2-t
André Berthiaume, Gilles Brassard • Journal of Modern Optics
(1994)
Building on the work of Deutsch and Jozsa, we construct oracles relative to which (1) there is a decision problem that can be solved with certainty in worst-case polynomial time on the quantum computer, yet it cannot be solved classically i...
OPENALEX
DOI: https://doi.org/10.1080/09500349414552351
Scott Aaronson • Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences
(2005)
I study the class of problems efficiently solvable by a quantum computer, given the ability to ‘postselect’ on the outcomes of measurements. I prove that this class coincides with a classical complexity class called PP, or probabilistic pol...
OPENALEX
Open Access
DOI: https://doi.org/10.1098/rspa.2005.1546
Nader Motee, Ali Jadbabaie • IEEE Transactions on Automatic Control
(2008)
In this paper, we study the structural properties of optimal control of spatially distributed systems. Such systems consist of an infinite collection of possibly heterogeneous linear control systems that are spatially interconnected via cer...
OPENALEX
DOI: https://doi.org/10.1109/tac.2008.929366
Harish K. Pillai, Shiva Shankar • SIAM Journal on Control and Optimization
(1999)
This paper develops a theory of control for distributed systems (i.e., those defined by systems of constant coefficient partial differential operators) via the behavioral approach of Willems. The study here is algebraic in the sense that it...
OPENALEX
DOI: https://doi.org/10.1137/s0363012997321784
Alberto Montina, Stefan Wolf • Entropy
(2019)
In view of the importance of quantum non-locality in cryptography, quantum computation, and communication complexity, it is crucial to decide whether a given correlation exhibits non-locality or not. As proved by Pitowski, this problem is N...
DOAJ
Open Access (DOAJ)
DOI: 10.3390/e21020104
John P. Preskill • arXiv (Cornell University)
(2012)
Quantum information science explores the frontier of highly complex quantum states, the "entanglement frontier." This study is motivated by the observation (widely believed but unproven) that classical systems cannot simulate highly entangl...
OPENALEX
Open Access
DOI: https://doi.org/10.48550/arxiv.1203.5813
Sergey B. Bravyi, Oliver Dial, Jay Gambetta, Darı́o Gil et al. • Journal of Applied Physics
(2022)
For the first time in history, we are seeing a branching point in computing paradigms with the emergence of quantum processing units (QPUs). Extracting the full potential of computation and realizing quantum algorithms with a super-polynomi...
OPENALEX
Open Access
DOI: https://doi.org/10.1063/5.0082975
Eleanor Gilbert Rieffel, Wolfgang Polak • ACM Computing Surveys
(2000)
Richard Feynman's observation that certain quantum mechanical effects cannot be simulated efficiently on a computer led to speculation that computation in general could be done more efficiently if it used these quantum effects. This specula...
OPENALEX
Open Access
DOI: https://doi.org/10.1145/367701.367709
Leonard M. Adleman, Jonathan DeMarrais, Ming-Deh A. Huang • SIAM Journal on Computing
(1997)
In this paper some theoretical and (potentially) practical aspects of quantum computing are considered. Using the tools of transcendental number theory it is demonstrated that quantum Turing machines (QTM) with rational amplitudes are suffi...
OPENALEX
DOI: https://doi.org/10.1137/s0097539795293639
Peter W. Shor • EMS Press eBooks
(1998)
The Church-Turing thesis says that a digital computer is a universal computational device; that is, it is able to simulate any physically realizable computational device. It has generally been believed that this simulation can be made effic...
OPENALEX
DOI: https://doi.org/10.4171/dms/1-1/16
Warren S. Warren • Science
(1997)
Quantum computing—the manipulation of a quantum mechanical system to do information processing—has attracted considerable recent attention, largely triggered by Shor's proposed algorithm for finding prime factors in polynomial instead of ex...
OPENALEX
DOI: https://doi.org/10.1126/science.277.5332.1688