Stem quantum$ (all stems)

248 papers:

DAC-2015-PalerD #fault tolerance #quantum

An introduction into fault-tolerant quantum computing (AP, SJD), p. 6.

DAC-2015-PolianF #architecture #automation #challenge #design #quantum #scalability

Design automation challenges for scalable quantum architectures (IP, AGF), p. 6.

DATE-2015-AhsanK #architecture #optimisation #quantum #using

Optimization of quantum computer architecture using a resource-performance simulator (MA, JK), pp. 1108–1113.

STOC-2015-AaronsonA #named #problem #quantum

Forrelation: A Problem that Optimally Separates Quantum from Classical Computing (SA, AA), pp. 307–316.

STOC-2015-BaconFHS #quantum

Sparse Quantum Codes from Quantum Circuits (DB, STF, AWH, JS), pp. 327–334.

STOC-2015-ODonnellW #quantum #testing

Quantum Spectrum Testing (RO, JW), pp. 529–538.

STOC-2015-Touchette #complexity #quantum

Quantum Information Complexity (DT), pp. 317–326.

CIAA-2015-NakanishiY #automaton #problem #quantum

Classical and Quantum Counter Automata on Promise Problems (MN, AY), pp. 224–237.

DLT-2015-GainutdinovaY #automaton #probability #problem #quantum

Unary Probabilistic and Quantum Automata on Promise Problems (AG, AY), pp. 252–263.

DLT-2015-Yamakami #bound #complexity #quantum

Complexity Bounds of Constant-Space Quantum Computation — (Extended Abstract) (TY), pp. 426–438.

FM-2015-FengHTZ #model checking #named #protocol #quantum #source code

QPMC: A Model Checker for Quantum Programs and Protocols (YF, EMH, AT, LZ), pp. 265–272.

POPL-2015-Staton #algebra #programming language #quantum

Algebraic Effects, Linearity, and Quantum Programming Languages (SS), pp. 395–406.

ASPLOS-2015-HeckeyPJHKBFCM #communication #compilation #parallel #quantum

Compiler Management of Communication and Parallelism for Quantum Computation (JH, SP, AJ, AH, DK, KRB, DF, FTC, MM), pp. 445–456.

SAT-2015-DouglassKR #quantum #satisfiability

Constructing SAT Filters with a Quantum Annealer (AD, ADK, JR), pp. 104–120.

DATE-2014-PalerDNP #fault tolerance #quantum

Software-based Pauli tracking in fault-tolerant quantum circuits (AP, SJD, KN, IP), pp. 1–4.

ESOP-2014-YoshimizuHFL #higher-order #metric #proving #quantum

Measurements in Proof Nets as Higher-Order Quantum Circuits (AY, IH, CF, UDL), pp. 371–391.

TACAS-2014-Ardeshir-LarijaniGN #concurrent #equivalence #protocol #quantum #verification

Verification of Concurrent Quantum Protocols by Equivalence Checking (EAL, SJG, RN), pp. 500–514.

STOC-2014-EisentragerHK0 #algorithm #quantum

A quantum algorithm for computing the unit group of an arbitrary degree number field (KE, SH, AK, FS), pp. 293–302.

STOC-2014-MillerS #protocol #quantum #robust #using

Robust protocols for securely expanding randomness and distributing keys using untrusted quantum devices (CAM, YS), pp. 417–426.

DLT-J-2013-BertoniCD14 #automaton #context-free grammar #decidability #on the #problem #quantum

On the Decidability of the Intersection Problem for Quantum Automata and Context-Free Languages (AB, CC, FD), pp. 1065–1082.

CIAA-2014-BianchiMP #automaton #on the #power of #quantum

On the Power of One-Way Automata with Quantum and Classical States (MPB, CM, BP), pp. 84–97.

CIAA-2014-RashidY #automaton #quantum

Implications of Quantum Automata for Contextuality (JR, AY), pp. 318–331.

DLT-2014-YakaryilmazSD #quantum #verification

Debates with Small Transparent Quantum Verifiers (AY, ACCS, HGD), pp. 327–338.

LATA-2014-ZhengGQ #automaton #complexity #finite #on the

On the State Complexity of Semi-quantum Finite Automata (SZ, JG, DQ), pp. 601–612.

DUXU-DI-2014-NeidlingerJ #quantum

Sound Bending — Talking Bodies Quantum Sound Suits (KN, WJ), pp. 598–605.

ICPR-2014-AytekinKG #automation #quantum #segmentation

Automatic Object Segmentation by Quantum Cuts (ÇA, SK, MG), pp. 112–117.

ICPR-2014-LuZXGW #approximate #morphism #quantum

Approximate Maximum Common Sub-graph Isomorphism Based on Discrete-Time Quantum Walk (KL, YZ, KX, YG, RCW), pp. 1413–1418.

PPDP-2014-Karczmarczuk #concept #declarative #on the #quantum #tutorial

On the Declarative Structure of Quantum Concepts: States and Observables (Distilled Tutorial) (JK), pp. 105–110.

POPL-2014-PaganiSV #higher-order #quantum #semantics

