Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1806.05080 · Quantum Information Processing

Complete optimal convex approximations of qubit states under $$B_2$$ B 2 distance

Xiao-Bin Liang, Bo Li, Biao‐Liang Ye, Shao-Ming Fei, Xianqing Li‐Jost

Published Jun 12, 2018• 8 citations
arXivHTMLPDF

Abstract

We consider the optimal approximation of arbitrary qubit states with respect to an available states consisting the eigenstates of two of three Pauli matrices, the $$B_2$$ -distance of an arbitrary target state. Both the analytical formulae of the $$B_2$$ -distance and the corresponding complete optimal decompositions are obtained. The trade-off relations for both the sum and the squared sum of the $$B_2$$ -distances have been analytically and numerically investigated.

DOI
10.1007/s11128-018-1948-0

Related papers

Optimal convex approximations of qubit states under Pauli distance

Li‐qiang Zhang, Kai Shi, Chang‐shui Yu

Abstract Utilizing the l 1 norm as the quantum state distance metric, we consider the Pauli distance of arbitrary target quantum states, that is, the optimal convex approximation of any qubit mixed states relative to the available state of pairs of eigenstates in three Pauli matrices. We get the complete analytical expressions for B 1 -distance, B 2 -distance and B 3 -distance. We determine the parameter range for the optimal approximation of each B 2 -distance in eight distinct scenarios. Furthermore, some trade-off relations about B 2 -distances are also studied.

Laser Physics•Jun 27, 2024•1 citation

Optimal convex approximation of qubit states and geometry of completely represented states

Hongyi Zhou, Ting Gao, Fengli Yan

Abstract We investigate the optimal convex approximation, optimally approximating a desired and unavailable qubit state by the convex mixing of a given set of available states. When the available states are the eigenvectors of three Pauli matrices, we present the complete exact solution for the optimal convex approximation of an arbitrary qubit state based on the fidelity distance. By the comparison of optimal states based on fidelity and trace norm, the advantages and disadvantages of the optimal convex approximation are identified. Several examples are provided to support this. We also analyze the geometrical properties of the target states which can be completely represented by a set of available states. Using the feature of convex combination, we derive the maximum range of completely represented states and clearly illustrate that any qubit state can be optimally prepared by at most three available states in known useable states.

arXiv:2105.07336•Europhysics Letters (EPL)•Oct 1, 2021•3 citations

Optimal convex approximations of quantum states

Massimiliano Federico Sacchi

We consider the problem of optimally approximating an unavailable quantum state $\ensuremath{\rho}$ by the convex mixing of states drawn from a set of available states ${{\ensuremath{\nu}}_{i}}$. The problem is recast to look for the least distinguishable state from $\ensuremath{\rho}$ among the convex set ${\ensuremath{\sum}}_{i}{p}_{i}{\ensuremath{\nu}}_{i}$, and the corresponding optimal weights ${{p}_{i}}$ provide the optimal convex mixing. We present the complete solution for the optimal convex approximation of a qubit mixed state when the set of available states comprises the three bases of the Pauli matrices.

arXiv:1710.01565•Physical Review A•Oct 18, 2017•10 citations

Analytical quantum state approximation with Pauli operators under trace norm and fidelity

Yutong Liu, Hua Nan, Hongyu Liu +2 more

Abstract Building upon the theoretical foundation of utilizing the eigenvectors of Pauli matrices for single-qubit quantum state preparation, we employ a set of easily preparable quantum states constructed from the eigenvectors of Pauli matrices and arbitrary real quantum logic gates. Using fidelity and trace norm as tools, we achieve the approximation of single-qubit quantum states. For different scenarios, we present complete exact solutions and analytical expressions for the optimal approximation. Furthermore, during the research, we investigated the comparative effectiveness of different distance metrics within the set B α Z for quantum state approximation. It was found that trace norm can approximate target state more easily than fidelity. This discovery significantly aids in the selection of measurement tools for quantum state approximation tasks.

Physica Scripta•Aug 20, 2025•0 citations

Optimal convex approximation of quantum channels based on $α$-affinity

Liqiang Zhang, Chengling Fu, Liuyong Cheng +2 more

Determining the minimal distance between a target channel and a convex hull of predefined set of implementable channels is a fundamental problem in quantum resource theory, and provides key guidance for experimental implementations. In this work, we develop a unified analytical framework for optimal convex approximation of quantum channels based on the quantum $α$-affinity measure. We construct a channel distance metric induced by the α-affinity and the ChoiJamiolkowski isomorphism, which satisfies the required properties of a well-defined channel distance. Subsequently, we present an optimization framework for the convex approximation of quantum channels, and derive analytical solutions for the optimal convex approximation of single-qubit unitary channels over both the SU(2)-covariant and Pauli channel families, obtaining closed-form expressions for the optimal parameters and the minimal approximation distance. This framework is further applied to the amplitude-damping channel, yielding the explicit form of its optimal approximation and the associated minimal α-affinity distance. In contrast to conventional approaches based on the diamond norm, our framework provides a systematic and analytically tractable approach to quantum channel approximation under realistic constraints.

quant-pharXiv:2606.05745•Jun 5, 2026•0 citations

Optimal convex approximations of qubit states based on l 1-norm of coherence

Li‐qiang Zhang, Yan-Dong 彦东 Du 杜, Chang‐shui Yu

