The antioxidant of reduced glutathione（GSH） is the most abundant thiol in cells for the maintenance of the intracellular redox balance. The study aimed to assay the effect of sperm treatment with GSH before incubati...The antioxidant of reduced glutathione（GSH） is the most abundant thiol in cells for the maintenance of the intracellular redox balance. The study aimed to assay the effect of sperm treatment with GSH before incubation with oocytes on the development potential of embryos obtained by in vitro fertilization（IVF）. Also the mitochondrial membrane potential（ΔΨm）, plasma membrane integrity（viability）, DNA fragmentation, reactive oxygen species（ROS） content, superoxide dismutase（SOD）, catalase（CAT） and glutathione peroxidase（GPx） activities, methane dicarboxylic aldehyde（MDA） level as indices of lipid peroxidation in sex-sorted and unsorted sperm from three bulls were investigated using flow cytometry and enzyme-labeled instrument individually. The results showed that 2 mm ol L^–1 GSH increased significantly the cleavage rate（86.68% vs. 82.78%）, 4- to 8-cell rate（82.30% vs. 73.43%） and blastocyst rate（43.15% vs. 35.24%） of IVF embryos compared with untreated group. Furthermore, addition of GSH increased significantly the ΔΨm and viability, decreased the ratio of DNA fragmentation in sex-sorted or unsorted semen（P〈0.05）, except the sex-sorted semen from bull 019. Similarly, activities of SOD, CAT and GPx were increased significantly. However, the contents of MDA were decreased significantly both in sex-sorted and unsorted semen treated with GSH（P〈0.05）. These results suggest that sperm pretreatment with GSH during IVF can maintain better the viability and fertility of sperm through reducing apoptosis and increasing the antioxidant capacity, which improves the IVF embryos development.展开更多
An important and usual sort of search problems is to find all marked states from an unsorted database with a large number of states. Grover＇s original quantum search algorithm is for finding single marked state with ...An important and usual sort of search problems is to find all marked states from an unsorted database with a large number of states. Grover＇s original quantum search algorithm is for finding single marked state with uncertainty, and it has been generalized to the case of multiple marked states, as well as been modified to find single marked state with certainty. However, the query complexity for finding all multiple marked states has not been addressed. We use a generalized Long＇s algorithm with high precision to solve such a problem. We calculate the approximate query complexity, which increases with the number of marked states and with the precision that we demand. In the end we introduce an algorithm for the problem on a ＂duality computer＂ and show its advantage over other algorithms.展开更多
This paper provides an introduction to a quantum search algorithm,known as Grover’s Algorithm,for unsorted search purposes.The algorithm is implemented in a search space of 4 qubits using the Python-based Qiskit SDK ...This paper provides an introduction to a quantum search algorithm,known as Grover’s Algorithm,for unsorted search purposes.The algorithm is implemented in a search space of 4 qubits using the Python-based Qiskit SDK by IBM.While providing detailed proof,the computational complexity of the algorithm is generalized to n qubits.The implementation results obtained from the IBM QASM Simulator and IBMQ Santiago quantum backend are analyzed and compared.Finally,the paper discusses the challenges faced in implementation and real-life applications of the algorithm hitherto.Overall,the implementation and analysis depict the advantages of this quantum search algorithm over its classical counterparts.展开更多
基金supported by the grants from the National Science and Technology Support Program of China (2012BAD12B01)the Basic Research Fund of Institute of Animal Science, Chinese Academy of Agricultural Sciences (2013ywf-zd-2)+1 种基金the Agricultural Science and Technology Innovation Program, China (ASTIP-IAS06)the China Agriculture Research System (CARS-37)
文摘The antioxidant of reduced glutathione（GSH） is the most abundant thiol in cells for the maintenance of the intracellular redox balance. The study aimed to assay the effect of sperm treatment with GSH before incubation with oocytes on the development potential of embryos obtained by in vitro fertilization（IVF）. Also the mitochondrial membrane potential（ΔΨm）, plasma membrane integrity（viability）, DNA fragmentation, reactive oxygen species（ROS） content, superoxide dismutase（SOD）, catalase（CAT） and glutathione peroxidase（GPx） activities, methane dicarboxylic aldehyde（MDA） level as indices of lipid peroxidation in sex-sorted and unsorted sperm from three bulls were investigated using flow cytometry and enzyme-labeled instrument individually. The results showed that 2 mm ol L^–1 GSH increased significantly the cleavage rate（86.68% vs. 82.78%）, 4- to 8-cell rate（82.30% vs. 73.43%） and blastocyst rate（43.15% vs. 35.24%） of IVF embryos compared with untreated group. Furthermore, addition of GSH increased significantly the ΔΨm and viability, decreased the ratio of DNA fragmentation in sex-sorted or unsorted semen（P〈0.05）, except the sex-sorted semen from bull 019. Similarly, activities of SOD, CAT and GPx were increased significantly. However, the contents of MDA were decreased significantly both in sex-sorted and unsorted semen treated with GSH（P〈0.05）. These results suggest that sperm pretreatment with GSH during IVF can maintain better the viability and fertility of sperm through reducing apoptosis and increasing the antioxidant capacity, which improves the IVF embryos development.
基金4 Acknowledgements The author would like to thank G.L. Long for very helpful discussion, and thank J.Q. Yi for his generous help in plotting the function figures.
文摘An important and usual sort of search problems is to find all marked states from an unsorted database with a large number of states. Grover＇s original quantum search algorithm is for finding single marked state with uncertainty, and it has been generalized to the case of multiple marked states, as well as been modified to find single marked state with certainty. However, the query complexity for finding all multiple marked states has not been addressed. We use a generalized Long＇s algorithm with high precision to solve such a problem. We calculate the approximate query complexity, which increases with the number of marked states and with the precision that we demand. In the end we introduce an algorithm for the problem on a ＂duality computer＂ and show its advantage over other algorithms.
文摘This paper provides an introduction to a quantum search algorithm,known as Grover’s Algorithm,for unsorted search purposes.The algorithm is implemented in a search space of 4 qubits using the Python-based Qiskit SDK by IBM.While providing detailed proof,the computational complexity of the algorithm is generalized to n qubits.The implementation results obtained from the IBM QASM Simulator and IBMQ Santiago quantum backend are analyzed and compared.Finally,the paper discusses the challenges faced in implementation and real-life applications of the algorithm hitherto.Overall,the implementation and analysis depict the advantages of this quantum search algorithm over its classical counterparts.