Applying quantitative semantics to higher-order quantum computing (MP, PS, BV), pp. 647–658.

SAC-2014-AvilaMRPY #distributed #quantum #simulation

GPU-aware distributed quantum simulation (AA, AM, RR, MLP, ACY), pp. 860–865.

SAC-2014-ShinJLY #automaton #design

Design of a cellular automata cell with rule 30 on quantum-dot cellular automata (SHS, JCJ, GJL, KYY), pp. 1749–1750.

DAC-2013-DoustiP #algorithm #estimation #latency #named #quantum

LEQA: latency estimation for a quantum algorithm mapped to a quantum circuit fabric (MJD, MP), p. 7.

DAC-2013-ShafaeiSP #architecture #distance #interactive #linear #nearest neighbour #optimisation #quantum

Optimization of quantum circuits for interaction distance in linear nearest neighbor architectures (AS, MS, MP), p. 6.

TACAS-2013-Ardeshir-LarijaniGN #equivalence #protocol #quantum

Equivalence Checking of Quantum Protocols (EAL, SJG, RN), pp. 478–492.

PLDI-2013-GreenLRSV #named #programming language #quantum #scalability

Quipper: a scalable quantum programming language (ASG, PLL, NJR, PS, BV), pp. 333–342.

STOC-2013-Ambainis #algorithm #quantum

Superlinear advantage for exact quantum algorithms (AA), pp. 891–900.

STOC-2013-BrandaoH #metric #quantum #theorem

Quantum de finetti theorems under local measurements with applications (FGSLB, AWH), pp. 861–870.

STOC-2013-BrandaoH13a #approximate #quantum

Product-state approximations to quantum ground states (FGSLB, AWH), pp. 871–880.

STOC-2013-Ta-Shma #matrix #quantum

Inverting well conditioned matrices in quantum logspace (ATS), pp. 881–890.

DLT-J-2012-IwamaN13 #quantum #string

Recovering Strings in Oracles: Quantum and Classic (KI, HN), pp. 979–994.

DLT-2013-BertoniCD #automaton #context-free grammar #decidability #finite #linear #problem #quantum

Quantum Finite Automata and Linear Context-Free Languages: A Decidable Problem (AB, CC, FD), pp. 82–93.

ICALP-v1-2013-BelovsCJKM #3d #quantum

Time-Efficient Quantum Walks for 3-Distinctness (AB, AMC, SJ, RK, FM), pp. 105–122.

SFM-2013-Pachos #quantum

Topological Quantum Computation (JKP), pp. 150–179.

CIKM-2013-SordoniHN #information retrieval #interactive #modelling #quantum #topic #using

Modeling latent topic interactions using quantum interference for information retrieval (AS, JH, JYN), pp. 1197–1200.

SIGIR-2013-SordoniNB #dependence #information retrieval #modelling #quantum

Modeling term dependencies with quantum language models for IR (AS, JYN, YB), pp. 653–662.

LICS-2013-Vicary #algorithm #quantum

Topological Structure of Quantum Algorithms (JV), pp. 93–102.

DAC-2012-SasanianWM #quantum #using

Realizing reversible circuits using a new class of quantum gates (ZS, RW, DMM), pp. 36–41.

DATE-2012-DoustiP #latency #quantum

Minimizing the latency of quantum circuits during mapping to the ion-trap circuit fabric (MJD, MP), pp. 840–843.

STOC-2012-AaronsonC #quantum

Quantum money from hidden subspaces (SA, PC), pp. 41–60.

STOC-2012-VaziraniV #generative #quantum #random

Certifiable quantum dice: or, true random number generation secure against quantum adversaries (UVV, TV), pp. 61–76.

DLT-J-2011-ArrighiD12 #physics #quantum

The Physical Church-Turing Thesis and the Principles of Quantum Theory (PA, GD), pp. 1131–1146.

DLT-J-2011-SayY12 #automaton #quantum

Quantum Counter Automata (ACCS, AY), pp. 1099–1116.

DLT-J-2011-ZhengQL12 #automaton #finite #quantum

Some Languages Recognized by Two-Way Finite Automata with Quantum and Classical States (SZ, DQ, LL), pp. 1117–1130.

DLT-2012-Iwama #quantum #string

Recovering Strings in Oracles: Quantum and Classic (KI), p. 23.

ICALP-v1-2012-AmbainisBBKOSV #game studies #quantum

Quantum Strategies Are Better Than Classical in Almost Any XOR Game (AA, AB, KB, DK, RO, JS, MV), pp. 25–37.

ICALP-v1-2012-GharibianK #approximate #problem #quantum

Hardness of Approximation for Quantum Problems (SG, JK), pp. 387–398.

ICALP-v1-2012-JefferyKM #complexity #graph #matrix #multi #quantum #query #using

Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision (SJ, RK, FM), pp. 522–532.

ICALP-v1-2012-Kimmel #bound #quantum

Quantum Adversary (Upper) Bound (SK), pp. 557–568.

ICALP-v1-2012-LaplanteLR #bound #detection #quantum

Classical and Quantum Partition Bound and Detector Inefficiency (SL, VL, JR), pp. 617–628.

