Mastodawn

What’s a “cluster”? Oak Ridge National Laboratory has installed the presumably-first on-premises commercial quantum computer cluster, consisting of 3 quantum dragons... I mean computers... from Quantum Brilliance, and that could mean a few different things. So, I asked for clarification.

https://bsiegelwax.substack.com/p/ornls-dragon-cluster

#QuantumComputing #QuantumBrilliance #ORNL #HybridQuantum #DistributedQuantum #QuantumCluster #OnPremQuantum #NVC #QuantumHardware #QuantumAlgorithms #QuantumResearch #FutureOfComputing

Show thread

Rod Van Meter Sep 29

If @hossenfelder.bsky.social wants to actually make a video about the current state of the art in #quantumComputing and #quantumAlgorithms, she should read arxiv.org/abs/2310.03011, which is only about 400 pages.

Quantum algorithms: A survey o...

Quantum algorithms: A survey of applications and end-to-end complexities

The anticipated applications of quantum computers span across science and industry, ranging from quantum chemistry and many-body physics to optimization, finance, and machine learning. Proposed quantum solutions in these areas typically combine multiple quantum algorithmic primitives into an overall quantum algorithm, which must then incorporate the methods of quantum error correction and fault tolerance to be implemented correctly on quantum hardware. As such, it can be difficult to assess how much a particular application benefits from quantum computing, as the various approaches are often sensitive to intricate technical details about the underlying primitives and their complexities. Here we present a survey of several potential application areas of quantum algorithms and their underlying algorithmic primitives, carefully considering technical caveats and subtleties. We outline the challenges and opportunities in each area in an "end-to-end" fashion by clearly defining the problem being solved alongside the input-output model, instantiating all "oracles," and spelling out all hidden costs. We also compare quantum solutions against state-of-the-art classical methods and complexity-theoretic limitations to evaluate possible quantum speedups. The survey is written in a modular, wiki-like fashion to facilitate navigation of the content. Each primitive and application area is discussed in a standalone section, with its own bibliography of references and embedded hyperlinks that direct to other relevant sections. This structure mirrors that of complex quantum algorithms that involve several layers of abstraction, and it enables rapid evaluation of how end-to-end complexities are impacted when subroutines are altered.

arXiv.org

QIC Journal May 16, 2025

👏#call4reading

✍️On the depth overhead #incurred when running #quantumalgorithms on near-term quantum computers with limited #qubit connectivity #by Steven Herbert

🔗https://doi.org/10.26421/QIC20.9-10-5(#arXiv:1805.12570)

Kimmo Halunen Dec 3, 2024

Another day another paper by one of my (now former) colleague, myself and a few others on the feasibility of #quantumcomputing and #quantumalgorithms

If you are interested in such things, please check it out. I am also very keen to learn about your possible experiences on applying quantum computing. We are now researching the #cybersecurity of quantum computing in a couple of different projects.

https://link.springer.com/chapter/10.1007/978-3-031-78392-0_10

Quantum Algorithms: Application and Feasibility

In this paper, we evaluate the feasibility of quantum algorithms for practical applications and categorize them into three types: green, yellow, and red. Green means the most feasible, while red means the least feasible. We select four quantum algorithms from the...

SpringerLink

QIC Journal Nov 27, 2024

🤛#call4reading

✍️ On the #quantumcomplexity of integration of a function with #unknown singularity #by Maciej Gocwin

🔗https://doi.org/10.26421/QIC23.7-8-4

#quantumalgorithms #complexity

Rinton Press - Publisher in Science and Technology

Rinton Press, a science and technology publisher, is founded by a team of scholars and publication professionals, and is based in Princeton, New Jersey. Rinton Press serves the scientific and academic community by publishing, marketing and distributing journals, books and proceedings, through a progressively wide variety of media such as CD-ROM and Internet in addition to conventional print on paper.

QIC Journal Oct 30, 2024

