Showing 21–40 of 60 results
/ Date/ Name
Oct 25, 2021Discovering optimal fermion-qubit mappings through algorithmic enumerationNov 10, 2021Minimal Port-based TeleportationJun 8, 2018Quantum advantage of unitary Clifford circuits with magic state inputsMay 6, 2023Generalised Coupling and An Elementary Algorithm for the Quantum Schur TransformMay 6, 2013Parrondo's paradox and superactivation of classical and quantum capacity of communication channels with memoryMay 8, 2017Efficient classical verification of quantum computationsJul 24, 2023Gaussian decomposition of magic states for matchgate computationsAug 19, 2024IQP computations with intermediate measurementsNov 20, 2023Efficient Algorithms for All Port-Based Teleportation ProtocolsJul 21, 2011When does noise increase the quantum capacity?Sep 19, 2023Provable Advantage in Quantum PAC LearningNov 18, 2014Quantum Conditional Mutual Information, Reconstructed States, and State RedistributionApr 27, 2025Classical simulation of parity-preserving quantum circuitsJan 2, 2025Symmetric quantum computationJan 12, 2023Simultaneous superadditivity of the direct and complementary channel capacitiesAug 2, 2022Simulating quantum circuits using efficient tensor network contraction algorithms with subexponential upper boundDec 14, 2021Speeding up Learning Quantum States through Group Equivariant Convolutional Quantum AnsätzeFeb 17, 2025Structure, Positivity and Classical Simulability of Kirkwood-Dirac DistributionsFeb 18, 2015Superadditivity of private information for any number of uses of the channelDec 10, 2024Ternary tree transformations are equivalent to linear encodings of the Fock basis