LATA-2012-Dowek #automaton #formal method #physics #quantum

Around the Physical Church-Turing Thesis: Cellular Automata, Formal Languages, and the Principles of Quantum Theory (GD), pp. 21–37.

LATA-2012-Yamakami #automaton #finite #quantum

One-Way Reversible and Quantum Finite Automata with Advice (TY), pp. 526–537.

ICML-2012-DenchevDVN #classification #optimisation #quantum #robust

Robust Classification with Adiabatic Quantum Optimization (VSD, ND, SVNV, HN), p. 131.

QAPL-2012-BelardinelliGL #automation #protocol #quantum #using #verification

Automated Verification of Quantum Protocols using MCMAS (FB, PG, AL), pp. 48–62.

LICS-2012-CoeckeDKW #category theory #quantum

Strong Complementarity and Non-locality in Categorical Quantum Mechanics (BC, RD, AK, QW), pp. 245–254.

LICS-2012-Vicary #protocol #quantum #semantics

Higher Semantics of Quantum Protocols (JV), pp. 606–615.

DATE-2011-BruschiPRS #automaton #performance

An efficient Quantum-Dot Cellular Automata adder (FB, FP, VR, DS), pp. 1220–1223.

FoSSaCS-2011-Jacobs #algebra #quantum

Coalgebraic Walks, in Quantum and Turing Computation (BJ0), pp. 12–26.

FoSSaCS-2011-Panangaden #quantum

The Search for Structure in Quantum Computation (PP), pp. 1–11.

STOC-2011-BrandaoCY #algorithm #problem #quantum

A quasipolynomial-time algorithm for the quantum separability problem (FGSLB, MC, JY), pp. 343–352.

STOC-2011-RegevK #communication #quantum

Quantum one-way communication can be exponentially stronger than classical communication (OR, BK), pp. 31–40.

STOC-2011-Sherstov #communication #complexity #quantum #query #theorem

Strong direct product theorems for quantum communication and query complexity (AAS), pp. 41–50.

ICALP-v1-2011-AaronsonD #quantum

Advice Coins for Classical and Quantum Computation (SA, AD), pp. 61–72.

ICALP-v1-2011-ChaillouxKR #complexity #quantum

Quantum Commitments from Complexity Assumptions (AC, IK, BR), pp. 73–85.

ICALP-v1-2011-HarrowMS #quantum #reduction

Limitations on Quantum Dimensionality Reduction (AWH, AM, AJS), pp. 86–97.

ICALP-v1-2011-Zhang #bound #communication #complexity #on the #power of #quantum

On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity (SZ), pp. 49–60.

ECIR-2011-BuccioMS #framework #predict #towards #using

Towards Predicting Relevance Using a Quantum-Like Framework (EDB, MM, DS), pp. 755–758.

ECIR-2011-FrommholzPLR #framework #information retrieval #query

Processing Queries in Session in a Quantum-Inspired IR Framework (IF, BP, ML, KvR), pp. 751–754.

ECIR-2011-ZellhoferFSLR #information retrieval #principle #towards

Towards Quantum-Based DB+IR Processing Based on the Principle of Polyrepresentation (DZ, IF, IS, ML, KvR), pp. 729–732.

ECIR-2011-ZhaoZSH #approach #metric #novel #quantum #ranking

A Novel Re-ranking Approach Inspired by Quantum Measurement (XZ, PZ, DS, YH), pp. 721–724.

POPL-2011-FengDY #bisimulation #process #quantum

Bisimulation for quantum processes (YF, RD, MY), pp. 523–534.

LICS-2011-HasuoH #geometry #higher-order #interactive #quantum #semantics

Semantics of Higher-Order Quantum Computation via Geometry of Interaction (IH, NH), pp. 237–246.

LICS-2011-HerrmannZ #complexity #quantum #satisfiability

Computational Complexity of Quantum Satisfiability (CH, MZ), pp. 175–184.

DATE-2010-MehdipourHKIKMAF #quantum #scalability

Mapping scientific applications on a large-scale data-path accelerator implemented by single-flux quantum (SFQ) circuits (FM, HH, HK, KI, IK, KM, HA, AF), pp. 993–996.

STOC-2010-AaronsonD #quantum

A full characterization of quantum advice (SA, AD), pp. 131–140.

STOC-2010-AmbainisKS #quantum

A quantum lovász local lemma (AA, JK, OS), pp. 151–160.

STOC-2010-DeV #quantum

Near-optimal extractors against quantum storage (AD, TV), pp. 161–170.

ICALP-v1-2010-KroviMOR #detection #quantum

Finding Is as Easy as Detecting for Quantum Walks (HK, FM, MO, JR), pp. 540–551.

ICALP-v2-2010-CoeckeK #composition #multi #quantum

The Compositional Structure of Multipartite Quantum Entanglement (BC, AK), pp. 297–308.

ICALP-v2-2010-DuncanP #quantum

Rewriting Measurement-Based Quantum Computations with Generalised Flow (RD, SP), pp. 285–296.

LATA-2010-ArrighiG #automaton #quantum

