4.6 Article

Optimal quantum operations at zero energy cost

Journal

PHYSICAL REVIEW A
Volume 96, Issue 2, Pages -

Publisher

AMER PHYSICAL SOC
DOI: 10.1103/PhysRevA.96.022327

Keywords

-

Funding

  1. Hong Kong Research Grant Council [17326616]
  2. Foundational Questions Institute [FQXi-RFP3-1325]
  3. National Natural Science Foundation of China [11675136, 11450110096, 11350110207]
  4. 1000 Youth Fellowship Program of China
  5. Canadian Institute for Advanced Research (CIFAR)

Ask authors/readers for more resources

Quantum technologies are developing powerful tools to generate and manipulate coherent superpositions of different energy levels. Envisaging a new generation of energy-efficient quantum devices, here we explore how coherence can be manipulated without exchanging energy with the surrounding environment. We start from the task of converting a coherent superposition of energy eigenstates into another. We identify the optimal energy-preserving operations, both in the deterministic and in the probabilistic scenario. We then design a recursive protocol, wherein a branching sequence of energy-preserving filters increases the probability of success while reaching maximum fidelity at each iteration. Building on the recursive protocol, we construct efficient approximations of the optimal fidelity-probability trade-off, by taking coherent superpositions of the different branches generated by probabilistic filtering. The benefits of this construction are illustrated in applications to quantum metrology, quantum cloning, coherent state amplification, and ancilla-driven computation. Finally, we extend our results to transitions where the input state is generally mixed and we apply our findings to the task of purifying quantum coherence.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available