Search arXiv⌕ Search

arXiv · quant-ph/0412123

Quantum computation and analysis of Wigner and Husimi functions: toward a quantum image treatment

Abstract

We study the efficiency of quantum algorithms which aim at obtaining phase space distribution functions of quantum systems. Wigner and Husimi functions are considered. Different quantum algorithms are envisioned to build these functions, and compared with the classical computation. Different procedures to extract more efficiently information from the final wave function of these algorithms are studied, including coarse-grained measurements, amplitude amplification and measure of wavelet-transformed wave function. The algorithms are analyzed and numerically tested on a complex quantum system showing different behavior depending on parameters, namely the kicked rotator. The results for the Wigner function show in particular that the use of the quantum wavelet transform gives a polynomial gain over classical computation. For the Husimi distribution, the gain is much larger than for the Wigner function, and is bigger with the help of amplitude amplification and wavelet transforms. We also apply the same set of techniques to the analysis of real images. The results show that the use of the quantum wavelet transform allows to lower dramatically the number of measurements needed, but at the cost of a large loss of information.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

M. Terraneo, B. Georgeot, D. L. Shepelyansky. 2004-12-15. Quantum computation and analysis of Wigner and Husimi functions: toward a quantum image treatment. https://doi.org/10.1103/physreve.71.066215

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Entanglement-based quantum communication may prevent tracking the message sender

The possibility of attaining current position of the message sender without person's consent seriously compromises the secrecy of correspondence. Classical communication systems cannot guarantee the security of communication against unwanted location tracking, because the sender must broadcast a signal at the moment of sending the message. The source of the signal could be always located, at least in principle. We show that quantum communication enables sending the message with pre-distributed entangled quantum systems, local weak measurements, time synchronization between the sender and the receiver and classical communication by the message receiver alone, therefore, physically securing the sender's location.

quant-ph↗

Fully Passive Quantum Conference Key Agreement

Quantum Conference Key Agreement (CKA) provides a secure method for multi-party communication. A recently developed interference-based prepare-and-measure quantum CKA possesses the advantages of measurement-device-independence, namely, being immune to side-channels from the detector side. Besides, it achieves good key rate performance, especially for high-loss channels, due to the use of single photon interference. Meanwhile, several fully passive QKD schemes have been proposed, which eliminate all side channels from the source modulation side. We extend the fully passive idea to an interference-based CKA, which has a high level of implementation security for many-user communication.

quant-ph↗

Fast simulations of X-ray absorption spectroscopy for battery materials on a quantum computer

X-ray absorption spectroscopy (XAS) is a leading technique for understanding structural changes in advanced battery materials such as lithium-excess cathodes. However, extracting critical information like oxidation states from the experimental spectra requires expensive and time-consuming simulations. Building upon a recent proposal to simulate XAS using quantum computers, this work proposes a highly-optimized implementation of the time-domain algorithm for X-ray absorption. Among a host of improvements to Hamiltonian representation, circuit implementation, and measurement strategies, three optimizations are key to the efficiency of the algorithm. The first is the use of product formulas with the compressed double factorized form of the Hamiltonian. The second is recognizing that for spectroscopy applications, it is sufficient to control the error in the eigenvalues of the (approximate) Hamiltonian being implemented by the product formula, rather than the generic error on the full time evolution operator. Using perturbation theory to estimate this eigenvalue error, we find that significantly fewer Trotter steps are needed than expected from the time evolution error bound. The third is the choice of an optimized distribution of samples that takes advantage of the exponentially decaying Lorentzian kernel. Through constant factor resource estimates, we show that a challenging model Li$_4$Mn$_2$O cluster system with 18 spatial orbitals and 22 electrons in the active space can be simulated with 100 logical qubits and less than $4 \times 10^8$ Toffoli gates per circuit. Finally, the algorithm is implemented on a simulator, and the reconstructed spectrum is verified against a classical computational reference. The low cost of our algorithm makes it attractive to use on fault-tolerant quantum devices to accelerate the development and commercialization of high-capacity battery cathodes.

quant-ph↗