A Simple n-Dimensional Intrinsically Universal Quantum Cellular Automaton (PA, JG), pp. 70–81.

LATA-2010-Cruz-SantosM #on the #quantum #reduction #satisfiability

On the Hamiltonian Operators for Adiabatic Quantum Reduction of SAT (WCS, GML), pp. 239–248.

SFM-2010-BroadbentFK #quantum

Measurement-Based and Universal Blind Quantum Computation (AB, JF, EK), pp. 43–86.

CIKM-2010-PiwowarskiFLR #information retrieval #quantum #what

What can quantum theory bring to information retrieval (BP, IF, ML, KvR), pp. 59–68.

ECIR-2010-ZucconA #documentation #probability #quantum #rank #ranking #using

Using the Quantum Probability Ranking Principle to Rank Interdependent Documents (GZ, LA), pp. 357–369.

ICPR-2010-ZhouCW #classification #network #quantum

Deep Quantum Networks for Classification (SZ, QC, XW), pp. 2885–2888.

SAC-2010-AraujoOS #hybrid #quantum

Hybrid evolutionary quantum inspired method to adjust time phase distortions in financial time series (RdAA, ALIdO, SCBS), pp. 1153–1154.

CSL-2010-CoeckeP #category theory #quantum

Environment and Classical Channels in Categorical Quantum Mechanics (BC, SP), pp. 230–244.

QoSA-2009-LiKWHGGJMMNNW #adaptation #composition #quantum

Adaptive Application Composition in Quantum Chemistry (LL, JPK, MSW, KAH, AG, MSG, CLJ, LCM, HM, HN, BN, TLW), pp. 194–211.

ASE-2009-Hall #algorithm #quantum #re-engineering

A Quantum Algorithm for Software Engineering Search (RJH), pp. 40–51.

STOC-2009-AharonovALV #detection #quantum

The detectability lemma and quantum gap amplification (DA, IA, ZL, UVV), pp. 417–426.

STOC-2009-CleveGMSY #algorithm #performance #quantum #query #simulation

Efficient discrete-time simulations of continuous-time quantum query algorithms (RC, DG, MM, RDS, DLYM), pp. 409–416.

STOC-2009-Liu #algorithm #quantum #using

Quantum algorithms using the curvelet transform (YKL), pp. 391–400.

STOC-2009-Ta-Shma #quantum

Short seed extractors against quantum storage (ATS), pp. 401–408.

CIAA-2009-FreivaldsI #permutation #quantum #query

Quantum Queries on Permutations with a Promise (RF, KI), pp. 208–216.

ICALP-v1-2009-KobayashiGNR #communication #network #quantum

General Scheme for Perfect Quantum Network Coding with Free Classical Communication (HK, FLG, HN, MR), pp. 622–633.

ICEIS-HCI-2009-TaggB #how #information management #quantum #question

How Can a Quantum Improvement in Personal and Group Information Management be Realized? (RT, TB), pp. 136–141.

QAPL-2009-TafliovichH #communication #programming #quantum

Programming with Quantum Communication (AT, ECRH), pp. 99–118.

SAC-2009-VomelTM #quantum

Bulk based preconditioning for quantum dot computations (CV, ST, OM), pp. 961–965.

SAS-2008-Perdrix #abstract interpretation #analysis #quantum

Quantum Entanglement Analysis Based on Abstract Interpretation (SP), pp. 270–282.

STOC-2008-Gavinsky #interactive #quantum

Classical interaction cannot replace a quantum message (DG), pp. 95–102.

STOC-2008-ReichardtS #algorithm #quantum

Span-program-based quantum algorithm for evaluating formulas (BR, RS), pp. 103–112.

STOC-2008-Sherstov #bound #communication #matrix #quantum

The pattern matrix method for lower bounds on quantum communication (AAS), pp. 85–94.

DLT-2008-Hirvensalo #aspect-oriented #automaton #finite #quantum

Various Aspects of Finite Quantum Automata (MH), pp. 21–33.

ICALP-A-2008-ChildsL #bound #order #quantum

Optimal Quantum Adversary Lower Bounds for Ordered Search (AMC, TL), pp. 869–880.

ICALP-A-2008-EldarR #quantum #satisfiability

Quantum SAT for a Qutrit-Cinquit Pair Is QMA1-Complete (LE, OR), pp. 881–892.

ICALP-A-2008-HallgrenH #quantum

Superpolynomial Speedups Based on Almost Any Quantum Circuit (SH, AWH), pp. 782–795.

ICALP-A-2008-KempeRUW #bound #fault tolerance #quantum

Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing (JK, OR, FU, RdW), pp. 845–856.

ICALP-A-2008-RegevS #quantum

Impossibility of a Quantum Speed-Up with a Faulty Oracle (OR, LS), pp. 773–781.

ICALP-B-2008-CoeckeD #quantum

Interacting Quantum Observables (BC, RD), pp. 298–310.

ICALP-C-2008-HallgrenKSZ #protocol #quantum #verification

Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks (SH, AK, PS, SZ), pp. 592–603.

ICALP-C-2008-WehnerW #bound #composition #security

