BibSLEIGH — quantum tag

quantum

quantum

Tag #quantum

284 papers:

POPL-2020-BartheHYYZ #proving #relational #source code: Relational proofs for quantum programs (GB, JH, MY, NY, LZ), p. 29.
POPL-2020-ClairambaultV #abstraction #λ-calculus: Full abstraction for the quantum lambda-calculus (PC, MdV), p. 28.
ASPLOS-2020-LiD0 #architecture #design #performance #towards: Towards Efficient Superconducting Quantum Processor Architecture Design (GL, YD, YX0), pp. 1031–1045.
ASPLOS-2020-LiuBZ #runtime: Quantum Circuits for Dynamic Runtime Assertions in Quantum Computation (JL, GTB, HZ), pp. 1017–1030.
ASPLOS-2020-MuraliMMJ: Software Mitigation of Crosstalk on Noisy Intermediate-Scale Quantum Computers (PM, DCM, MM, AJA), pp. 1001–1016.
ICML-2019-LiCW #algorithm #classification #kernel #linear #sublinear: Sublinear quantum algorithms for training linear and kernel-based classifiers (TL, SC, XW), pp. 3815–3824.
KDD-2019-FawazKPSM #network: Training and Meta-Training Binary Neural Networks with Quantum Computing (AF, PK, SP, SS, PM), pp. 1674–1681.
OOPSLA-2019-SiraichiSCP #morphism: Qubit allocation as a combination of subgraph isomorphism and token swapping (MYS, VFdS, CC, FMQP), p. 29.
PLDI-2019-ZhouYY #hoare #logic: An applied quantum Hoare logic (LZ, NY, MY), pp. 1149–1162.
POPL-2019-ClairambaultVW #game studies #programming #semantics: Game semantics for quantum programming (PC, MdV, GW), p. 29.
POPL-2019-HungHZYHW #analysis #robust #source code: Quantitative robustness analysis of quantum programs (SHH, KH, SZ, MY, MH0, XW), p. 29.
POPL-2019-Unruh #hoare #logic #relational: Quantum relational Hoare logic (DU), p. 31.
ASPLOS-2019-LiDX #problem: Tackling the Qubit Mapping Problem for NISQ-Era Quantum Devices (GL, YD, YX0), pp. 1001–1014.
ASPLOS-2019-MuraliBJCM #adaptation #compilation: Noise-Adaptive Compiler Mappings for Noisy Intermediate-Scale Quantum Computers (PM, JMB, AJA, FTC, MM), pp. 1015–1029.
ASPLOS-2019-Pakin: Targeting Classical Code to a Quantum Annealer (SP), pp. 529–543.
ASPLOS-2019-ShiLGRSHC #compilation: Optimized Compilation of Aggregated Instructions for Realistic Quantum Computers (YS, NL, PG, ZR, DIS, HH, FTC), pp. 1031–1044.
ASPLOS-2019-Svore #named: Keynote: Developing our Quantum Future (KMS), p. 2.
ASPLOS-2019-TannuQ #policy #variability: Not All Qubits Are Created Equal: A Case for Variability-Aware Policies for NISQ-Era Quantum Computers (SST, MKQ), pp. 987–999.
CAV-2019-LiuZWYLLYZ #algorithm #hoare #logic #using #verification: Formal Verification of Quantum Algorithms Using Quantum Hoare Logic (JL, BZ, SW, SY, TL, YL, MY, NZ), pp. 187–207.
FSCD-2018-HadzihasanovicF #axiom #diagrams: A Diagrammatic Axiomatisation of Fermionic Quantum Circuits (AH, GdF, KFN), p. 20.
FSCD-2018-Selinger #challenge #programming language: Challenges in Quantum Programming Languages (Invited Talk) (PS), p. 2.
CHI-PLAY-2018-WeiszAA #education #game studies #named: Entanglion: A Board Game for Teaching the Principles of Quantum Computing (JDW, MA, ZA), pp. 523–534.
CIKM-2018-0002SZW0 #approach #modelling: A Quantum Many-body Wave Function Inspired Language Modeling Approach (PZ0, ZS, LZ, BW, DS0), pp. 1303–1312.
ECIR-2018-WangWH0 #metric #modelling: Modeling Relevance Judgement Inspired by Quantum Weak Measurement (PW, TW, YH, DS0), pp. 424–436.
PLATEAU-2018-HuangM #algorithm #named #source code #towards: QDB: From Quantum Algorithms Towards Correct Quantum Programs (YH0, MM), p. 14.
POPL-2018-LiY #algorithm #analysis #problem #source code #termination: Algorithmic analysis of termination problems for quantum programs (YL, MY), p. 29.
ASPLOS-2018-Chong #algorithm #architecture: Quantum Computing is Getting Real: Architecture, PL, and OS Roles in Closing the Gap between Quantum Algorithms and Machines (FTC), p. 285.
CC-2018-Heim #compilation #design: Compiler and language design for quantum computing (keynote) (BH), p. 2.
CGO-2018-SiraichiSCP: Qubit allocation (MYS, VFdS, SC, FMQP), pp. 113–125.
ICML-2017-GilmerSRVD #message passing: Neural Message Passing for Quantum Chemistry (JG, SSS, PFR, OV, GED), pp. 1263–1272.
POPL-2017-LagoFVY #geometry #parallel #probability: The geometry of parallelism: classical, probabilistic, and quantum effects (UDL, CF, BV, AY), pp. 833–845.
POPL-2017-Paykin0Z #named: QWIRE: a core language for quantum circuits (JP, RR0, SZ), pp. 846–858.
POPL-2017-YingYW #generative #invariant #source code: Invariants of quantum programs: characterisations and generation (MY, SY, XW), pp. 818–832.
CIAA-2016-BelovsMY #approach: Looking for Pairs that Hard to Separate: A Quantum Approach (AB, JAM, AY), pp. 213–223.
DiGRA-FDG-2016-Zakowski #game studies #physics: Environmental Storytelling, Ideologies and Quantum Physics: Narrative Space And The BioShock Games (SZ).
ICPR-2016-MinelloTH #evolution #network: Quantum thermodynamics of time evolving networks (GM, AT, ERH), pp. 1536–1541.
CIAA-2015-NakanishiY #automaton #problem: Classical and Quantum Counter Automata on Promise Problems (MN, AY), pp. 224–237.
DLT-2015-GainutdinovaY #automaton #probability #problem: Unary Probabilistic and Quantum Automata on Promise Problems (AG, AY), pp. 252–263.
DLT-2015-Yamakami #bound #complexity: Complexity Bounds of Constant-Space Quantum Computation — (TY), pp. 426–438.
FM-2015-FengHTZ #model checking #named #protocol #source code: QPMC: A Model Checker for Quantum Programs and Protocols (YF, EMH, AT, LZ), pp. 265–272.
POPL-2015-Staton #algebra #programming language: Algebraic Effects, Linearity, and Quantum Programming Languages (SS), pp. 395–406.
ASPLOS-2015-HeckeyPJHKBFCM #communication #compilation #parallel: Compiler Management of Communication and Parallelism for Quantum Computation (JH, SP, AJ, AH, DK, KRB, DF, FTC, MM), pp. 445–456.
DAC-2015-PalerD #fault tolerance: An introduction into fault-tolerant quantum computing (AP, SJD), p. 6.
DAC-2015-PolianF #architecture #automation #challenge #design #scalability: Design automation challenges for scalable quantum architectures (IP, AGF), p. 6.
DATE-2015-AhsanK #architecture #optimisation #using: Optimization of quantum computer architecture using a resource-performance simulator (MA, JK), pp. 1108–1113.
STOC-2015-AaronsonA #named #problem: Forrelation: A Problem that Optimally Separates Quantum from Classical Computing (SA, AA), pp. 307–316.
STOC-2015-BaconFHS: Sparse Quantum Codes from Quantum Circuits (DB, STF, AWH, JS), pp. 327–334.
STOC-2015-ODonnellW #testing: Quantum Spectrum Testing (RO, JW), pp. 529–538.
STOC-2015-Touchette #complexity: Quantum Information Complexity (DT), pp. 317–326.
LICS-2015-Hadzihasanovic #axiom #diagrams: A Diagrammatic Axiomatisation for Qubit Entanglement (AH), pp. 573–584.
SAT-2015-DouglassKR #satisfiability: Constructing SAT Filters with a Quantum Annealer (AD, ADK, JR), pp. 104–120.
DLT-J-2013-BertoniCD14 #automaton #context-free grammar #decidability #on the #problem: 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: On the Power of One-Way Automata with Quantum and Classical States (MPB, CM, BP), pp. 84–97.
CIAA-2014-RashidY #automaton: Implications of Quantum Automata for Contextuality (JR, AY), pp. 318–331.
DLT-2014-YakaryilmazSD #verification: Debates with Small Transparent Quantum Verifiers (AY, ACCS, HGD), pp. 327–338.
DUXU-DI-2014-NeidlingerJ: Sound Bending — Talking Bodies Quantum Sound Suits (KN, WJ), pp. 598–605.
ICPR-2014-AytekinKG #automation #segmentation: Automatic Object Segmentation by Quantum Cuts (ÇA, SK, MG), pp. 112–117.
ICPR-2014-LuZXGW #approximate #morphism: Approximate Maximum Common Sub-graph Isomorphism Based on Discrete-Time Quantum Walk (KL, YZ, KX, YG, RCW), pp. 1413–1418.
POPL-2014-PaganiSV #higher-order #semantics: Applying quantitative semantics to higher-order quantum computing (MP, PS, BV), pp. 647–658.
PPDP-2014-Karczmarczuk #concept #declarative #on the: On the Declarative Structure of Quantum Concepts: States and Observables (JK), pp. 105–110.
SAC-2014-AvilaMRPY #distributed #simulation: GPU-aware distributed quantum simulation (AA, AM, RR, MLP, ACY), pp. 860–865.
DATE-2014-PalerDNP #fault tolerance: Software-based Pauli tracking in fault-tolerant quantum circuits (AP, SJD, KN, IP), pp. 1–4.
ESOP-2014-YoshimizuHFL #higher-order #metric #proving: Measurements in Proof Nets as Higher-Order Quantum Circuits (AY, IH, CF, UDL), pp. 371–391.
STOC-2014-EisentragerHK0 #algorithm: 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 #robust #using: Robust protocols for securely expanding randomness and distributing keys using untrusted quantum devices (CAM, YS), pp. 417–426.
TACAS-2014-Ardeshir-LarijaniGN #concurrent #equivalence #protocol #verification: Verification of Concurrent Quantum Protocols by Equivalence Checking (EAL, SJG, RN), pp. 500–514.
DLT-J-2012-IwamaN13 #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 Finite Automata and Linear Context-Free Languages: A Decidable Problem (AB, CC, FD), pp. 82–93.
ICALP-v1-2013-BelovsCJKM #3d: Time-Efficient Quantum Walks for 3-Distinctness (AB, AMC, SJ, RK, FM), pp. 105–122.
SFM-2013-Pachos: Topological Quantum Computation (JKP), pp. 150–179.
CIKM-2013-SordoniHN #information retrieval #interactive #modelling #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: Modeling term dependencies with quantum language models for IR (AS, JYN, YB), pp. 653–662.
PLDI-2013-GreenLRSV #named #programming language #scalability: Quipper: a scalable quantum programming language (ASG, PLL, NJR, PS, BV), pp. 333–342.
DAC-2013-DoustiP #algorithm #estimation #latency #named: 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: Optimization of quantum circuits for interaction distance in linear nearest neighbor architectures (AS, MS, MP), p. 6.
STOC-2013-Ambainis #algorithm: Superlinear advantage for exact quantum algorithms (AA), pp. 891–900.
STOC-2013-BrandaoH #metric #theorem: Quantum de finetti theorems under local measurements with applications (FGSLB, AWH), pp. 861–870.
STOC-2013-BrandaoH13a #approximate: Product-state approximations to quantum ground states (FGSLB, AWH), pp. 871–880.
STOC-2013-Ta-Shma #matrix: Inverting well conditioned matrices in quantum logspace (ATS), pp. 881–890.
TACAS-2013-Ardeshir-LarijaniGN #equivalence #protocol: Equivalence Checking of Quantum Protocols (EAL, SJG, RN), pp. 478–492.
LICS-2013-Vicary #algorithm: Topological Structure of Quantum Algorithms (JV), pp. 93–102.
DLT-J-2011-ArrighiD12 #physics: The Physical Church-Turing Thesis and the Principles of Quantum Theory (PA, GD), pp. 1131–1146.
DLT-J-2011-SayY12 #automaton: Quantum Counter Automata (ACCS, AY), pp. 1099–1116.
DLT-J-2011-ZhengQL12 #automaton #finite: Some Languages Recognized by Two-Way Finite Automata with Quantum and Classical States (SZ, DQ, LL), pp. 1117–1130.
DLT-2012-Iwama #string: Recovering Strings in Oracles: Quantum and Classic (KI), p. 23.
ICALP-v1-2012-AmbainisBBKOSV #game studies: 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: Hardness of Approximation for Quantum Problems (SG, JK), pp. 387–398.
ICALP-v1-2012-JefferyKM #complexity #graph #matrix #multi #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 Adversary (Upper) Bound (SK), pp. 557–568.
ICALP-v1-2012-LaplanteLR #bound #detection: Classical and Quantum Partition Bound and Detector Inefficiency (SL, VL, JR), pp. 617–628.
LATA-2012-Dowek #automaton #formal method #physics: 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: One-Way Reversible and Quantum Finite Automata with Advice (TY), pp. 526–537.
ICML-2012-DenchevDVN #classification #optimisation #robust: Robust Classification with Adiabatic Quantum Optimization (VSD, ND, SVNV, HN), p. 131.
QAPL-2012-BelardinelliGL #automation #protocol #using #verification: Automated Verification of Quantum Protocols using MCMAS (FB, PG, AL), pp. 48–62.
DAC-2012-SasanianWM #using: Realizing reversible circuits using a new class of quantum gates (ZS, RW, DMM), pp. 36–41.
DATE-2012-DoustiP #latency: Minimizing the latency of quantum circuits during mapping to the ion-trap circuit fabric (MJD, MP), pp. 840–843.
PDP-2012-SpigaG #cpu #gpu #hybrid #library #migration #named: phiGEMM: A CPU-GPU Library for Porting Quantum ESPRESSO on Hybrid Systems (FS, IG), pp. 368–375.
STOC-2012-AaronsonC: Quantum money from hidden subspaces (SA, PC), pp. 41–60.
STOC-2012-VaziraniV #generative #random: Certifiable quantum dice: or, true random number generation secure against quantum adversaries (UVV, TV), pp. 61–76.
LICS-2012-CoeckeDKW #category theory: Strong Complementarity and Non-locality in Categorical Quantum Mechanics (BC, RD, AK, QW), pp. 245–254.
LICS-2012-Vicary #protocol #semantics: Higher Semantics of Quantum Protocols (JV), pp. 606–615.
SIGITE-2011-Costa: A solace in quantum (MAC), pp. 263–268.
ICALP-v1-2011-AaronsonD: Advice Coins for Classical and Quantum Computation (SA, AD), pp. 61–72.
ICALP-v1-2011-ChaillouxKR #complexity: Quantum Commitments from Complexity Assumptions (AC, IK, BR), pp. 73–85.
ICALP-v1-2011-HarrowMS #reduction: Limitations on Quantum Dimensionality Reduction (AWH, AM, AJS), pp. 86–97.
ICALP-v1-2011-Zhang #bound #communication #complexity #on the #power of: On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity (SZ), pp. 49–60.
ECIR-2011-ZhaoZSH #approach #metric #novel #ranking: A Novel Re-ranking Approach Inspired by Quantum Measurement (XZ, PZ, DS, YH), pp. 721–724.
POPL-2011-FengDY #bisimulation #process: Bisimulation for quantum processes (YF, RD, MY), pp. 523–534.
QAPL-2011-LeitnerFischerL #analysis #modelling #named #safety #uml: QuantUM: Quantitative Safety Analysis of UML Models (FLF, SL), pp. 16–30.
FoSSaCS-2011-Jacobs #algebra: Coalgebraic Walks, in Quantum and Turing Computation (BJ0), pp. 12–26.
FoSSaCS-2011-Panangaden: The Search for Structure in Quantum Computation (PP), pp. 1–11.
STOC-2011-BrandaoCY #algorithm #problem: A quasipolynomial-time algorithm for the quantum separability problem (FGSLB, MC, JY), pp. 343–352.
STOC-2011-RegevK #communication: Quantum one-way communication can be exponentially stronger than classical communication (OR, BK), pp. 31–40.
STOC-2011-Sherstov #communication #complexity #query #theorem: Strong direct product theorems for quantum communication and query complexity (AAS), pp. 41–50.
LICS-2011-HasuoH #geometry #higher-order #interactive #semantics: Semantics of Higher-Order Quantum Computation via Geometry of Interaction (IH, NH), pp. 237–246.
LICS-2011-HerrmannZ #complexity #satisfiability: Computational Complexity of Quantum Satisfiability (CH, MZ), pp. 175–184.
ITiCSE-2010-MainFH #student #what: What did qubits ever do for me: an answer for CS2 students (MM, RF, YH), pp. 209–213.
ICALP-v1-2010-KroviMOR #detection: Finding Is as Easy as Detecting for Quantum Walks (HK, FM, MO, JR), pp. 540–551.
ICALP-v2-2010-CoeckeK #composition #multi: The Compositional Structure of Multipartite Quantum Entanglement (BC, AK), pp. 297–308.
ICALP-v2-2010-DuncanP: Rewriting Measurement-Based Quantum Computations with Generalised Flow (RD, SP), pp. 285–296.
LATA-2010-ArrighiG #automaton: A Simple n-Dimensional Intrinsically Universal Quantum Cellular Automaton (PA, JG), pp. 70–81.
LATA-2010-Cruz-SantosM #on the #reduction #satisfiability: On the Hamiltonian Operators for Adiabatic Quantum Reduction of SAT (WCS, GML), pp. 239–248.
SFM-2010-BroadbentFK: Measurement-Based and Universal Blind Quantum Computation (AB, JF, EK), pp. 43–86.
CIKM-2010-PiwowarskiFLR #information retrieval #what: What can quantum theory bring to information retrieval (BP, IF, ML, KvR), pp. 59–68.
ECIR-2010-ZucconA #documentation #probability #rank #ranking #using: Using the Quantum Probability Ranking Principle to Rank Interdependent Documents (GZ, LA), pp. 357–369.
ICPR-2010-ZhouCW #classification #network: Deep Quantum Networks for Classification (SZ, QC, XW), pp. 2885–2888.
SAC-2010-AraujoOS #hybrid: Hybrid evolutionary quantum inspired method to adjust time phase distortions in financial time series (RdAA, ALIdO, SCBS), pp. 1153–1154.
DATE-2010-MehdipourHKIKMAF #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: A full characterization of quantum advice (SA, AD), pp. 131–140.
STOC-2010-AmbainisKS: A quantum lovász local lemma (AA, JK, OS), pp. 151–160.
STOC-2010-DeV: Near-optimal extractors against quantum storage (AD, TV), pp. 161–170.
CSL-2010-CoeckeP #category theory: Environment and Classical Channels in Categorical Quantum Mechanics (BC, SP), pp. 230–244.
QoSA-2009-LiKWHGGJMMNNW #adaptation #composition: Adaptive Application Composition in Quantum Chemistry (LL, JPK, MSW, KAH, AG, MSG, CLJ, LCM, HM, HN, BN, TLW), pp. 194–211.
CIAA-2009-FreivaldsI #permutation #query: Quantum Queries on Permutations with a Promise (RF, KI), pp. 208–216.
ICALP-v1-2009-KobayashiGNR #communication #network: 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 #question: How Can a Quantum Improvement in Personal and Group Information Management be Realized? (RT, TB), pp. 136–141.
QAPL-2009-TafliovichH #communication #programming: Programming with Quantum Communication (AT, ECRH), pp. 99–118.
ASE-2009-Hall #algorithm #re-engineering: A Quantum Algorithm for Software Engineering Search (RJH), pp. 40–51.
SAC-2009-VomelTM: Bulk based preconditioning for quantum dot computations (CV, ST, OM), pp. 961–965.
STOC-2009-AharonovALV #detection: The detectability lemma and quantum gap amplification (DA, IA, ZL, UVV), pp. 417–426.
STOC-2009-CleveGMSY #algorithm #performance #query #simulation: Efficient discrete-time simulations of continuous-time quantum query algorithms (RC, DG, MM, RDS, DLYM), pp. 409–416.
STOC-2009-Liu #algorithm #using: Quantum algorithms using the curvelet transform (YKL), pp. 391–400.
STOC-2009-Ta-Shma: Short seed extractors against quantum storage (ATS), pp. 401–408.
DLT-2008-Hirvensalo #aspect-oriented #automaton #finite: Various Aspects of Finite Quantum Automata (MH), pp. 21–33.
ICALP-A-2008-ChildsL #bound #order: Optimal Quantum Adversary Lower Bounds for Ordered Search (AMC, TL), pp. 869–880.
ICALP-A-2008-EldarR #satisfiability: Quantum SAT for a Qutrit-Cinquit Pair Is QMA1-Complete (LE, OR), pp. 881–892.
ICALP-A-2008-HallgrenH: Superpolynomial Speedups Based on Almost Any Quantum Circuit (SH, AWH), pp. 782–795.
ICALP-A-2008-KempeRUW #bound #fault tolerance: Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing (JK, OR, FU, RdW), pp. 845–856.
ICALP-A-2008-RegevS: Impossibility of a Quantum Speed-Up with a Faulty Oracle (OR, LS), pp. 773–781.
ICALP-B-2008-CoeckeD: Interacting Quantum Observables (BC, RD), pp. 298–310.
ICALP-B-2008-Martin #formal method: A Domain Theoretic Model of Qubit Channels (KM), pp. 283–297.
ICALP-C-2008-HallgrenKSZ #protocol #verification: Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks (SH, AK, PS, SZ), pp. 592–603.
LATA-2008-ArrighiNW #automaton #bound #finite: One-Dimensional Quantum Cellular Automata over Finite, Unbounded Configurations (PA, VN, RFW), pp. 64–75.
LATA-2008-Mercer #automaton #bound #finite: Lower Bounds for Generalized Quantum Finite Automata (MM), pp. 373–384.
ICPR-2008-EmmsHW #graph #using: Graph drawing using quantum commute time (DE, ERH, RCW), pp. 1–4.
SAS-2008-Perdrix #abstract interpretation #analysis: Quantum Entanglement Analysis Based on Abstract Interpretation (SP), pp. 270–282.
STOC-2008-Gavinsky #interactive: Classical interaction cannot replace a quantum message (DG), pp. 95–102.
STOC-2008-ReichardtS #algorithm: Span-program-based quantum algorithm for evaluating formulas (BR, RS), pp. 103–112.
STOC-2008-Sherstov #bound #communication #matrix: The pattern matrix method for lower bounds on quantum communication (AAS), pp. 85–94.
CAV-2008-GayNP #model checking #named: QMC: A Model Checker for Quantum Systems (SJG, RN, NP), pp. 543–547.
DLT-2007-BelovsRS #automaton #finite #multi: Multi-letter Reversible and Quantum Finite Automata (AB, AR, JS), pp. 60–71.
ICALP-2007-IwamaNRY #bound #communication #complexity: Unbounded-Error One-Way Classical and Quantum Communication Complexity (KI, HN, RR, SY), pp. 110–121.
ICALP-2007-MontanaroW #bound #communication #complexity: A Lower Bound on Entanglement-Assisted Quantum Communication Complexity (AM, AJW), pp. 122–133.
LATA-2007-AblayevG #branch #complexity #simulation #source code: Classical Simulation Complexity of Quantum Branching Programs (FMA, AG), pp. 49–56.
ICML-2007-AimeurBG #algorithm #clustering: Quantum clustering algorithms (EA, GB, SG), pp. 1–8.
DAC-2007-MaslovFM #empirical #interactive #optimisation #physics: 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: 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 #towards: Toward a general theory of quantum games (GG, JW), pp. 565–574.
STOC-2007-MagniezNRS: Search via quantum walk (FM, AN, JR, MS), pp. 575–584.
STOC-2007-MooreRS #algorithm #graph #morphism #on the: On the impossibility of a quantum sieve algorithm for graph isomorphism (CM, AR, PS), pp. 536–545.
CIAA-2006-YangXSP #hybrid #synthesis: Universality of Hybrid Quantum Gates and Synthesis Without Ancilla Qudits (GY, FX, XS, MAP), pp. 279–280.
ICALP-v1-2006-MagniezMMO #self: Self-testing of Quantum Circuits (FM, DM, MM, HO), pp. 72–83.
ICALP-v1-2006-Reichardt #fault tolerance: Fault-Tolerance Threshold for a Distance-Three Quantum Code (BR), pp. 50–61.
ICALP-v1-2006-Wolf #bound #matrix: Lower Bounds on Matrix Rigidity Via a Quantum Argument (RdW), pp. 62–71.
ICALP-v2-2006-DanosKP: The One Way to Quantum Computation (VD, EK, PP), pp. 13–21.
ICALP-v2-2006-DodisR #on the #using: On the Impossibility of Extracting Classical Randomness Using a Quantum Computer (YD, RR), pp. 204–215.
ICALP-v2-2006-KawachiY: Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding (AK, TY), pp. 216–227.
ICPR-v3-2006-EmmsHW #graph #using: Graph Matching using Interference of Coined Quantum Walks (DE, ERH, RCW), pp. 133–136.
SIGIR-2006-Rijsbergen: Quantum haystacks (CJvR), pp. 1–2.
SAC-2006-DantsinWK #algorithm #constraints #problem #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: A program transformation and architecture support for quantum uncomputation (ES, TNV), pp. 252–263.
DATE-2006-AbdollahiP #analysis #diagrams #synthesis #using: Analysis and synthesis of quantum circuits by using quantum decision diagrams (AA, MP), pp. 317–322.
DATE-2006-GuptaJL #automaton #generative #testing: Test generation for combinational quantum cellular automata (QCA) circuits (PG, NKJ, LL), pp. 311–316.
STOC-2006-AharonovJL #algorithm #approximate #polynomial: A polynomial quantum algorithm for approximating the Jones polynomial (DA, VJ, ZL), pp. 427–436.
STOC-2006-AmbainisSW #bound #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: Bounded-error quantum state identification and exponential separations in communication complexity (DG, JK, OR, RdW), pp. 594–603.
STOC-2006-HallgrenMRRS #graph #morphism: Limitations of quantum coset states for graph isomorphism (SH, CM, MR, AR, PS), pp. 604–617.
STOC-2006-Watrous: Zero-knowledge against quantum attacks (JW), pp. 296–305.
STOC-2006-Zhang #bound #random: New upper and lower bounds for randomized and quantum local search (SZ), pp. 634–643.
JCDL-2005-KustanowitzS #library: Meaningful presentations of photo libraries: rationale and applications of bi-level radial quantum layouts (JK, BS), pp. 188–196.
CIAA-2005-Freivalds #automaton #finite: Languages Recognizable by Quantum Finite Automata (RF), pp. 1–14.
DLT-2005-AblayevG #automaton #complexity: Complexity of Quantum Uniform and Nonuniform Automata (FMA, AG), pp. 78–87.
ICALP-2005-KoiranNP #bound #complexity #problem #query: A Quantum Lower Bound for the Query Complexity of Simon’s Problem (PK, VN, NP), pp. 1287–1298.
ICALP-2005-MagniezN #commutative #complexity #testing: Quantum Complexity of Testing Group Commutativity (FM, AN), pp. 1312–1324.
ICALP-2005-SpalekS: All Quantum Adversary Methods Are Equivalent (RS, MS), pp. 1299–1311.
TLCA-2005-SelingerV #λ-calculus: A λ Calculus for Quantum Computation with Classical Control (PS, BV), pp. 354–368.
POPL-2005-GayN #communication #process: Communicating quantum processes (SJG, RN), pp. 145–157.
DATE-2005-MaslovYMD #using: Quantum Circuit Simplification Using Templates (DM, CY, DMM, GWD), pp. 1208–1213.
DATE-2005-YangHSP #logic #multi #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: Fast quantum byzantine agreement (MBO, AH), pp. 481–485.
STOC-2005-Hallgren #algorithm #performance: Fast quantum algorithms for computing the unit group and class group of a number field (SH), pp. 468–474.
STOC-2005-SchmidtV #algorithm #polynomial: 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: Tensor norms and the classical communication complexity of nonlocal quantum measurement (YS), pp. 460–467.
LICS-2005-AltenkirchG #functional #programming language: A Functional Quantum Programming Language (TA, JG), pp. 249–258.
CIAA-2004-NishimuraY #automaton #finite #interactive #proving: An Application of Quantum Finite Automata to Interactive Proof Systems (HN, TY), pp. 225–236.
ICALP-2004-DurrHHM #complexity #graph #problem #query: Quantum Query Complexity of Some Graph Problems (CD, MH, PH, MM), pp. 481–493.
ICALP-2004-Jeandel: Universality in Quantum Computation (EJ), pp. 793–804.
ICALP-2004-Midrijanis #bound #polynomial #problem #query #set #similarity: A Polynomial Quantum Query Lower Bound for the Set Equality Problem (GM), pp. 996–1005.
FLOPS-2004-Selinger #overview #programming language: A Brief Survey of Quantum Programming Languages (PS), pp. 1–6.
DAC-2004-HungSYYP #analysis #logic #reachability #synthesis: Quantum logic synthesis by symbolic reachability analysis (WNNH, XS, GY, JY, MAP), pp. 838–841.
DATE-v2-2004-ShendeMB #communication: Smaller Two-Qubit Circuits for Quantum Communication and Computation (VVS, ILM, SSB), pp. 980–987.
DATE-v2-2004-TahooriL #automaton #design #testing: Testing of Quantum Dot Cellular Automata Based Designs (MBT, FL), pp. 1408–1409.
DATE-v2-2004-ViamontesMH #simulation: High-Performance QuIDD-Based Simulation of Quantum Circuits (GFV, ILM, JPH), pp. 1354–1355.
STOC-2004-Aaronson #multi: Multilinear formulas and skepticism of quantum computing (SA), pp. 118–127.
STOC-2004-Aaronson04a #bound: Lower bounds for local search by quantum arguments (SA), pp. 465–474.
STOC-2004-Ambainis #algorithm: Quantum algorithms a decade after shor (AA), p. 111.
STOC-2004-Bar-YossefJK #communication #complexity #exponential: Exponential separation of quantum and classical one-way communication complexity (ZBY, TSJ, IK), pp. 128–137.
STOC-2004-Reichardt #algorithm #optimisation: The quantum adiabatic optimization algorithm and local minima (BR), pp. 502–510.
STOC-2004-SanthaS #query: Quantum and classical query complexities of local search are polynomially related (MS, MS), pp. 494–501.
STOC-2004-Yao #graph #problem #sorting: Graph entropy and quantum sorting problems (ACCY), pp. 112–117.
LICS-2004-Abramsky: High-Level Methods for Quantum Computation and Information (SA), pp. 410–414.
LICS-2004-AbramskyC #category theory #protocol #semantics: A Categorical Semantics of Quantum Protocols (SA, BC), pp. 415–425.
DLT-2003-BertoniMP #automaton: Quantum Computing: 1-Way Quantum Automata (AB, CM, BP), pp. 1–20.
ICALP-2003-HoyerMW #bound: Quantum Search on Bounded-Error Inputs (PH, MM, RdW), pp. 291–299.
Haskell-2003-Karczmarczuk #framework #functional: Structure and interpretation of quantum mechanics: a functional framework (JK), pp. 50–61.
Haskell-2003-Sabry #haskell #modelling: Modeling quantum computing in Haskell (AS), pp. 39–49.
ICFP-2003-Knight #functional: Conservation of information: applications in functional, reversible, and quantum computing (TKJ), p. 1.
DAC-2003-Hayes #concept #named #tutorial: Tutorial: basic concepts in quantum circuits (JPH), p. 893.
DAC-2003-Travaglione #algorithm #design #implementation: Designing and implementing small quantum circuits and algorithms (BT), pp. 894–899.
STOC-2003-AharonovT #generative #statistics: Adiabatic quantum state generation and statistical zero knowledge (DA, ATS), pp. 20–29.
STOC-2003-ChildsCDFGS #algorithm #exponential: Exponential algorithmic speedup by a quantum walk (AMC, RC, ED, EF, SG, DAS), pp. 59–68.
STOC-2003-FriedlIMSS: Hidden translation and orbit coset in quantum computing (KF, GI, FM, MS, PS), pp. 1–9.
STOC-2003-Gurvits #complexity #problem: Classical deterministic complexity of Edmonds’ Problem and quantum entanglement (LG), pp. 10–19.
STOC-2003-KerenidisW #bound #exponential: Exponential lower bound for 2-query locally decodable codes via a quantum argument (IK, RdW), pp. 106–115.
STOC-2003-Klauck #sorting #trade-off: Quantum time-space tradeoffs for sorting (HK), pp. 69–76.
STOC-2003-Ya #on the #power of: On the power of quantum fingerprinting (ACCY), pp. 77–81.
CSL-2003-MeydenP #logic #probability: A Logic for Probability in Quantum Systems (RvdM, MP), pp. 427–440.
DLT-2002-Kitagawa: Experimental Quantum Computation with Molecules (MK), pp. 21–27.
ICALP-2002-AblayevMP #bound #branch #probability #source code: Quantum and Stochastic Branching Programs of Bounded Width (FMA, CM, CP), pp. 343–354.
DAC-2002-IwamaKY #design: Transformation rules for designing CNOT-based quantum circuits (KI, YK, SY), pp. 419–424.
STOC-2002-Aaronson #bound #problem: Quantum lower bound for the collision problem (SA), pp. 635–642.
STOC-2002-CrepeauGS #multi: Secure multi-party quantum computation (CC, DG, AS), pp. 643–652.
STOC-2002-Hallgren #algorithm #equation #polynomial #problem: Polynomial-time quantum algorithms for Pell’s equation and the principal ideal problem (SH), pp. 653–658.
STOC-2002-NayakS #communication #on the: On communication over an entanglement-assisted quantum channel (AN, JS), pp. 698–704.
DLT-2001-CaludeC #automaton #named #nondeterminism: Automata: From Uncertainty to Quantum (CC, EC), pp. 1–14.
ICALP-2001-HoyerNS #order #sorting: Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness (PH, JN, YS), pp. 346–357.
ICALP-2001-SenV #bound: Lower Bounds in the Quantum Cell Probe Model (PS, SV), pp. 358–369.
ICALP-2001-Servedio #learning: Separating Quantum and Classical Learning (RAS), pp. 1065–1080.
STOC-2001-Ambainis #bound #protocol: A new protocol and lower bounds for quantum coin flipping (AA), pp. 134–142.
STOC-2001-AmbainisBNVW: One-dimensional quantum walks (AA, EB, AN, AV, JW), pp. 37–49.
STOC-2001-AmbainisKV #graph: Quantum walks on graphs (DA, AA, JK, UVV), pp. 50–59.
STOC-2001-GrigniSVV #algorithm #problem: Quantum mechanical algorithms for the nonabelian hidden subgroup problem (MG, LJS, MV, UVV), pp. 68–74.
STOC-2001-KlauckNTZ #communication #complexity #interactive #set: Interaction in quantum communication and the complexity of set disjointness (HK, AN, ATS, DZ), pp. 124–133.
STOC-2001-Valiant #polynomial: Quantum computers that can be simulated classically in polynomial time (LGV), pp. 114–123.
STOC-2001-Watrous #algorithm: Quantum algorithms for solvable groups (JW), pp. 60–67.
WLC-2000-GruskaV #automaton #finite: Quantum Finite Automata (JG, RV), pp. 192–211.
DAC-2000-NiemierKK #design #novel #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 bit escrow (DA, ATS, UVV, ACCY), pp. 705–714.
STOC-2000-Ambainis #bound: Quantum lower bounds by quantum arguments (AA), pp. 636–643.
STOC-2000-BihamBBMR #proving #security: A proof of the security of quantum key distribution (EB, MB, POB, TM, VPR), pp. 715–724.
STOC-2000-DamMMS #fault tolerance #self #set: Self-testing of universal and fault-tolerant sets of quantum gates (WvD, FM, MM, MS), pp. 688–696.
STOC-2000-Grover #agile: Rapid sampling though quantum computing (LKG), pp. 618–626.
STOC-2000-HallgrenRT #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 #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: On quantum and probabilistic communication: Las Vegas and one-way protocols (HK), pp. 644–651.
PDP-1999-GuskenLS #scalability #simulation: Large scale simulations of quantum chromodynamics in a Europe wide SIMD-MIMD environment (SG, TL, KS), pp. 321–327.
STOC-1999-AmanoI #automaton #finite: Undecidability on Quantum Finite Automata (MA, KI), pp. 368–375.
STOC-1999-AmbainisNTV #automaton #bound: Dense Quantum Coding and a Lower Bound for 1-Way Quantum Automata (AA, AN, ATS, UVV), pp. 376–383.
STOC-1999-HalesH #fourier: Quantum Fourier Sampling Simplified (LH, SH), pp. 330–338.
STOC-1999-NayakW #approximate #complexity #query #statistics: The Quantum Query Complexity of Approximating the Median and Related Statistics (AN, FW), pp. 384–393.
STOC-1999-Raz #communication #complexity #exponential: Exponential Separation of Quantum and Classical Communication Complexity (RR), pp. 358–367.
STOC-1999-SchulmanV99a #scalability: Molecular Scale Heat Engines and Scalable Quantum Computation (LJS, UVV), pp. 322–329.
ICALP-1998-Brassard #information management: New Horizons in Quantum Information Processing (GB), pp. 769–771.
ICALP-1998-BrassardHT: Quantum Counting (GB, PH, AT), pp. 820–831.
STOC-1998-AharonovKN: Quantum Circuits with Mixed States (DA, AK, NN), pp. 20–30.
STOC-1998-BuhrmanCW #communication: Quantum vs. Classical Communication and Computation (HB, RC, AW), pp. 63–68.
STOC-1998-Grover #algorithm #framework #performance: A Framework for Fast Quantum Mechanical Algorithms (LKG), pp. 53–62.
DLT-1997-Hirvensalo: The Reversibility in Quantum Computation Theory (MH), pp. 203–210.
STOC-1997-AharonovB #constant #fault tolerance: Fault-Tolerant Quantum Computation With Constant Error (DA, MBO), pp. 176–188.
STOC-1997-Beals #fourier #symmetry: Quantum Computation of Fourier Transforms over Symmetric Groups (RB), pp. 48–53.
STOC-1996-Grover #algorithm #database #performance: A Fast Quantum Mechanical Algorithm for Database Search (LKG), pp. 212–219.
STOC-1995-Yao #metric #protocol #security: Security of quantum protocols against coherent measurements (ACCY), pp. 67–75.
ICLP-1994-Zapatrin #logic programming #metric: Logic Programming as Quantum Measurement (RRZ), p. 747.
STOC-1993-BernsteinV #complexity: Quantum complexity theory (EB, UVV), pp. 11–20.