The following pages link to Quantum Complexity Theory (Q4376183):
Displaying 50 items.
- Identifying Generalized Reed-Muller Codewords by Quantum Queries (Q4977894) (← links)
- Quantum Hardness of Learning Shallow Classical Circuits (Q4994987) (← links)
- (Q5005126) (← links)
- (Q5015214) (← links)
- Quantum information distance (Q5037882) (← links)
- A public key cryptosystem based on data complexity under quantum environment (Q5046478) (← links)
- Undecidability of the Spectral Gap (Q5084676) (← links)
- On Quantum Chosen-Ciphertext Attacks and Learning with Errors (Q5089145) (← links)
- (Q5091154) (← links)
- (Q5091164) (← links)
- (Q5091772) (← links)
- (Q5092483) (← links)
- Entanglement consumption of instantaneous nonlocal quantum measurements (Q5135190) (← links)
- An Introduction to Quantum Computing, without the Physics (Q5140614) (← links)
- Modular quantum computing and quantum-like devices (Q5159113) (← links)
- Revisiting the simulation of quantum Turing machines by quantum circuits (Q5160678) (← links)
- Martin-Löf random quantum states (Q5235513) (← links)
- ON THE PRACTICALITY OF ADIABATIC QUANTUM COMPUTING WITH OPTICAL SCHEMES (Q5292233) (← links)
- Model Reductions for Inference: Generality of Pairwise, Binary, and Planar Factor Graphs (Q5378213) (← links)
- Quantum computing, postselection, and probabilistic polynomial-time (Q5428317) (← links)
- Classically controlled quantum computation (Q5482261) (← links)
- (Q5482449) (← links)
- QUANTUM-CLASSICAL CORRESPONDENCE IN THE ORACLE MODEL OF COMPUTATION (Q5493920) (← links)
- HADAMARD TYPE OPERATIONS FOR QUBITS (Q5493922) (← links)
- RECOVERING STRINGS IN ORACLES: QUANTUM AND CLASSIC (Q5495415) (← links)
- THE DEUTSCH–JOZSA ALGORITHM REVISITED IN THE DOMAIN OF CRYPTOGRAPHICALLY SIGNIFICANT BOOLEAN FUNCTIONS (Q5696623) (← links)
- ANALYSIS OF QUANTUM FUNCTIONS (Q5696940) (← links)
- QUANTUM COMPUTATION WITH RESTRICTED AMPLITUDES (Q5696941) (← links)
- Quantum algorithmic randomness (Q5855663) (← links)
- A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY (Q5858921) (← links)
- Algorithm for initializing a generalized fermionic Gaussian state on a quantum computer (Q5877791) (← links)
- An Optimal Separation of Randomized and Quantum Query Complexity (Q5890036) (← links)
- Theory and Applications of Models of Computation (Q5898863) (← links)
- Fundamentals of Computation Theory (Q5900805) (← links)
- How does adiabatic quantum computation fit into quantum automata theory? (Q5918616) (← links)
- Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice (Q5919277) (← links)
- Quantum simulations of classical random walks and undirected graph connectivity (Q5943095) (← links)
- Remarks on universal quantum computer (Q5954906) (← links)
- Quantum Kolmogorov complexity (Q5956011) (← links)
- Analogies and differences between quantum and stochastic automata (Q5958112) (← links)
- Trace monoids with idempotent generators and measure-only quantum automata (Q5962066) (← links)
- Quantum meet-in-the-middle attack on Feistel construction (Q6043544) (← links)
- Linear growth of circuit complexity from Brownian dynamics (Q6050685) (← links)
- Distributed Bernstein-Vazirani algorithm (Q6061049) (← links)
- Universal Classical Optical Computing Inspired by Quantum Information Process (Q6091536) (← links)
- Borel complexity and Ramsey largeness of sets of oracles separating complexity classes (Q6096803) (← links)
- Fast and scalable quantum computing simulation on multi-core and many-core platforms (Q6098271) (← links)
- Application of quantum approximate optimization algorithm to job shop scheduling problem (Q6113354) (← links)
- Efficient algorithm for full-state quantum circuit simulation with DD compression while maintaining accuracy (Q6149141) (← links)
- A prototype of quantum von Neumann architecture (Q6157055) (← links)