Composable Security in the Bounded-Quantum-Storage Model (SW, JW), pp. 604–615.

LATA-2008-ArrighiNW #automaton #bound #finite #quantum

One-Dimensional Quantum Cellular Automata over Finite, Unbounded Configurations (PA, VN, RFW), pp. 64–75.

LATA-2008-Mercer #automaton #bound #finite #quantum

Lower Bounds for Generalized Quantum Finite Automata (MM), pp. 373–384.

ICPR-2008-EmmsHW #graph #quantum #using

Graph drawing using quantum commute time (DE, ERH, RCW), pp. 1–4.

CAV-2008-GayNP #model checking #named #quantum

QMC: A Model Checker for Quantum Systems (SJG, RN, NP), pp. 543–547.

DAC-2007-BogdanM #behaviour

Quantum-Like Effects in Network-on-Chip Buffers Behavior (PB, RM), pp. 266–267.

DAC-2007-MaslovFM #empirical #interactive #optimisation #physics #quantum

Quantum Circuit Placement: Optimizing Qubit-to-qubit Interactions through Mapping Quantum Circuits into a Physical Experiment (DM, SMF, MM), pp. 962–965.

STOC-2007-GavinskyKKRW #communication #complexity #encryption #exponential #quantum

Exponential separations for one-way quantum communication complexity, with applications to cryptography (DG, JK, IK, RR, RdW), pp. 516–525.

STOC-2007-GutoskiW #game studies #quantum #towards

Toward a general theory of quantum games (GG, JW), pp. 565–574.

STOC-2007-MagniezNRS #quantum

Search via quantum walk (FM, AN, JR, MS), pp. 575–584.

STOC-2007-MooreRS #algorithm #graph #morphism #on the #quantum

On the impossibility of a quantum sieve algorithm for graph isomorphism (CM, AR, PS), pp. 536–545.

DLT-2007-BelovsRS #automaton #finite #multi #quantum

Multi-letter Reversible and Quantum Finite Automata (AB, AR, JS), pp. 60–71.

ICALP-2007-IwamaNRY #bound #communication #complexity #quantum

Unbounded-Error One-Way Classical and Quantum Communication Complexity (KI, HN, RR, SY), pp. 110–121.

ICALP-2007-MontanaroW #bound #communication #complexity #quantum

A Lower Bound on Entanglement-Assisted Quantum Communication Complexity (AM, AJW), pp. 122–133.

LATA-2007-AblayevG #branch #complexity #quantum #simulation #source code

Classical Simulation Complexity of Quantum Branching Programs (FMA, AG), pp. 49–56.

ICML-2007-AimeurBG #algorithm #clustering #quantum

Quantum clustering algorithms (EA, GB, SG), pp. 1–8.

DATE-2006-AbdollahiP #analysis #diagrams #quantum #synthesis #using

Analysis and synthesis of quantum circuits by using quantum decision diagrams (AA, MP), pp. 317–322.

DATE-2006-GuptaJL #automaton #generative #quantum #testing

Test generation for combinational quantum cellular automata (QCA) circuits (PG, NKJ, LL), pp. 311–316.

STOC-2006-AharonovJL #algorithm #approximate #polynomial #quantum

A polynomial quantum algorithm for approximating the Jones polynomial (DA, VJ, ZL), pp. 427–436.

STOC-2006-AmbainisSW #bound #quantum #theorem #trade-off

A new quantum lower bound method, : with applications to direct product theorems and time-space tradeoffs (AA, RS, RdW), pp. 618–633.

STOC-2006-GavinskyKRW #bound #communication #complexity #exponential #identification #quantum

Bounded-error quantum state identification and exponential separations in communication complexity (DG, JK, OR, RdW), pp. 594–603.

STOC-2006-HallgrenMRRS #graph #morphism #quantum

Limitations of quantum coset states for graph isomorphism (SH, CM, MR, AR, PS), pp. 604–617.

STOC-2006-Watrous #quantum

Zero-knowledge against quantum attacks (JW), pp. 296–305.

STOC-2006-Zhang #bound #quantum #random

New upper and lower bounds for randomized and quantum local search (SZ), pp. 634–643.

CIAA-2006-YangXSP #hybrid #quantum #synthesis

Universality of Hybrid Quantum Gates and Synthesis Without Ancilla Qudits (GY, FX, XS, MAP), pp. 279–280.

ICALP-v1-2006-MagniezMMO #quantum #self

Self-testing of Quantum Circuits (FM, DM, MM, HO), pp. 72–83.

ICALP-v1-2006-Reichardt #fault tolerance #quantum

Fault-Tolerance Threshold for a Distance-Three Quantum Code (BR), pp. 50–61.

ICALP-v1-2006-Wolf #bound #matrix #quantum

Lower Bounds on Matrix Rigidity Via a Quantum Argument (RdW), pp. 62–71.

ICALP-v2-2006-DanosKP #quantum

The One Way to Quantum Computation (VD, EK, PP), pp. 13–21.

ICALP-v2-2006-DodisR #on the #quantum #using

