Commuting quantum circuits: efficient classical simulations versus hardness results

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

19 pages

Scientific paper

The study of quantum circuits composed of commuting gates is particularly useful to understand the delicate boundary between quantum and classical computation. Indeed, while being a restricted class, commuting circuits exhibit genuine quantum effects such as entanglement. In this paper we show that the computational power of commuting circuits exhibits a surprisingly rich structure. First we show that every 2-local commuting circuit acting on d-level systems and followed by single-qudit measurements can be efficiently simulated classically with high accuracy. In contrast, we prove that such strong simulations are hard for 3-local circuits. Using sampling methods we further show that all commuting circuits composed of exponentiated Pauli operators e^{i\theta P} can be simulated efficiently classically when followed by single-qubit measurements. Finally, we show that commuting circuits can efficiently simulate certain non-commutative processes, related in particular to constant-depth quantum circuits. This gives evidence that the power of commuting circuits goes beyond classical computation.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Commuting quantum circuits: efficient classical simulations versus hardness results does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Commuting quantum circuits: efficient classical simulations versus hardness results, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Commuting quantum circuits: efficient classical simulations versus hardness results will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-5444

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.