Pages that link to "Item:Q5428317"

The following pages link to Quantum computing, postselection, and probabilistic polynomial-time (Q5428317):

Displaying 43 items.

• Computation with multiple CTCs of fixed length and width (Q256423) (← links)
• Duality quantum computer and the efficient quantum simulations (Q291560) (← links)
• Perfect state distinguishability and computational speedups with postselected closed timelike curves (Q427292) (← links)
• Revisiting integer factorization using closed timelike curves (Q669871) (← links)
• A broader view on the limitations of information processing and communication by nature (Q885681) (← links)
• The landscape of communication complexity classes (Q1653337) (← links)
• Quantum algorithm for linear differential equations with exponentially improved dependence on precision (Q1686025) (← links)
• The complexity of approximating complex-valued Ising and Tutte partition functions (Q1686832) (← links)
• Simulations of closed timelike curves (Q1709148) (← links)
• The weirdness theorem and the origin of quantum paradoxes (Q2062465) (← links)
• A structured view on weighted counting with relations to counting, quantum computation and applications (Q2216125) (← links)
• The Python's lunch: geometric obstructions to decoding Hawking radiation (Q2225762) (← links)
• Quantum Fourier transforms and the complexity of link invariants for quantum doubles of finite groups (Q2258015) (← links)
• Quantum information in the Posner model of quantum cognition (Q2318790) (← links)
• Quantum alternation (Q2361668) (← links)
• A linear-optical proof that the permanent is # <b>P</b> -hard (Q2901811) (← links)
• Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy (Q3088963) (← links)
• Computational Complexity of Projected Entangled Pair States (Q3107793) (← links)
• The learnability of quantum states (Q3508097) (← links)
• Temporally unstructured quantum computation (Q3561913) (← links)
• Quantum multiparty communication complexity and circuit lower bounds (Q3616221) (← links)
• Computational tameness of classical non-causal models (Q4556871) (← links)
• Quantum hedging in two-round prover-verifier interactions (Q4637979) (← links)
• A Complete Characterization of Unitary Quantum Space (Q4993267) (← links)
• (Q5092454) (← links)
• (Q5121907) (← links)
• (Q5121909) (← links)
• Shadow Tomography of Quantum States (Q5130848) (← links)
• The BQP-hardness of approximating the Jones polynomial (Q5135831) (← links)
• Robust entangled qutrit states in atmospheric turbulence (Q5141501) (← links)
• Computation in generalised probabilisitic theories (Q5151582) (← links)
• Affine Computation and Affine Automaton (Q5740183) (← links)
• Operational quantum theory without predefined time (Q5855074) (← links)
• Area laws and efficient descriptions of quantum many-body states (Q5855082) (← links)
• Quantum double aspects of surface code models (Q5884318) (← links)
• Rectangles Are Nonnegative Juntas (Q5890971) (← links)
• Complementarity and the unitarity of the black hole \(S\)-matrix (Q6041753) (← links)
• Non-isometric codes for the black hole Interior from fundamental and effective dynamics (Q6056903) (← links)
• Commuting quantum circuits and complexity of Ising partition functions (Q6100591) (← links)
• Picturing Counting Reductions with the ZH-Calculus (Q6200526) (← links)
• Bulk reconstruction and non-isometry in the backwards-forwards holographic black hole map (Q6590819) (← links)
• Well-tempered ZX and ZH calculi (Q6645575) (← links)
• Tensor networks for black hole interiors: non-isometries, quantum extremal surfaces, and wormholes (Q6647337) (← links)