On the Impossibility of Extracting Classical Randomness Using a Quantum Computer (YD, RR), pp. 204–215.

ICALP-v2-2006-KawachiY #quantum

Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding (AK, TY), pp. 216–227.

ICPR-v3-2006-EmmsHW #graph #quantum #using

Graph Matching using Interference of Coined Quantum Walks (DE, ERH, RCW), pp. 133–136.

SIGIR-2006-Rijsbergen #quantum

Quantum haystacks (CJvR), pp. 1–2.

SAC-2006-DantsinWK #algorithm #constraints #problem #quantum #towards

Quantum versions of k-CSP algorithms: a first step towards quantum algorithms for interval-related constraint satisfaction problems (ED, AW, VK), pp. 1640–1644.

ASPLOS-2006-SchuchmanV #architecture #program transformation #quantum

A program transformation and architecture support for quantum uncomputation (ES, TNV), pp. 252–263.

DATE-2005-MaslovYMD #quantum #using

Quantum Circuit Simplification Using Templates (DM, CY, DMM, GWD), pp. 1208–1213.

DATE-2005-YangHSP #logic #multi #quantum #synthesis #using

Exact Synthesis of 3-Qubit Quantum Circuits from Non-Binary Quantum Gates Using Multiple-Valued Logic and Group Theory (GY, WNNH, XS, MAP), pp. 434–435.

STOC-2005-Ben-OrH #performance #quantum

Fast quantum byzantine agreement (MBO, AH), pp. 481–485.

STOC-2005-Hallgren #algorithm #performance #quantum

Fast quantum algorithms for computing the unit group and class group of a number field (SH), pp. 468–474.

STOC-2005-SchmidtV #algorithm #polynomial #quantum

Polynomial time quantum algorithm for the computation of the unit group of a number field (AS, UV), pp. 475–480.

STOC-2005-Shi #communication #complexity #metric #quantum

Tensor norms and the classical communication complexity of nonlocal quantum measurement (YS), pp. 460–467.

CIAA-2005-Freivalds #automaton #finite #quantum

Languages Recognizable by Quantum Finite Automata (RF), pp. 1–14.

DLT-2005-AblayevG #automaton #complexity #quantum

Complexity of Quantum Uniform and Nonuniform Automata (FMA, AG), pp. 78–87.

ICALP-2005-KoiranNP #bound #complexity #problem #quantum #query

A Quantum Lower Bound for the Query Complexity of Simon’s Problem (PK, VN, NP), pp. 1287–1298.

ICALP-2005-MagniezN #commutative #complexity #quantum #testing

Quantum Complexity of Testing Group Commutativity (FM, AN), pp. 1312–1324.

ICALP-2005-SpalekS #quantum

All Quantum Adversary Methods Are Equivalent (RS, MS), pp. 1299–1311.

POPL-2005-GayN #communication #process #quantum

Communicating quantum processes (SJG, RN), pp. 145–157.

LICS-2005-AltenkirchG #functional #programming language #quantum

A Functional Quantum Programming Language (TA, JG), pp. 249–258.

TLCA-2005-SelingerV #quantum #λ-calculus

A λ Calculus for Quantum Computation with Classical Control (PS, BV), pp. 354–368.

DAC-2004-AntonelliCDHKKMN #automaton #clustering #modelling #problem

Quantum-Dot Cellular Automata (QCA) circuit partitioning: problem modeling and solutions (DAA, DZC, TJD, XSH, ABK, PMK, RCM, MTN), pp. 363–368.

DAC-2004-HungSYYP #analysis #logic #quantum #reachability #synthesis

Quantum logic synthesis by symbolic reachability analysis (WNNH, XS, GY, JY, MAP), pp. 838–841.

DATE-v2-2004-ShendeMB #communication #quantum

Smaller Two-Qubit Circuits for Quantum Communication and Computation (VVS, ILM, SSB), pp. 980–987.

DATE-v2-2004-TahooriL #automaton #design #quantum #testing

Testing of Quantum Dot Cellular Automata Based Designs (MBT, FL), pp. 1408–1409.

DATE-v2-2004-ViamontesMH #quantum #simulation

High-Performance QuIDD-Based Simulation of Quantum Circuits (GFV, ILM, JPH), pp. 1354–1355.

STOC-2004-Aaronson #multi #quantum

Multilinear formulas and skepticism of quantum computing (SA), pp. 118–127.

STOC-2004-Aaronson04a #bound #quantum

Lower bounds for local search by quantum arguments (SA), pp. 465–474.

STOC-2004-Ambainis #algorithm #quantum

Quantum algorithms a decade after shor (AA), p. 111.

STOC-2004-Bar-YossefJK #communication #complexity #exponential #quantum

Exponential separation of quantum and classical one-way communication complexity (ZBY, TSJ, IK), pp. 128–137.

STOC-2004-Reichardt #algorithm #optimisation #quantum

The quantum adiabatic optimization algorithm and local minima (BR), pp. 502–510.

STOC-2004-SanthaS #quantum #query

Quantum and classical query complexities of local search are polynomially related (MS, MS), pp. 494–501.

STOC-2004-Yao #graph #problem #quantum #sorting