👏#call4reading

✍️Efficient #quantumalgorithms to find #substructures on finite algebras #by J.M. Hernandez Caceres, I.F. Rua, and Elias F. Combarro

🔗 https://doi.org/10.26421/QIC23.15-16-2

Rinton Press - Publisher in Science and Technology

Show thread

Fraunhofer FOKUS Aug 29, 2024

Do not hesitate to contact us if you have any questions! We look forward to a smart audience for the training and an exciting online course.

#ProfessionalTraining
#QuantumComputing
#QuantumAlgorithms
#QuantumPhysics
#QuantumProgramming
#FOKUSakademie

Marek Gluza Aug 15, 2024

Posted today: strategies for how to go about optimising double-bracket #quantumAlgorithms
https://scirate.com/arxiv/2408.07431

We compare with cases inspired by Brockett's #doubleBracketFlow which have rigorous global convergence guarantees and found that departing from them and at every step optimising the involved generators gives faster diagonalization.

This motivates our upcoming work on training our double-bracket circuits on single-shot samples: today we posted that 1) within the class of #doubleBracket #quantum algorithms it's worthwhile to variationally train the parametrisations at every step, last week we posted that 2) warm-starts from #VQE facilitate very high ground state preparation fidelity and so 3) training on shot-noise limited data will give an idea how to use our approach on future large-scale quantum hardware.

Strategies for optimizing double-bracket quantum algorithms

Recently double-bracket quantum algorithms have been proposed as a way to compile circuits for approximating eigenstates. Physically, they consist of appropriately composing evolutions under an input Hamiltonian together with diagonal evolutions. Here, we present strategies to optimize the choice of the double-bracket evolutions to enhance the diagonalization efficiency. This can be done by finding optimal generators and durations of the evolutions. We present numerical results regarding the preparation of double-bracket iterations, both in ideal cases where the algorithm's setup provides analytical convergence guarantees and in more heuristic cases, where we use an adaptive and variational approach to optimize the generators of the evolutions. As an example, we discuss the efficacy of these optimization strategies when considering a spin-chain Hamiltonian as the target. To propose algorithms that can be executed starting today, fully aware of the limitations of the quantum technologies at our disposal, we finally present a selection of diagonal evolution parametrizations that can be directly compiled into CNOTs and single-qubit rotation gates. We discuss the advantages and limitations of this compilation and propose a way to take advantage of this approach when used in synergy with other existing methods.

SciRate

Technische Universität München Sep 29, 2023

Get to know Barbara Kraus, our newly appointed Professor of #QuantumAlgorithms and Applications, in our "NewIn" series. She is looking for computable rules for the behavior of #quantumsystems to enable reliable new applications: https://go.tum.de/484409

@MCQST
📷 A.Heddergott
🎥 @prolehre

Making quantum systems computable

The physicist Prof. Barbara Kraus is looking for computable rules regarding the behavior of quantum systems to facilitate reliable new applications.

Gemma C. Solomon Aug 7, 2023

We have a TT Assistant Professor position in Quantum Algorithms for Chem & Life Science open at UCPH. Please apply! Encourage your friends to apply. Extended deadline August 20.

I know there are lots of quantum folks on Mastodon (because I enjoy reading all your posts 😀 ) - we'd really appreciate boosts to try to get this out to a broader quantum audience.

https://candidate.hr-manager.net/ApplicationInit.aspx/?cid=1307&departmentId=18971&ProjectId=159461&MediaId=5&SkipAdvertisement=false
#QuantumComputing #Quantum #UCPH #Copenhagen #TenureTrack #NQCP #QuantumForLife #QuantumAlgorithms

211-0177/23-2N Tenure-track assistant Professor of Quantum Algorithms for Chemistry and Life Science

Tenure-track assistant Professor of Quantum Algorithms for Chemistry and Life Science Department of Chemistry Faculty of Science University of Copenhagen The De

Talentech