Is this you? As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.
Claim your profile
Articles by Yiting Su
On the Sulfide Oxidation to Sulfoxides using Na3VO4 in Water
On the Sulfide Oxidation to Sulfoxides using Na3VO4 in Water We report a simple and efficient Na₃VO₄-catalyzed oxidation of sulfides to sulfoxides in phosphate buffer. Optimized conditions enable broad substrate scope, including drug molecules. Isotope labeling confirms H₂O₂ as the oxygen donor. This cost-effective, green method offers a sustainable alternative for pharmaceutical and industrial sulfoxide synthesis. You have access to this article This article has not yet been cited.
Unconditionally Secure Quantum Bit Commitment and Quantum Oblivious Transfer
Paper 2023/1928 , Shenzhen University , Shenzhen University , Shenzhen University Recently, a novel secure quantum bit commitment (QBC) protocol has been proposed [29]. However, the protocol requires Alice and Bob to share Bell states in advance, making the protocol lacking in practicality. In this paper, we propose two new unconditionally secure quantum bit commitment protocols that do not require pre-shared Bell states based on entangled and non-entangled states, respectively.
GRA-Based Dynamic Hybrid Multi-Attribute Three-Way Decision-Making for the Performance Evaluation of Elderly-Care Services
Abstract : As an important branch of modern decision-making theory, multi-attribute decision-making (MADM) plays an important role in various fields. Classic MADM methods can provide a ranking of alternatives, and decision-makers need to evaluate the level subjectively based on the ranking results. Because of the limitation of knowledge, this is likely to lead to potential individual losses. Three-way decision (3WD) theory has good classification ability.
BQP $\neq$ QMA
Paper 2023/703 BQP $\neq$ QMA , Shenzhen University , Shenzhen University Abstract The relationship between complexity classes BQP and QMA is analogous to the relationship between P and NP. In this paper, we design a quantum bit commitment problem that is in QMA, but not in BQP. Therefore, it is proved that BQP $\neq$ QMA. That is, problems that are verifiable in quantum polynomial time are not necessarily solvable in quantum polynomial time, the quantum analog of P $\neq$ NP.
Secure Quantum Bit Commitment
Paper 2022/1238 Secure Quantum Bit Commitment , Shenzhen University , Shenzhen University , Sun Yat-sen University Abstract Bit commitment (BC) is one of the most important fundamental protocols in secure multi-party computation. However, it is generally believed that unconditionally secure bit commitment is impossible even with quantum resources.
Show More
loading
Actions
Is this you?
As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.Get in touch with Yiting
Contact Yiting, search articles and posts on X, monitor coverage, and track replies from one place.
Learn more about Muck Rack