Graph entropy and quantum sorting problems (ACCY), pp. 112–117.

FLOPS-2004-Selinger #bibliography #programming language #quantum

A Brief Survey of Quantum Programming Languages (PS), pp. 1–6.

CIAA-2004-NishimuraY #automaton #finite #interactive #proving #quantum

An Application of Quantum Finite Automata to Interactive Proof Systems (HN, TY), pp. 225–236.

ICALP-2004-DurrHHM #complexity #graph #problem #quantum #query

Quantum Query Complexity of Some Graph Problems (CD, MH, PH, MM), pp. 481–493.

ICALP-2004-Jeandel #quantum

Universality in Quantum Computation (EJ), pp. 793–804.

ICALP-2004-Midrijanis #bound #polynomial #problem #quantum #query #set #similarity

A Polynomial Quantum Query Lower Bound for the Set Equality Problem (GM), pp. 996–1005.

LICS-2004-Abramsky #quantum

High-Level Methods for Quantum Computation and Information (SA), pp. 410–414.

LICS-2004-AbramskyC #category theory #protocol #quantum #semantics

A Categorical Semantics of Quantum Protocols (SA, BC), pp. 415–425.

DAC-2003-Bernstein #automaton

Quantum-dot cellular automata: computing by field polarization (GHB), pp. 268–273.

DAC-2003-Hayes #concept #named #quantum #tutorial

Tutorial: basic concepts in quantum circuits (JPH), p. 893.

DAC-2003-Travaglione #algorithm #design #implementation #quantum

Designing and implementing small quantum circuits and algorithms (BT), pp. 894–899.

STOC-2003-AharonovT #generative #quantum #statistics

Adiabatic quantum state generation and statistical zero knowledge (DA, ATS), pp. 20–29.

STOC-2003-ChildsCDFGS #algorithm #exponential #quantum

Exponential algorithmic speedup by a quantum walk (AMC, RC, ED, EF, SG, DAS), pp. 59–68.

STOC-2003-FriedlIMSS #quantum

Hidden translation and orbit coset in quantum computing (KF, GI, FM, MS, PS), pp. 1–9.

STOC-2003-Gurvits #complexity #problem #quantum

Classical deterministic complexity of Edmonds’ Problem and quantum entanglement (LG), pp. 10–19.

STOC-2003-KerenidisW #bound #exponential #quantum

Exponential lower bound for 2-query locally decodable codes via a quantum argument (IK, RdW), pp. 106–115.

STOC-2003-Klauck #quantum #sorting #trade-off

Quantum time-space tradeoffs for sorting (HK), pp. 69–76.

STOC-2003-Ya #on the #power of #quantum

On the power of quantum fingerprinting (ACCY), pp. 77–81.

DLT-2003-BertoniMP #automaton #quantum

Quantum Computing: 1-Way Quantum Automata (AB, CM, BP), pp. 1–20.

ICALP-2003-HoyerMW #bound #quantum

Quantum Search on Bounded-Error Inputs (PH, MM, RdW), pp. 291–299.

ICFP-2003-Knight #functional #quantum

Conservation of information: applications in functional, reversible, and quantum computing (TKJ), p. 1.

CSL-2003-MeydenP #logic #probability #quantum

A Logic for Probability in Quantum Systems (RvdM, MP), pp. 427–440.

DAC-2002-IwamaKY #design #quantum

Transformation rules for designing CNOT-based quantum circuits (KI, YK, SY), pp. 419–424.

STOC-2002-Aaronson #bound #problem #quantum

Quantum lower bound for the collision problem (SA), pp. 635–642.

STOC-2002-CrepeauGS #multi #quantum

Secure multi-party quantum computation (CC, DG, AS), pp. 643–652.

STOC-2002-Hallgren #algorithm #equation #polynomial #problem #quantum

Polynomial-time quantum algorithms for Pell’s equation and the principal ideal problem (SH), pp. 653–658.

STOC-2002-NayakS #communication #on the #quantum

On communication over an entanglement-assisted quantum channel (AN, JS), pp. 698–704.

DLT-2002-Kitagawa #quantum

Experimental Quantum Computation with Molecules (MK), pp. 21–27.

ICALP-2002-AblayevMP #bound #branch #probability #quantum #source code

Quantum and Stochastic Branching Programs of Bounded Width (FMA, CM, CP), pp. 343–354.

STOC-2001-Ambainis #bound #protocol #quantum

A new protocol and lower bounds for quantum coin flipping (AA), pp. 134–142.

STOC-2001-AmbainisBNVW #quantum

One-dimensional quantum walks (AA, EB, AN, AV, JW), pp. 37–49.

STOC-2001-AmbainisKV #graph #quantum

Quantum walks on graphs (DA, AA, JK, UVV), pp. 50–59.

STOC-2001-GrigniSVV #algorithm #problem #quantum

Quantum mechanical algorithms for the nonabelian hidden subgroup problem (MG, LJS, MV, UVV), pp. 68–74.

STOC-2001-KlauckNTZ #communication #complexity #interactive #quantum #set

