{"work":{"id":"2e63f103-5980-4200-a67b-83dd30ea0fb9","openalex_id":null,"doi":null,"arxiv_id":"quant-ph/0301063","raw_key":null,"title":"Efficient classical simulation of slightly entangled quantum computations","authors":null,"authors_text":null,"year":2003,"venue":"quant-ph","abstract":"We present a scheme to efficiently simulate, with a classical computer, the dynamics of multipartite quantum systems on which the amount of entanglement (or of correlations in the case of mixed-state dynamics) is conveniently restricted. The evolution of a pure state of n qubits can be simulated by using computational resources that grow linearly in n and exponentially in the entanglement. We show that a pure-state quantum computation can only yield an exponential speed-up with respect to classical computations if the entanglement increases with the size n of the computation, and gives a lower bound on the required growth.","external_url":"https://arxiv.org/abs/quant-ph/0301063","cited_by_count":null,"metadata_source":"pith","metadata_fetched_at":"2026-07-03T21:18:59.195369+00:00","pith_arxiv_id":"quant-ph/0301063","created_at":"2026-05-18T13:21:24.032595+00:00","updated_at":"2026-07-03T21:18:59.195369+00:00","title_quality_ok":true,"display_title":"Efficient classical simulation of slightly entangled quantum computations","render_title":"Efficient classical simulation of slightly entangled quantum computations"},"hub":{"state":{"tier_text":"hub","tier":"hub","tier_reason":"10+ Pith inbound or 1,000+ external citations","pith_inbound_count":12,"external_cited_by_count":null},"tier":"hub","role_counts":[],"polarity_counts":[],"runs":{},"summary":{},"graph":{},"authors":[]}}