Showing 1–20 of 56 results
/ Date/ Name
Mar 12, 2012Quantum Simpsons Paradox and High Order Bell-Tsirelson InequalitiesSep 29, 2007Quantum communication complexity of block-composed functionsDec 15, 2001Quantum lower bounds for the collision and the element distinctness problemsMay 18, 2002Both Toffoli and Controlled-NOT need little help to do universal quantum computationJun 28, 2017Keyring models: an approach to steerabilityMay 5, 2003Distributed construction of quantum fingerprintsAug 2, 2016Certifying the absence of quantum nonlocalityFeb 19, 2014Physical Randomness Extractors: Generating Random Numbers with Minimal AssumptionsNov 8, 2005Simulating quantum computation by contracting tensor networksNov 8, 2005Tensor Norms and the Classical Communication Complexity of Nonlocal Quantum MeasurementOct 17, 2016Certified randomness between mistrustful playersMar 3, 2026Improved Stability-Based Transition Transport Model for Airships Incorporating Wall Heating EffectsAug 4, 2009Tripartite to Bipartite Entanglement Transformations and Polynomial Identity TestingDec 30, 2003Quantum and Classical TradeoffsSep 26, 2005The Communication Complexity of the Hamming Distance ProblemNov 8, 2005Classical simulation of quantum many-body systems with a tree tensor networkJul 24, 2007Constant-degree graph expansions that preserve the treewidthSep 5, 2019Alibaba Cloud Quantum Development Platform: Applications to Quantum Algorithm DesignMay 23, 2023A Classical Architecture For Digital Quantum ComputersAug 13, 2008Communication Complexities of XOR functions