DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Quantum Turing machine
Quantum Turing machine
Quantum Computer: Quantum Model and Reality
Download
Restricted Versions of the Two-Local Hamiltonian Problem
STRONGLY UNIVERSAL QUANTUM TURING MACHINES and INVARIANCE of KOLMOGOROV COMPLEXITY (AUGUST 11, 2007) 2 Such That the Aforementioned Halting Conditions Are Satisfied
On the Simulation of Quantum Turing Machines
A Quantum Computer Foundation for the Standard Model and Superstring Theories*
Quantum Computing : a Gentle Introduction / Eleanor Rieffel and Wolfgang Polak
Computational Power of Observed Quantum Turing Machines
Quantum Computational Complexity Theory Is to Un- Derstand the Implications of Quantum Physics to Computational Complexity Theory
Models of Quantum Computation and Quantum Programming Languages
Quantum Information Science
Quantum Logarithmic Space and Post-Selection
Physics of Quantum Computation V
Undecidability of the Spectral Gap in One Dimension
Partial Observation of Quantum Turing Machines and a Weaker Well-Formedness Condition Simon Perdrix
Quantum Computation Beyond the Unitary Circuit Model
The Quantum Circuit Model and Universal Quantum Computation
Insolubilitщ En Абв De L'щquation Ге ¤ Жизйг
Top View
10 Quantum Complexity Theory I
Quantum Automata, Machines and Complexity
Computational Complexity in Electronic Structure
The Quantum and Classical Complexity of Translationally Invariant Tiling and Hamiltonian Problems
Computational Complexity: a Modern Approach
Advanced Quantum Algorithms
Arxiv:2006.00987V1 [Quant-Ph] 1 Jun 2020 Complexity Estimation Techniques
Photonic Realization of a Quantum Finite Automaton
Quantum Algorithms for Universal Prediction
Computational Complexity in Electronic Structure
Revisiting the Simulation of Quantum Turing Machines by Quantum Circuits
From Observer States to Physics Via Algorithmic Information Theory
Quantum Turing Machines and Quantum Prover-Verifier Interactions
Information and Computation: Classical and Quantum Aspects
The Computing Power of Turing Machine Based on Quantum Logic
Quantum Computing (CST Part II) Lecture 12: Quantum Complexity
Complexity Zoology
Quantum Simulation Logic, Oracles, and the Quantum Advantage
Estimating Algorithmic Information Using Quantum Computing for Genomics Applications
Quantum Computing 8
Complexity Limitations on Quantum Computation 1 Introduction
Quantum Turing Machine
Arxiv:1912.03767V1 [Quant-Ph] 8 Dec 2019
Lower Bounds on the Classical Simulation of Quantum Circuits for Quantum Supremacy Alexander M. Dalzell
Quantum Computation, Volume 58
Quantum Finite Automata and Logic
Arxiv:1901.07992V1 [Cs.FL] 23 Jan 2019 Quantum Automata Has Been Developed Using the Principles of Classical Automata and Quantum Mechanics
Strengths and Weaknesses of Quantum Computing
6.845 Quantum Complexity Theory, Lecture 15
Thesis Format
Quantum Finite Automata and Logic
Computability Theory of Closed Timelike Curves
The Ghost in the Quantum Turing Machine
Quantum Computation and a Universal Quantum Computer
Quantum Complexity Theory 1 Introduction
Quantum Computation: Theory and Implementation
Computing Power of Turing Machines Based on Quantum Logic
CALIFORNIA STATE UNIVERSITY, NORTHRIDGE MODELING QUANTUM CIRCUITS a Graduate Project Submitted in Partial Fulfillment of The
Quantum Finite Automata, Quantum Pushdown Automata & Quantum
Quantum Computation with Supplementary Information