Abstract Determining the minimal distance between the target state and the convex combination of given states is a fundamental problem in quantum resource theory, offering critical guidance for experimental implementations. In this paper, we embark on an in-depth exploration of the use of a quantum state prepared by the convex combination of given qubit states to optimally approximate the l 1-norm of coherence of the target quantum state, striving to make the prepared state and the target state as similar as possible. Here, we present the analytical solution for the optimal distance for any N given quantum states. We find that the optimal approximation problem for any N > 4 quantum states can be transformed into an optimal approximation problem for no more than four quantum states, which not only significantly streamlines the problem but also proves advantageous for laboratories in terms of material conservation. Ultimately, a one-to-one comparison between the analytical and numerical solutions verifies the effectiveness of our approach.

Chinese Physics B•Jul 3, 2025•0 citations
Complete optimal convex approximations of qubit states under B2B_2B2​ B 2 distance
We consider the optimal approximation of arbitrary qubit states with respect to an available states consisting the eigenstates of two of three Pauli matrices, the B2B_2B2​ -distance of an arbitrary target state. Both the analytical formulae of the B2B_2B2​ -distance and the corresponding complete optimal decompositions are obtained. The trade-off relations for both the sum and the squared sum of the B2B_2B2​ -distances have been analytically and numerically investigated.
Abstract Utilizing the l 1 norm as the quantum state distance metric, we consider the Pauli distance of arbitrary target quantum states, that is, the optimal convex approximation of any qubit mixed states relative to the available state of pairs of eigenstates in three Pauli matrices. We get the complete analytical expressions for B 1 -distance, B 2 -distance and B 3 -distance. We determine the parameter range for the optimal approximation of each B 2 -distance in eight distinct scenarios. Furthermore, some trade-off relations about B 2 -distances are also studied.
Abstract We investigate the optimal convex approximation, optimally approximating a desired and unavailable qubit state by the convex mixing of a given set of available states. When the available states are the eigenvectors of three Pauli matrices, we present the complete exact solution for the optimal convex approximation of an arbitrary qubit state based on the fidelity distance. By the comparison of optimal states based on fidelity and trace norm, the advantages and disadvantages of the optimal convex approximation are identified. Several examples are provided to support this. We also analyze the geometrical properties of the target states which can be completely represented by a set of available states. Using the feature of convex combination, we derive the maximum range of completely represented states and clearly illustrate that any qubit state can be optimally prepared by at most three available states in known useable states.
We consider the problem of optimally approximating an unavailable quantum state $\ensuremath{\rho}$ by the convex mixing of states drawn from a set of available states ${{\ensuremath{\nu}}_{i}}$. The problem is recast to look for the least distinguishable state from $\ensuremath{\rho}$ among the convex set ${\ensuremath{\sum}}_{i}{p}_{i}{\ensuremath{\nu}}_{i}$, and the corresponding optimal weights pi{{p}_{i}}pi​ provide the optimal convex mixing. We present the complete solution for the optimal convex approximation of a qubit mixed state when the set of available states comprises the three bases of the Pauli matrices.
Abstract Building upon the theoretical foundation of utilizing the eigenvectors of Pauli matrices for single-qubit quantum state preparation, we employ a set of easily preparable quantum states constructed from the eigenvectors of Pauli matrices and arbitrary real quantum logic gates. Using fidelity and trace norm as tools, we achieve the approximation of single-qubit quantum states. For different scenarios, we present complete exact solutions and analytical expressions for the optimal approximation. Furthermore, during the research, we investigated the comparative effectiveness of different distance metrics within the set B α Z for quantum state approximation. It was found that trace norm can approximate target state more easily than fidelity. This discovery significantly aids in the selection of measurement tools for quantum state approximation tasks.
Optimal convex approximation of quantum channels based on ααα-affinity
Determining the minimal distance between a target channel and a convex hull of predefined set of implementable channels is a fundamental problem in quantum resource theory, and provides key guidance for experimental implementations. In this work, we develop a unified analytical framework for optimal convex approximation of quantum channels based on the quantum ααα-affinity measure. We construct a channel distance metric induced by the α-affinity and the ChoiJamiolkowski isomorphism, which satisfies the required properties of a well-defined channel distance. Subsequently, we present an optimization framework for the convex approximation of quantum channels, and derive analytical solutions for the optimal convex approximation of single-qubit unitary channels over both the SU(2)-covariant and Pauli channel families, obtaining closed-form expressions for the optimal parameters and the minimal approximation distance. This framework is further applied to the amplitude-damping channel, yielding the explicit form of its optimal approximation and the associated minimal α-affinity distance. In contrast to conventional approaches based on the diamond norm, our framework provides a systematic and analytically tractable approach to quantum channel approximation under realistic constraints.
Abstract Determining the minimal distance between the target state and the convex combination of given states is a fundamental problem in quantum resource theory, offering critical guidance for experimental implementations. In this paper, we embark on an in-depth exploration of the use of a quantum state prepared by the convex combination of given qubit states to optimally approximate the l 1-norm of coherence of the target quantum state, striving to make the prepared state and the target state as similar as possible. Here, we present the analytical solution for the optimal distance for any N given quantum states. We find that the optimal approximation problem for any N > 4 quantum states can be transformed into an optimal approximation problem for no more than four quantum states, which not only significantly streamlines the problem but also proves advantageous for laboratories in terms of material conservation. Ultimately, a one-to-one comparison between the analytical and numerical solutions verifies the effectiveness of our approach.