Interaction in quantum communication and the complexity of set disjointness (HK, AN, ATS, DZ), pp. 124–133.

STOC-2001-Valiant #polynomial #quantum

Quantum computers that can be simulated classically in polynomial time (LGV), pp. 114–123.

STOC-2001-Watrous #algorithm #quantum

Quantum algorithms for solvable groups (JW), pp. 60–67.

DLT-2001-CaludeC #automaton #named #nondeterminism #quantum

Automata: From Uncertainty to Quantum (CC, EC), pp. 1–14.

ICALP-2001-HoyerNS #order #quantum #sorting

Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness (PH, JN, YS), pp. 346–357.

ICALP-2001-SenV #bound #quantum

Lower Bounds in the Quantum Cell Probe Model (PS, SV), pp. 358–369.

ICALP-2001-Servedio #learning #quantum

Separating Quantum and Classical Learning (RAS), pp. 1065–1080.

DAC-2000-NiemierKK #design #novel #quantum #tool support

A design of and design tools for a novel quantum dot based microprocessor (MTN, MJK, PMK), pp. 227–232.

STOC-2000-AharonovTVY #quantum

Quantum bit escrow (DA, ATS, UVV, ACCY), pp. 705–714.

STOC-2000-Ambainis #bound #quantum

Quantum lower bounds by quantum arguments (AA), pp. 636–643.

STOC-2000-BihamBBMR #proving #quantum #security

A proof of the security of quantum key distribution (extended abstract) (EB, MB, POB, TM, VPR), pp. 715–724.

STOC-2000-DamMMS #fault tolerance #quantum #self #set

Self-testing of universal and fault-tolerant sets of quantum gates (WvD, FM, MM, MS), pp. 688–696.

STOC-2000-Grover #agile #quantum

Rapid sampling though quantum computing (LKG), pp. 618–626.

STOC-2000-HallgrenRT #quantum #re-engineering #using

Normal subgroup reconstruction and quantum computation using group representations (SH, AR, ATS), pp. 627–635.

STOC-2000-KitaevW #exponential #interactive #parallel #proving #quantum #simulation

Parallelization, amplification, and exponential time simulation of quantum interactive proof systems (AK, JW), pp. 608–617.

STOC-2000-Klauck #communication #on the #probability #protocol #quantum

On quantum and probabilistic communication: Las Vegas and one-way protocols (HK), pp. 644–651.

WLC-2000-GruskaV #automaton #finite #quantum

Quantum Finite Automata (JG, RV), pp. 192–211.

STOC-1999-AmanoI #automaton #finite #quantum

Undecidability on Quantum Finite Automata (MA, KI), pp. 368–375.

STOC-1999-AmbainisNTV #automaton #bound #quantum

Dense Quantum Coding and a Lower Bound for 1-Way Quantum Automata (AA, AN, ATS, UVV), pp. 376–383.

STOC-1999-HalesH #fourier #quantum

Quantum Fourier Sampling Simplified (LH, SH), pp. 330–338.

STOC-1999-NayakW #approximate #complexity #quantum #query #statistics

The Quantum Query Complexity of Approximating the Median and Related Statistics (AN, FW), pp. 384–393.

STOC-1999-Raz #communication #complexity #exponential #quantum

Exponential Separation of Quantum and Classical Communication Complexity (RR), pp. 358–367.

STOC-1999-SchulmanV99a #quantum #scalability

Molecular Scale Heat Engines and Scalable Quantum Computation (LJS, UVV), pp. 322–329.

STOC-1998-AharonovKN #quantum

Quantum Circuits with Mixed States (DA, AK, NN), pp. 20–30.

STOC-1998-BuhrmanCW #communication #quantum

Quantum vs. Classical Communication and Computation (HB, RC, AW), pp. 63–68.

STOC-1998-Grover #algorithm #framework #performance #quantum

A Framework for Fast Quantum Mechanical Algorithms (LKG), pp. 53–62.

ICALP-1998-Brassard #information management #quantum

New Horizons in Quantum Information Processing (GB), pp. 769–771.

ICALP-1998-BrassardHT #quantum

Quantum Counting (GB, PH, AT), pp. 820–831.

STOC-1997-AharonovB #constant #fault tolerance #quantum

Fault-Tolerant Quantum Computation With Constant Error (DA, MBO), pp. 176–188.

STOC-1997-Beals #fourier #quantum #symmetry

Quantum Computation of Fourier Transforms over Symmetric Groups (RB), pp. 48–53.

DLT-1997-Hirvensalo #quantum

The Reversibility in Quantum Computation Theory (MH), pp. 203–210.

STOC-1996-Grover #algorithm #database #performance #quantum

A Fast Quantum Mechanical Algorithm for Database Search (LKG), pp. 212–219.

STOC-1995-Yao #metric #protocol #quantum #security

Security of quantum protocols against coherent measurements (ACCY), pp. 67–75.

ICLP-1994-Zapatrin #logic programming #metric #quantum

Logic Programming as Quantum Measurement (RRZ), p. 747.

STOC-1993-BernsteinV #complexity #quantum

Quantum complexity theory (EB, UVV), pp. 11–20.