Active distribution network(ADN)planning is crucial for achieving a cost-effective transition to modern power systems,yet it poses significant challenges as the system scale increases.The advent of quantum computing o...Active distribution network(ADN)planning is crucial for achieving a cost-effective transition to modern power systems,yet it poses significant challenges as the system scale increases.The advent of quantum computing offers a transformative approach to solve ADN planning.To fully leverage the potential of quantum computing,this paper proposes a photonic quantum acceleration algorithm.First,a quantum-accelerated framework for ADN planning is proposed on the basis of coherent photonic quantum computers.The ADN planning model is then formulated and decomposed into discrete master problems and continuous subproblems to facilitate the quantum optimization process.The photonic quantum-embedded adaptive alternating direction method of multipliers(PQA-ADMM)algorithm is subsequently proposed to equivalently map the discrete master problem onto a quantum-interpretable model,enabling its deployment on a photonic quantum computer.Finally,a comparative analysis with various solvers,including Gurobi,demonstrates that the proposed PQA-ADMM algorithm achieves significant speedup on the modified IEEE 33-node and IEEE 123-node systems,highlighting its effectiveness.展开更多
Although AI and quantum computing (QC) are fast emerging as key enablers of the future Internet, experts believe they pose an existential threat to humanity. Responding to the frenzied release of ChatGPT/GPT-4, thousa...Although AI and quantum computing (QC) are fast emerging as key enablers of the future Internet, experts believe they pose an existential threat to humanity. Responding to the frenzied release of ChatGPT/GPT-4, thousands of alarmed tech leaders recently signed an open letter to pause AI research to prepare for the catastrophic threats to humanity from uncontrolled AGI (Artificial General Intelligence). Perceived as an “epistemological nightmare”, AGI is believed to be on the anvil with GPT-5. Two computing rules appear responsible for these risks. 1) Mandatory third-party permissions that allow computers to run applications at the expense of introducing vulnerabilities. 2) The Halting Problem of Turing-complete AI programming languages potentially renders AGI unstoppable. The double whammy of these inherent weaknesses remains invincible under the legacy systems. A recent cybersecurity breakthrough shows that banning all permissions reduces the computer attack surface to zero, delivering a new zero vulnerability computing (ZVC) paradigm. Deploying ZVC and blockchain, this paper formulates and supports a hypothesis: “Safe, secure, ethical, controllable AGI/QC is possible by conquering the two unassailable rules of computability.” Pursued by a European consortium, testing/proving the proposed hypothesis will have a groundbreaking impact on the future digital infrastructure when AGI/QC starts powering the 75 billion internet devices by 2025.展开更多
In the effort to develop useful quantum computers,simulating quantum machines with conventional classical computing resources is a key capability.Such simulations will always face limits,preventing the emulation of qu...In the effort to develop useful quantum computers,simulating quantum machines with conventional classical computing resources is a key capability.Such simulations will always face limits,preventing the emulation of quantum computers at substantial scale;however,by pushing the envelope through optimal choices of algorithms and hardware,the value of simulator tools can be maximized.This work reviews state-of-the-art numerical simulation methods,i.e.,classical algorithms that emulate quantum computer evolution under specific operations.We focus on the mainstream state-vector and tensor-network paradigms,while briefly mentioning alternative methods.Moreover,we review the diverse applications of simulation across different facets of quantum computer development,including understanding the fundamental differences between quantum and classical computations,exploring algorithmic design for quantum advantage,predicting quantum processor performance at the design stage,and efficiently characterizing fabricated devices for rapid iterations.This review complements recent surveys of current tools and implementations;here,we aim to provide readers with an essential understanding of the theoretical basis of classical simulation methods,a detailed discussion of their advantages and limitations,and an overview of the demands and challenges arising from practical use cases.展开更多
Nonadiabatic holonomic quantum computers serve as the physical platform for nonadiabatic holonomic quantum computation.As quantum computation has entered the noisy intermediate-scale era,building accurate intermediate...Nonadiabatic holonomic quantum computers serve as the physical platform for nonadiabatic holonomic quantum computation.As quantum computation has entered the noisy intermediate-scale era,building accurate intermediate-scale nonadiabatic holo-nomic quantum computers is clearly necessary.Given that measurements are the sole means of extracting information,they play an indispensable role in nonadiabatic holonomic quantum computers.Accordingly,developing methods to reduce measurement errors in nonadiabatic holonomic quantum computers is of great importance.However,while much attention has been given to the research on nonadiabatic holonomic gates,the research on reducing measurement errors in nonadiabatic holonomic quantum computers is severely lacking.In this study,we propose a measurement error reduction method tailored for intermediate-scale nonadiabatic holonomic quantum computers.The reason we say this is because our method can not only reduce the measurement errors in the computer but also be useful in mitigating errors originating from nonadiabatic holonomic gates.Given these features,our method significantly advances the construction of accurate intermediate-scale nonadiabatic holonomic quantum computers.展开更多
Classical computation of electronic properties in large-scale materials remains challenging.Quantum computation has the potential to offer advantages in memory footprint and computational scaling.However,general and v...Classical computation of electronic properties in large-scale materials remains challenging.Quantum computation has the potential to offer advantages in memory footprint and computational scaling.However,general and viable quantum algorithms for simulating large-scale materials are still limited.We propose and implement random-state quantum algorithms to calculate electronic-structure properties of real materials.Using a random state circuit on a small number of qubits,we employ real-time evolution with first-order Trotter decomposition and Hadamard test to obtain electronic density of states,and we develop a modified quantum phase estimation algorithm to calculate real-space local density of states via direct quantum measurements.Furthermore,we validate these algorithms by numerically computing the density of states and spatial distributions of electronic states in graphene,twisted bilayer graphene quasicrystals,and fractal lattices,covering system sizes from hundreds to thousands of atoms.Our results manifest that the random-state quantum algorithms provide a general and qubit-efficient route to scalable simulations of electronic properties in large-scale periodic and aperiodic materials.展开更多
As an important index to measure the degree of entanglement in quantum systems,concurrence plays an important role in practical research.In this paper,we study the concurrence between two qubits in triangular triple q...As an important index to measure the degree of entanglement in quantum systems,concurrence plays an important role in practical research.In this paper,we study the concurrence between two qubits in triangular triple quantum dot structure.Through calculation and simulation,it is found that concurrence is mainly affected by the interdot coupling strength t,Coulomb interactionU,temperature T,and electrode coupling G.Through comparative studies with parallel triple quantum dot structures,we demonstrate that the triangular geometry exhibits significantly enhanced concurrence under identical conditions.In addition,under the condition that concurrence exceeds 0.9,the functional relationship between t and U is obtained through simulation,which provides theoretical support for quantum dot regulation under high entanglement.Finally,we demonstrate the feasibility of implementing a three-qubit quantum gate,using the Toffoli gate as a representative example,under the condition that the triangular triple quantum dot system maintains high entanglement.展开更多
The advent of quantum computing poses a significant challenge to traditional cryptographic protocols,particularly those used in SecureMultiparty Computation(MPC),a fundamental cryptographic primitive for privacypreser...The advent of quantum computing poses a significant challenge to traditional cryptographic protocols,particularly those used in SecureMultiparty Computation(MPC),a fundamental cryptographic primitive for privacypreserving computation.Classical MPC relies on cryptographic techniques such as homomorphic encryption,secret sharing,and oblivious transfer,which may become vulnerable in the post-quantum era due to the computational power of quantum adversaries.This study presents a review of 140 peer-reviewed articles published between 2000 and 2025 that used different databases like MDPI,IEEE Explore,Springer,and Elsevier,examining the applications,types,and security issues with the solution of Quantum computing in different fields.This review explores the impact of quantum computing on MPC security,assesses emerging quantum-resistant MPC protocols,and examines hybrid classicalquantum approaches aimed at mitigating quantum threats.We analyze the role of Quantum Key Distribution(QKD),post-quantum cryptography(PQC),and quantum homomorphic encryption in securing multiparty computations.Additionally,we discuss the challenges of scalability,computational efficiency,and practical deployment of quantumsecure MPC frameworks in real-world applications such as privacy-preserving AI,secure blockchain transactions,and confidential data analysis.This review provides insights into the future research directions and open challenges in ensuring secure,scalable,and quantum-resistant multiparty computation.展开更多
Efficient implementation of fundamental matrix operations on quantum computers,such as matrix products and Hadamard operations,holds significant potential for accelerating machine learning algorithms.A critical prereq...Efficient implementation of fundamental matrix operations on quantum computers,such as matrix products and Hadamard operations,holds significant potential for accelerating machine learning algorithms.A critical prerequisite for quantum implementations is the effective encoding of classical data into quantum states.We propose two quantum computing frameworks for preparing the distinct encoded states corresponding to matrix operations,including the matrix product,matrix sum,matrix Hadamard product and division.Quantum algorithms based on the digital encoding computing framework are capable of implementing the matrix Hadamard operation with a time complexity of O(poly log(mn/ε))and the matrix product with a time complexity of O(poly log(mnl/ε)),achieving an exponential speedup in contrast to the classical methods of O(mn)and O(mnl).Quantum algorithms based on the analog-encoding framework are capable of implementing the matrix Hadamard operation with a time complexity of O(k_(1)√mn·poly log(mn/ε))and the matrix product with a time complexity of O(k_(2)√1·poly log(mnl/ε)),where k_(1)and k_(2)are coefficients correlated with the elements of the matrix,achieving a square speedup in contrast to the classical counterparts.As applications,we construct an oracle that can access the trace of a matrix within logarithmic time,and propose several algorithms to respectively estimate the trace of a matrix,the trace of the product of two matrices,and the trace inner product of two matrices within logarithmic time.展开更多
The increasing popularity of quantum computing has resulted in a considerable rise in demand for cloud quantum computing usage in recent years.Nevertheless,the rapid surge in demand for cloud-based quantum computing r...The increasing popularity of quantum computing has resulted in a considerable rise in demand for cloud quantum computing usage in recent years.Nevertheless,the rapid surge in demand for cloud-based quantum computing resources has led to a scarcity.In order to meet the needs of an increasing number of researchers,it is imperative to facilitate efficient and flexible access to computing resources in a cloud environment.In this paper,we propose a novel quantum computing paradigm,Virtual QPU(VQPU),which addresses this issue and enhances quantum cloud throughput with guaranteed circuit fidelity.The proposal introduces three innovative concepts:(1)The integration of virtualization technology into the field of quantum computing to enhance quantum cloud throughput.(2)The introduction of an asynchronous execution of circuits methodology to improve quantum computing flexibility.(3)The development of a virtual QPU allocation scheme for quantum tasks in a cloud environment to improve circuit fidelity.The concepts have been validated through the utilization of a self-built simulated quantum cloud platform.展开更多
Reservoir engineering has been widely used in various quantum technologies.Based on a cavity-QED(quantum electrodynamics)model,we propose a potentially practical scheme using squeezed-vacuum reservoir engineering to o...Reservoir engineering has been widely used in various quantum technologies.Based on a cavity-QED(quantum electrodynamics)model,we propose a potentially practical scheme using squeezed-vacuum reservoir engineering to optimize the performance of a quantum battery(QB)located inside a cavity driven by a broadband squeezed laser,which acts as a squeezed-vacuum reservoir.Using the reduced master equation of the QB obtained via the adiabatic elimination method,we focus on the QB's charging dynamics under tunable squeezed reservoirs governed by parametrically controlled squeezing parameters,which dictate the efficiency of energy transfer and the extractable work(ergotropy)of the QB.We show that increasing the squeezing strength improves the charging rate and enables rapid energy transfer,whereas the steady-state energy of the QB saturates at specific values of the squeezing parameter.Notably,the ergotropy of the QB reaches its maximum at a critical squeezing strength and does not scale monotonically with the squeezing strength.This nonmonotonic behavior underscores the existence of optimal parameter regimes,through which the performance of the QB can be significantly enhanced.展开更多
In the 9 December 2024 issue of Nature[1],a team of Google engineers reported breakthrough results using“Willow”,their lat-est quantum computing chip(Fig.1).By meeting a milestone“below threshold”reduction in the ...In the 9 December 2024 issue of Nature[1],a team of Google engineers reported breakthrough results using“Willow”,their lat-est quantum computing chip(Fig.1).By meeting a milestone“below threshold”reduction in the rate of errors that plague super-conducting circuit-based quantum computing systems(Fig.2),the work moves the field another step towards its promised super-charged applications,albeit likely still many years away.Areas expected to benefit from quantum computing include,among others,drug discovery,materials science,finance,cybersecurity,and machine learning.展开更多
The rapid advancement of quantum computing has sparked a considerable increase in research attention to quantum technologies.These advances span fundamental theoretical inquiries into quantum information and the explo...The rapid advancement of quantum computing has sparked a considerable increase in research attention to quantum technologies.These advances span fundamental theoretical inquiries into quantum information and the exploration of diverse applications arising from this evolving quantum computing paradigm.The scope of the related research is notably diverse.This paper consolidates and presents quantum computing research related to the financial sector.The finance applications considered in this study include portfolio optimization,fraud detection,and Monte Carlo methods for derivative pricing and risk calculation.In addition,we provide a comprehensive analysis of quantum computing’s applications and effects on blockchain technologies,particularly in relation to cryptocurrencies,which are central to financial technology research.As discussed in this study,quantum computing applications in finance are based on fundamental quantum physics principles and key quantum algorithms.This review aims to bridge the research gap between quantum computing and finance.We adopt a two-fold methodology,involving an analysis of quantum algorithms,followed by a discussion of their applications in specific financial contexts.Our study is based on an extensive review of online academic databases,search tools,online journal repositories,and whitepapers from 1952 to 2023,including CiteSeerX,DBLP,Research-Gate,Semantic Scholar,and scientific conference publications.We present state-of-theart findings at the intersection of finance and quantum technology and highlight open research questions that will be valuable for industry practitioners and academicians as they shape future research agendas.展开更多
With a paper published in the 19 February 2025 issue of Nature[1],Microsoft(Redmond,WA,USA)fanned the flames of its unique vision for quantum computing:a stable,error-resistant qubit based on the Majorana fermion,one ...With a paper published in the 19 February 2025 issue of Nature[1],Microsoft(Redmond,WA,USA)fanned the flames of its unique vision for quantum computing:a stable,error-resistant qubit based on the Majorana fermion,one of the strangest and most elusive particles in physics.The Microsoft Azure Quantum research team’s descriptions of a means to detect the as-yet theoretical particles[1]—called“an entirely new state of matter”by Microsoft’s chief executive officer[2]—and a design for a chip powered by them(Fig.1)[3]have refocused attention on the company’s ambition to build a topological quantum computer.The approach—if it works—could potentially leapfrog every other in the field.展开更多
Privacy-Preserving Computation(PPC)comprises the techniques,schemes and protocols which ensure privacy and confidentiality in the context of secure computation and data analysis.Most of the current PPC techniques rely...Privacy-Preserving Computation(PPC)comprises the techniques,schemes and protocols which ensure privacy and confidentiality in the context of secure computation and data analysis.Most of the current PPC techniques rely on the complexity of cryptographic operations,which are expected to be efficiently solved by quantum computers soon.This review explores how PPC can be built on top of quantum computing itself to alleviate these future threats.We analyze quantum proposals for Secure Multi-party Computation,Oblivious Transfer and Homomorphic Encryption from the last decade focusing on their maturity and the challenges they currently face.Our findings show a strong focus on purely theoretical works,but a rise on the experimental consideration of these techniques in the last 5 years.The applicability of these techniques to actual use cases is an underexplored aspect which could lead to the practical assessment of these techniques.展开更多
A team of researchers from the University of Science and Technology of China(USTC)of the Chinese Academy of Sciences(CAS)and its partners have made significant advancements in random quantum circuit sampling with Zuch...A team of researchers from the University of Science and Technology of China(USTC)of the Chinese Academy of Sciences(CAS)and its partners have made significant advancements in random quantum circuit sampling with Zuchongzhi-3,a superconducting quantum computing prototype featuring 105 qubits and 182 couplers.展开更多
As a common foodborne pathogen,Salmonella poses risks to public health safety,common given the emergence of antimicrobial-resistant strains.However,there is currently a lack of systematic platforms based on large lang...As a common foodborne pathogen,Salmonella poses risks to public health safety,common given the emergence of antimicrobial-resistant strains.However,there is currently a lack of systematic platforms based on large language models(LLMs)for Salmonella resistance prediction,data presentation,and data sharing.To overcome this issue,we firstly propose a two-step feature-selection process based on the chi-square test and conditional mutual information maximization to find the key Salmonella resistance genes in a pan-genomics analysis and develop an LLM-based Salmonella antimicrobial-resistance predictive(SARPLLM)algorithm to achieve accurate antimicrobial-resistance prediction,based on Qwen2 LLM and low-rank adaptation.Secondly,we optimize the time complexity to compute the sample distance from the linear to logarithmic level by constructing a quantum data augmentation algorithm denoted as QSMOTEN.Thirdly,we build up a user-friendly Salmonella antimicrobial-resistance predictive online platform based on knowledge graphs,which not only facilitates online resistance prediction for users but also visualizes the pan-genomics analysis results of the Salmonella datasets.展开更多
Effective resource management in the Internet of Things and fog computing is essential for efficient and scalable networks.However,existing methods often fail in dynamic and high-demand environments,leading to resourc...Effective resource management in the Internet of Things and fog computing is essential for efficient and scalable networks.However,existing methods often fail in dynamic and high-demand environments,leading to resource bottlenecks and increased energy consumption.This study aims to address these limitations by proposing the Quantum Inspired Adaptive Resource Management(QIARM)model,which introduces novel algorithms inspired by quantum principles for enhanced resource allocation.QIARM employs a quantum superposition-inspired technique for multi-state resource representation and an adaptive learning component to adjust resources in real time dynamically.In addition,an energy-aware scheduling module minimizes power consumption by selecting optimal configurations based on energy metrics.The simulation was carried out in a 360-minute environment with eight distinct scenarios.This study introduces a novel quantum-inspired resource management framework that achieves up to 98%task offload success and reduces energy consumption by 20%,addressing critical challenges of scalability and efficiency in dynamic fog computing environments.展开更多
Distributed Quantum Computing(DQC)provides a means for scaling available quantum computation by interconnecting multiple quantum processor units(QPUs).A key challenge in this domain is efficiently allocating logical q...Distributed Quantum Computing(DQC)provides a means for scaling available quantum computation by interconnecting multiple quantum processor units(QPUs).A key challenge in this domain is efficiently allocating logical qubits from quantum circuits to the physical qubits within QPUs,a task known to be NP-hard.Traditional approaches,primarily focused on graph partitioning strategies,have sought to reduce the number of required Bell pairs for executing non-local CNOT operations,a form of gate teleportation.However,these methods have limitations in terms of efficiency and scalability.Addressing this,our work jointly considers gate and qubit teleportations introducing a novel meta-heuristic algorithm to minimise the network cost of executing a quantum circuit.By allowing dynamic reallocation of qubits along with gate teleportations during circuit execution,our method significantly enhances the overall efficacy and potential scalability of DQC frameworks.In our numerical analysis,we demonstrate that integrating qubit teleportations into our genetic algorithm for optimizing circuit blocking reduces the required resources,specifically the number of EPR pairs,compared to traditional graph partitioning methods.Our results,derived fromboth benchmark and randomly generated circuits,show that as circuit complexity increases—demanding more qubit teleportations—our approach effectively optimises these teleportations throughout the execution,thereby enhancing performance through strategic circuit partitioning.This is a step forward in the pursuit of a global quantum compiler which will ultimately enable the efficient use of a‘quantum data center’in the future.展开更多
This paper investigates Windfarm Layout Optimization(WFLO),where we formulate turbine placement considering wake effects as a Quadratic Unconstrained Binary Optimization(QUBO)problem.Wind energy plays a critical role ...This paper investigates Windfarm Layout Optimization(WFLO),where we formulate turbine placement considering wake effects as a Quadratic Unconstrained Binary Optimization(QUBO)problem.Wind energy plays a critical role in the transition toward sustainable power systems,but the optimal placement of turbines remains a challenging combinatorial problem due to complex wake interactions.With recent advances in quantum computing,there is growing interest in exploring whether hybrid quantum-classical methods can provide advantages for such computationally intensive tasks.We investigate solving the resulting QUBO problem using the Variational Quantum Eigensolver(VQE)implemented onQiskit’s quantum computer simulator,employing a quantum noise-free,gate-based circuit model.Three classical optimizers are discussed,with a detailed analysis of the two most effective approaches:Constrained Optimization BY Linear Approximation(COBYLA)and Bayesian Optimization(BO).We compare these simulated quantum results with two established classical optimization methods:Simulated Annealing(SA)and the Gurobi solver.The study focuses on 4×4 grid configurations(requiring 16 qubits),providing insights into near-term quantum algorithm applicability for renewable energy optimization.展开更多
We present a robust quantum optimal control framework for implementing fast entangling gates on ion-trap quantum processors.The framework leverages tailored laser pulses to drive the multiple vibrational sidebands of ...We present a robust quantum optimal control framework for implementing fast entangling gates on ion-trap quantum processors.The framework leverages tailored laser pulses to drive the multiple vibrational sidebands of the ions to create phonon-mediated entangling gates and,unlike the state of the art,requires neither weakcoupling Lamb-Dicke approximation nor perturbation treatment.With the application of gradient-based optimal control,it enables finding amplitude-and phase-modulated laser control protocols that work without the Lamb-Dicke approximation,promising gate speeds on the order of microseconds comparable to the characteristic trap frequencies.Also,robustness requirements on the temperature of the ions and initial optical phase can be conveniently included to pursue high-quality fast gates against experimental imperfections.Our approach represents a step in speeding up quantum gates to achieve larger quantum circuits for quantum computation and simulation,and thus can find applications in near-future experiments.展开更多
基金supported in part by the National Natural Science Foundation of China under Grant 52307134the Fundamental Research Funds for the Central Universities(xzy012025022)。
文摘Active distribution network(ADN)planning is crucial for achieving a cost-effective transition to modern power systems,yet it poses significant challenges as the system scale increases.The advent of quantum computing offers a transformative approach to solve ADN planning.To fully leverage the potential of quantum computing,this paper proposes a photonic quantum acceleration algorithm.First,a quantum-accelerated framework for ADN planning is proposed on the basis of coherent photonic quantum computers.The ADN planning model is then formulated and decomposed into discrete master problems and continuous subproblems to facilitate the quantum optimization process.The photonic quantum-embedded adaptive alternating direction method of multipliers(PQA-ADMM)algorithm is subsequently proposed to equivalently map the discrete master problem onto a quantum-interpretable model,enabling its deployment on a photonic quantum computer.Finally,a comparative analysis with various solvers,including Gurobi,demonstrates that the proposed PQA-ADMM algorithm achieves significant speedup on the modified IEEE 33-node and IEEE 123-node systems,highlighting its effectiveness.
文摘Although AI and quantum computing (QC) are fast emerging as key enablers of the future Internet, experts believe they pose an existential threat to humanity. Responding to the frenzied release of ChatGPT/GPT-4, thousands of alarmed tech leaders recently signed an open letter to pause AI research to prepare for the catastrophic threats to humanity from uncontrolled AGI (Artificial General Intelligence). Perceived as an “epistemological nightmare”, AGI is believed to be on the anvil with GPT-5. Two computing rules appear responsible for these risks. 1) Mandatory third-party permissions that allow computers to run applications at the expense of introducing vulnerabilities. 2) The Halting Problem of Turing-complete AI programming languages potentially renders AGI unstoppable. The double whammy of these inherent weaknesses remains invincible under the legacy systems. A recent cybersecurity breakthrough shows that banning all permissions reduces the computer attack surface to zero, delivering a new zero vulnerability computing (ZVC) paradigm. Deploying ZVC and blockchain, this paper formulates and supports a hypothesis: “Safe, secure, ethical, controllable AGI/QC is possible by conquering the two unassailable rules of computability.” Pursued by a European consortium, testing/proving the proposed hypothesis will have a groundbreaking impact on the future digital infrastructure when AGI/QC starts powering the 75 billion internet devices by 2025.
基金supported by the National Natural Science Foundation of China(12325501 and 12447101).
文摘In the effort to develop useful quantum computers,simulating quantum machines with conventional classical computing resources is a key capability.Such simulations will always face limits,preventing the emulation of quantum computers at substantial scale;however,by pushing the envelope through optimal choices of algorithms and hardware,the value of simulator tools can be maximized.This work reviews state-of-the-art numerical simulation methods,i.e.,classical algorithms that emulate quantum computer evolution under specific operations.We focus on the mainstream state-vector and tensor-network paradigms,while briefly mentioning alternative methods.Moreover,we review the diverse applications of simulation across different facets of quantum computer development,including understanding the fundamental differences between quantum and classical computations,exploring algorithmic design for quantum advantage,predicting quantum processor performance at the design stage,and efficiently characterizing fabricated devices for rapid iterations.This review complements recent surveys of current tools and implementations;here,we aim to provide readers with an essential understanding of the theoretical basis of classical simulation methods,a detailed discussion of their advantages and limitations,and an overview of the demands and challenges arising from practical use cases.
基金supported by the National Natural Science Foundation of China(Grant No.12174224)。
文摘Nonadiabatic holonomic quantum computers serve as the physical platform for nonadiabatic holonomic quantum computation.As quantum computation has entered the noisy intermediate-scale era,building accurate intermediate-scale nonadiabatic holo-nomic quantum computers is clearly necessary.Given that measurements are the sole means of extracting information,they play an indispensable role in nonadiabatic holonomic quantum computers.Accordingly,developing methods to reduce measurement errors in nonadiabatic holonomic quantum computers is of great importance.However,while much attention has been given to the research on nonadiabatic holonomic gates,the research on reducing measurement errors in nonadiabatic holonomic quantum computers is severely lacking.In this study,we propose a measurement error reduction method tailored for intermediate-scale nonadiabatic holonomic quantum computers.The reason we say this is because our method can not only reduce the measurement errors in the computer but also be useful in mitigating errors originating from nonadiabatic holonomic gates.Given these features,our method significantly advances the construction of accurate intermediate-scale nonadiabatic holonomic quantum computers.
基金supported by the Major Project for the Integration of ScienceEducation and Industry (Grant No.2025ZDZX02)。
文摘Classical computation of electronic properties in large-scale materials remains challenging.Quantum computation has the potential to offer advantages in memory footprint and computational scaling.However,general and viable quantum algorithms for simulating large-scale materials are still limited.We propose and implement random-state quantum algorithms to calculate electronic-structure properties of real materials.Using a random state circuit on a small number of qubits,we employ real-time evolution with first-order Trotter decomposition and Hadamard test to obtain electronic density of states,and we develop a modified quantum phase estimation algorithm to calculate real-space local density of states via direct quantum measurements.Furthermore,we validate these algorithms by numerically computing the density of states and spatial distributions of electronic states in graphene,twisted bilayer graphene quasicrystals,and fractal lattices,covering system sizes from hundreds to thousands of atoms.Our results manifest that the random-state quantum algorithms provide a general and qubit-efficient route to scalable simulations of electronic properties in large-scale periodic and aperiodic materials.
文摘As an important index to measure the degree of entanglement in quantum systems,concurrence plays an important role in practical research.In this paper,we study the concurrence between two qubits in triangular triple quantum dot structure.Through calculation and simulation,it is found that concurrence is mainly affected by the interdot coupling strength t,Coulomb interactionU,temperature T,and electrode coupling G.Through comparative studies with parallel triple quantum dot structures,we demonstrate that the triangular geometry exhibits significantly enhanced concurrence under identical conditions.In addition,under the condition that concurrence exceeds 0.9,the functional relationship between t and U is obtained through simulation,which provides theoretical support for quantum dot regulation under high entanglement.Finally,we demonstrate the feasibility of implementing a three-qubit quantum gate,using the Toffoli gate as a representative example,under the condition that the triangular triple quantum dot system maintains high entanglement.
文摘The advent of quantum computing poses a significant challenge to traditional cryptographic protocols,particularly those used in SecureMultiparty Computation(MPC),a fundamental cryptographic primitive for privacypreserving computation.Classical MPC relies on cryptographic techniques such as homomorphic encryption,secret sharing,and oblivious transfer,which may become vulnerable in the post-quantum era due to the computational power of quantum adversaries.This study presents a review of 140 peer-reviewed articles published between 2000 and 2025 that used different databases like MDPI,IEEE Explore,Springer,and Elsevier,examining the applications,types,and security issues with the solution of Quantum computing in different fields.This review explores the impact of quantum computing on MPC security,assesses emerging quantum-resistant MPC protocols,and examines hybrid classicalquantum approaches aimed at mitigating quantum threats.We analyze the role of Quantum Key Distribution(QKD),post-quantum cryptography(PQC),and quantum homomorphic encryption in securing multiparty computations.Additionally,we discuss the challenges of scalability,computational efficiency,and practical deployment of quantumsecure MPC frameworks in real-world applications such as privacy-preserving AI,secure blockchain transactions,and confidential data analysis.This review provides insights into the future research directions and open challenges in ensuring secure,scalable,and quantum-resistant multiparty computation.
基金Project supported by the National Natural Science Foundation of China(Grant No.61573266)the Natural Science Basic Research Program of Shaanxi(Grant No.2021JM-133)the Fundamental Research Funds for the Central Universities and the Innovation Fund of Xidian University(Grant No.YJSJ25009)。
文摘Efficient implementation of fundamental matrix operations on quantum computers,such as matrix products and Hadamard operations,holds significant potential for accelerating machine learning algorithms.A critical prerequisite for quantum implementations is the effective encoding of classical data into quantum states.We propose two quantum computing frameworks for preparing the distinct encoded states corresponding to matrix operations,including the matrix product,matrix sum,matrix Hadamard product and division.Quantum algorithms based on the digital encoding computing framework are capable of implementing the matrix Hadamard operation with a time complexity of O(poly log(mn/ε))and the matrix product with a time complexity of O(poly log(mnl/ε)),achieving an exponential speedup in contrast to the classical methods of O(mn)and O(mnl).Quantum algorithms based on the analog-encoding framework are capable of implementing the matrix Hadamard operation with a time complexity of O(k_(1)√mn·poly log(mn/ε))and the matrix product with a time complexity of O(k_(2)√1·poly log(mnl/ε)),where k_(1)and k_(2)are coefficients correlated with the elements of the matrix,achieving a square speedup in contrast to the classical counterparts.As applications,we construct an oracle that can access the trace of a matrix within logarithmic time,and propose several algorithms to respectively estimate the trace of a matrix,the trace of the product of two matrices,and the trace inner product of two matrices within logarithmic time.
文摘The increasing popularity of quantum computing has resulted in a considerable rise in demand for cloud quantum computing usage in recent years.Nevertheless,the rapid surge in demand for cloud-based quantum computing resources has led to a scarcity.In order to meet the needs of an increasing number of researchers,it is imperative to facilitate efficient and flexible access to computing resources in a cloud environment.In this paper,we propose a novel quantum computing paradigm,Virtual QPU(VQPU),which addresses this issue and enhances quantum cloud throughput with guaranteed circuit fidelity.The proposal introduces three innovative concepts:(1)The integration of virtualization technology into the field of quantum computing to enhance quantum cloud throughput.(2)The introduction of an asynchronous execution of circuits methodology to improve quantum computing flexibility.(3)The development of a virtual QPU allocation scheme for quantum tasks in a cloud environment to improve circuit fidelity.The concepts have been validated through the utilization of a self-built simulated quantum cloud platform.
基金supported by the National Natural Science Foundation of China(Grants No.12274422)the Natural Science Foundation of Hubei Province(Grant No.2022CFA013)support from A*STAR(Grant Nos.C230917003 and C230917007)。
文摘Reservoir engineering has been widely used in various quantum technologies.Based on a cavity-QED(quantum electrodynamics)model,we propose a potentially practical scheme using squeezed-vacuum reservoir engineering to optimize the performance of a quantum battery(QB)located inside a cavity driven by a broadband squeezed laser,which acts as a squeezed-vacuum reservoir.Using the reduced master equation of the QB obtained via the adiabatic elimination method,we focus on the QB's charging dynamics under tunable squeezed reservoirs governed by parametrically controlled squeezing parameters,which dictate the efficiency of energy transfer and the extractable work(ergotropy)of the QB.We show that increasing the squeezing strength improves the charging rate and enables rapid energy transfer,whereas the steady-state energy of the QB saturates at specific values of the squeezing parameter.Notably,the ergotropy of the QB reaches its maximum at a critical squeezing strength and does not scale monotonically with the squeezing strength.This nonmonotonic behavior underscores the existence of optimal parameter regimes,through which the performance of the QB can be significantly enhanced.
文摘In the 9 December 2024 issue of Nature[1],a team of Google engineers reported breakthrough results using“Willow”,their lat-est quantum computing chip(Fig.1).By meeting a milestone“below threshold”reduction in the rate of errors that plague super-conducting circuit-based quantum computing systems(Fig.2),the work moves the field another step towards its promised super-charged applications,albeit likely still many years away.Areas expected to benefit from quantum computing include,among others,drug discovery,materials science,finance,cybersecurity,and machine learning.
基金Gerhard Hellstern is partly funded by the Ministry of Economic Affairs,Labour and Tourism Baden-Württemberg in the frame of the Competence Center Quantum Computing Baden-Württemberg(QORA Ⅱ).
文摘The rapid advancement of quantum computing has sparked a considerable increase in research attention to quantum technologies.These advances span fundamental theoretical inquiries into quantum information and the exploration of diverse applications arising from this evolving quantum computing paradigm.The scope of the related research is notably diverse.This paper consolidates and presents quantum computing research related to the financial sector.The finance applications considered in this study include portfolio optimization,fraud detection,and Monte Carlo methods for derivative pricing and risk calculation.In addition,we provide a comprehensive analysis of quantum computing’s applications and effects on blockchain technologies,particularly in relation to cryptocurrencies,which are central to financial technology research.As discussed in this study,quantum computing applications in finance are based on fundamental quantum physics principles and key quantum algorithms.This review aims to bridge the research gap between quantum computing and finance.We adopt a two-fold methodology,involving an analysis of quantum algorithms,followed by a discussion of their applications in specific financial contexts.Our study is based on an extensive review of online academic databases,search tools,online journal repositories,and whitepapers from 1952 to 2023,including CiteSeerX,DBLP,Research-Gate,Semantic Scholar,and scientific conference publications.We present state-of-theart findings at the intersection of finance and quantum technology and highlight open research questions that will be valuable for industry practitioners and academicians as they shape future research agendas.
文摘With a paper published in the 19 February 2025 issue of Nature[1],Microsoft(Redmond,WA,USA)fanned the flames of its unique vision for quantum computing:a stable,error-resistant qubit based on the Majorana fermion,one of the strangest and most elusive particles in physics.The Microsoft Azure Quantum research team’s descriptions of a means to detect the as-yet theoretical particles[1]—called“an entirely new state of matter”by Microsoft’s chief executive officer[2]—and a design for a chip powered by them(Fig.1)[3]have refocused attention on the company’s ambition to build a topological quantum computer.The approach—if it works—could potentially leapfrog every other in the field.
基金supported by the Basque Government through the ELKARTEK program for Research and Innovation,under the BRTAQUANTUM project(Grant Agreement No.KK-2022/00041)。
文摘Privacy-Preserving Computation(PPC)comprises the techniques,schemes and protocols which ensure privacy and confidentiality in the context of secure computation and data analysis.Most of the current PPC techniques rely on the complexity of cryptographic operations,which are expected to be efficiently solved by quantum computers soon.This review explores how PPC can be built on top of quantum computing itself to alleviate these future threats.We analyze quantum proposals for Secure Multi-party Computation,Oblivious Transfer and Homomorphic Encryption from the last decade focusing on their maturity and the challenges they currently face.Our findings show a strong focus on purely theoretical works,but a rise on the experimental consideration of these techniques in the last 5 years.The applicability of these techniques to actual use cases is an underexplored aspect which could lead to the practical assessment of these techniques.
文摘A team of researchers from the University of Science and Technology of China(USTC)of the Chinese Academy of Sciences(CAS)and its partners have made significant advancements in random quantum circuit sampling with Zuchongzhi-3,a superconducting quantum computing prototype featuring 105 qubits and 182 couplers.
基金supported by the National Science and Technology Major Project(2021YFF1201200)the National Natural Science Foundation of China(62372316)the Sichuan Science and Technology Program key project(2024YFHZ0091).
文摘As a common foodborne pathogen,Salmonella poses risks to public health safety,common given the emergence of antimicrobial-resistant strains.However,there is currently a lack of systematic platforms based on large language models(LLMs)for Salmonella resistance prediction,data presentation,and data sharing.To overcome this issue,we firstly propose a two-step feature-selection process based on the chi-square test and conditional mutual information maximization to find the key Salmonella resistance genes in a pan-genomics analysis and develop an LLM-based Salmonella antimicrobial-resistance predictive(SARPLLM)algorithm to achieve accurate antimicrobial-resistance prediction,based on Qwen2 LLM and low-rank adaptation.Secondly,we optimize the time complexity to compute the sample distance from the linear to logarithmic level by constructing a quantum data augmentation algorithm denoted as QSMOTEN.Thirdly,we build up a user-friendly Salmonella antimicrobial-resistance predictive online platform based on knowledge graphs,which not only facilitates online resistance prediction for users but also visualizes the pan-genomics analysis results of the Salmonella datasets.
基金funded by Researchers Supporting Project Number(RSPD2025R947)King Saud University,Riyadh,Saudi Arabia.
文摘Effective resource management in the Internet of Things and fog computing is essential for efficient and scalable networks.However,existing methods often fail in dynamic and high-demand environments,leading to resource bottlenecks and increased energy consumption.This study aims to address these limitations by proposing the Quantum Inspired Adaptive Resource Management(QIARM)model,which introduces novel algorithms inspired by quantum principles for enhanced resource allocation.QIARM employs a quantum superposition-inspired technique for multi-state resource representation and an adaptive learning component to adjust resources in real time dynamically.In addition,an energy-aware scheduling module minimizes power consumption by selecting optimal configurations based on energy metrics.The simulation was carried out in a 360-minute environment with eight distinct scenarios.This study introduces a novel quantum-inspired resource management framework that achieves up to 98%task offload success and reduces energy consumption by 20%,addressing critical challenges of scalability and efficiency in dynamic fog computing environments.
文摘Distributed Quantum Computing(DQC)provides a means for scaling available quantum computation by interconnecting multiple quantum processor units(QPUs).A key challenge in this domain is efficiently allocating logical qubits from quantum circuits to the physical qubits within QPUs,a task known to be NP-hard.Traditional approaches,primarily focused on graph partitioning strategies,have sought to reduce the number of required Bell pairs for executing non-local CNOT operations,a form of gate teleportation.However,these methods have limitations in terms of efficiency and scalability.Addressing this,our work jointly considers gate and qubit teleportations introducing a novel meta-heuristic algorithm to minimise the network cost of executing a quantum circuit.By allowing dynamic reallocation of qubits along with gate teleportations during circuit execution,our method significantly enhances the overall efficacy and potential scalability of DQC frameworks.In our numerical analysis,we demonstrate that integrating qubit teleportations into our genetic algorithm for optimizing circuit blocking reduces the required resources,specifically the number of EPR pairs,compared to traditional graph partitioning methods.Our results,derived fromboth benchmark and randomly generated circuits,show that as circuit complexity increases—demanding more qubit teleportations—our approach effectively optimises these teleportations throughout the execution,thereby enhancing performance through strategic circuit partitioning.This is a step forward in the pursuit of a global quantum compiler which will ultimately enable the efficient use of a‘quantum data center’in the future.
文摘This paper investigates Windfarm Layout Optimization(WFLO),where we formulate turbine placement considering wake effects as a Quadratic Unconstrained Binary Optimization(QUBO)problem.Wind energy plays a critical role in the transition toward sustainable power systems,but the optimal placement of turbines remains a challenging combinatorial problem due to complex wake interactions.With recent advances in quantum computing,there is growing interest in exploring whether hybrid quantum-classical methods can provide advantages for such computationally intensive tasks.We investigate solving the resulting QUBO problem using the Variational Quantum Eigensolver(VQE)implemented onQiskit’s quantum computer simulator,employing a quantum noise-free,gate-based circuit model.Three classical optimizers are discussed,with a detailed analysis of the two most effective approaches:Constrained Optimization BY Linear Approximation(COBYLA)and Bayesian Optimization(BO).We compare these simulated quantum results with two established classical optimization methods:Simulated Annealing(SA)and the Gurobi solver.The study focuses on 4×4 grid configurations(requiring 16 qubits),providing insights into near-term quantum algorithm applicability for renewable energy optimization.
基金supported by the National Natural Science Foundation of China(Grant Nos.12441502,12122506,12204230,and 12404554)the National Science and Technology Major Project of the Ministry of Science and Technology of China(2024ZD0300404)+6 种基金Guangdong Basic and Applied Basic Research Foundation(Grant No.2021B1515020070)Shenzhen Science and Technology Program(Grant No.RCYX20200714114522109)China Postdoctoral Science Foundation(CPSF)(2024M762114)Postdoctoral Fellowship Program of CPSF(GZC20231727)supported by the National Natural Science Foundation of China(Grant Nos.92165206 and 11974330)Innovation Program for Quantum Science and Technology(Grant No.2021ZD0301603)the Fundamental Research Funds for the Central Universities。
文摘We present a robust quantum optimal control framework for implementing fast entangling gates on ion-trap quantum processors.The framework leverages tailored laser pulses to drive the multiple vibrational sidebands of the ions to create phonon-mediated entangling gates and,unlike the state of the art,requires neither weakcoupling Lamb-Dicke approximation nor perturbation treatment.With the application of gradient-based optimal control,it enables finding amplitude-and phase-modulated laser control protocols that work without the Lamb-Dicke approximation,promising gate speeds on the order of microseconds comparable to the characteristic trap frequencies.Also,robustness requirements on the temperature of the ions and initial optical phase can be conveniently included to pursue high-quality fast gates against experimental imperfections.Our approach represents a step in speeding up quantum gates to achieve larger quantum circuits for quantum computation and simulation,and thus can find applications in near-future experiments.
