Showing posts with label quantum chemistry. Show all posts
Showing posts with label quantum chemistry. Show all posts

Tuesday, December 9, 2025

Quantinuum Technical Workshop

Yesterday I attended a workshop by Quantinuum, introducing their latest Helios chip to the Singapore quantum ecosystem. The programme included tutorials on hybrid quantum-classical computing workflows, including real-time measurement and conditional circuit operations, as well as applications to quantum error correction and quantum chemistry.

As someone who previously worked on NISQ processors and interested in trying out the latest generation of quantum processors, it was exciting to learn more about the new capabilities that are available:

  • Real-time qubit measurements and reset combined with conditional operations open new opportunities for circuit design, such as the use of probabilistically generated magic states to reduce circuit depth.
  • Gate fidelities are improved by an order of magnitude! 
  • It seems like quantum error correction can actually work on real hardware!

 At the same time, some of the big challenges we struggled with before remain open problems:

  • Trapped ion systems are slow. Current "error correction" capabilities are practically limited to error detection and post-selection - full-on error correction requires too big an overhead in terms of circuit depths. There is a need to carefully tailor the error correction code to the specific problem and hardware.
  • Quantum chemistry use cases seem to have hit a wall in terms of the complexity of implementing the second-quantized Hamiltonians - circuit depths and required number of measurements become intractable well before one can use all of the available physical qubits. Switching from variational algorithms to subspace methods only partially addresses this.

And some other thorny issues mentioned during the discussion breaks:

  • With superconducting quantum processors or other platforms with fixed qubit positions, one often has the luxury of choosing the best set of the qubits on the device and avoiding bad ones. This isn't supported on the Quantinuum processors due to the qubit shuttling - you have to use whatever you're given and can't keep track of which ions are the best to use. This might make the performance more unpredictable from day to day. One suggested approach was to instead perform a tomography on the different quantum logic regions of the device (where the gates are actually performed), to see if there is substantial variation in their fidelities.
  • Because the gates are so slow, zero noise extrapolation (a simple and effective error mitigation scheme) have limited noise data to work with. Methods to generate more data (by probabilistically expanding only some of the two-qubit gates) need to execute many more circuits, giving a big overhead in terms of compilation time.
  • Conditional circuit operations such as post-selection can substantially increase the number of shots required and expenses incurred by the end-user.
All in all, it was great to see the broad interest in the hardware and insightful technical questions from the audience. Looking forward to seeing what Singaporean researchers get up to with the new Helios processor once it is installed and operational in Singapore late next year!

Thursday, February 1, 2024

A busy January

There's been a lot going on here...

Machine Learning & Physics

Unsupervised learning of quantum many-body scars using intrinsic dimension - Now available on arXiv! We applied manifold learning techniques to identify scar states in the PXP model The take-home message: manifold learning techniques are a powerful alternative to more popular deep learning methods, especially in physics problems where you might not have access to enough training data for deep learning to work well.

Identifying topology of leaky photonic lattices with machine learning - Just published in Nanophotonics! We apply various machine learning methods to distinguish different topological phases in a photonic lattice, assuming one only has access to intensity measurements. This can serve as an alternative to full state tomography or phase retrieval methods, but one needs to be careful when training the models on ideal / pristine systems and then applying them to disordered systems. The journal also published a press release on WeChat!

Quantum Computing

Computing electronic correlation energies using linear depth quantum circuits - Finally published in Quantum Science & Technology, after more than a year and a half working through the peer review system. We use perturbation theory to determine electronic correlation energies in small molecular systems (hydrogen, lithium hydride, etc.) using a large set of shallow circuits, giving an alternative to existing methods which require deeper circuits infeasible for current quantum processors. We also tested the algorithm on cloud quantum processors, observing the detrimental impacts of noise. It would be interesting to run this again now to see how much (or how little) the performance from the different cloud providers has improved!

Landscape approximation of low-energy solutions to binary optimization problems - Published in Physical Review A. We present a method to obtain approximate solutions to binary optimization problems using the localization landscape, a function which is able to place bounds on the regions of Anderson localized eigenstates in disordered media without solving the underlying eigenvalue problem. We lay out the conditions required for these bounds to hold, outline how a quadratic unconstrained binary optimization problem can be transformed to fit these conditions, and provide details on how the quantum state representing the landscape function can be produced and sampled using techniques developed for near-term quantum devices.
 
On a related note, I was interested to see this month a new arXiv preprint in which the localization landscape was used to engineer multifractal resonances in SiN membranes!

Photonic Flatband Resonances

Photonic Flatband Resonances in Multiple Light Scattering - Published in Physical Review Letters. We reveal that flatbands can emerge as collective resonances in fine-tuned arrays of Mie-resonant nanoparticles, leading to giant values of the Purcell factor for dipolar emitters. The article was also highlighted with a Synopsis in Physics Magazine!

Tuesday, August 22, 2023

Quantum chemistry with subspace states: the conclusion

 Just over a year ago I wrote about a paper on quantum machine learning using subspace states, which inspired a project we undertook on applications of similar quantum states to variational quantum circuits for quantum chemistry and condensed matter physics. Over the weekend our manuscript was published in Physical Review A!

We were fortunate to have three knowledgeable referees who gave constructive and insightful comments on the original manuscript. We heavily revised the manuscript compared to the original arXiv preprint to not only improve the presentation, but also emphasize the broader applicability of the subspace space approach, specifically the ability to prepare correlated fermionic ansatz states beyond pairwise correlations. Our approach can yield substantially shallower quantum circuits for solving problems where the electron density (number of electrons d / number of orbitals used N) is small, for example when trying to extrapolate finite basis set calculations to the complete basis set limit. This is illustrated in the figure below, taken from the paper:

Estimated two-qubit gate depth per occupied mode d to prepare an N-mode Slater determinant and pairwise-correlated ansatz states using subspace states, compared to existing d-independent and linear in N approaches.


Tuesday, January 31, 2023

More on subspace states

Last year I wrote a post about subspace states, which are a way of efficiently encoding classical data (in the form of d-dimensional subspaces of an n-dimensional vector space) into quantum states using shallow (d log n depth) quantum circuits, by loading one n-dimensional data vector at a time (in log n depth), repeating d times.

After reading the paper, we became interested in whether similar states might be useful for applications beyond quantum machine learning / quantum linear algebra. Luckily for us, the answer is yes!

We have shown that subspace states can also be used to efficiently generate ansatz states for quantum chemistry calculations on quantum processors, in a preprint uploaded to arXiv a few weeks ago.

The idea is to view each data vector as describing the atomic orbitals occupied by an electron, with the total electronic wavefunction built up by adding one electron at a time. For this analogy to work, however, the parity of the electron wavefunction (anti-symmetry under exchange of orbitals) also needs to be encoded; this gives an additional log n overhead compared to encoding classical data. Once parity is taken into account, we can encode any Slater determinant state (i.e. an uncorrelated electronic wavefunction) in a two-qubit gate depth of O(d log^2 n).

Since Slater determinants are easy to classically simulate, a natural question is whether the approach can be adapted to generate more interesting states exhibiting electronic correlation effects (which are what make the electronic structure problem hard to solve). Chee found a way to do this - instead of loading one vector (electron) at a time, pairwise correlations between electrons can be introduced by loading them two at a time. With pairwise correlations, one can generate ansatz states with energies lower than those obtained from the simplest Hartree-Fock approximation, corresponding to a better approximation to the true ground state of the system of interest. The method can also generalize to higher-order correlations.

Some caveats and limitations of our method which didn't make it into the specialist-oriented preprint:

  • Gate depth and gate count are two distinct quantities affecting circuit performance; our method has a (poly)-logarithmic two-qubit gate depth, but the number of gates is still linear in the system size n (this is the minimum required to encode all the orbital coefficients). Gate depth matters if the quantum processor has slow two-qubit gates, meaning that only a limited number of gates can be applied in series before the qubits decohere. On the other hand, for fast gates with a lower fidelity, the size of the computation will be limited by the total gate count (too many and an error somewhere is certain). The logarithmic depth arises from using a binary tree to encode the state, meaning that long-range two-qubit gates are required. Altogether, this means that the circuits are best implemented on ion trap systems, which support (slow) long range, high fidelity two-qubit gates.
  • Advertisements of algorithmic speedups are typically given in terms of better asymptotic scaling. For practical applications, however, an important question is where the actual cross-over will occur, which depends on constant overhead factors present in the implementation. The proposed circuits will be shallower than existing linear depth beam-splitter mesh circuits for system sizes on the order of hundreds of qubits. This means our approach isn't better to run on currently-available cloud quantum processors - we'll need to wait until larger devices come online.
  • It's unclear how well our method will perform on near-term devices without quantum error correction. Quantum error mitigation will be needed to get useful results out of any experiment. Since we're not experts in error mitigation we're hoping this functionality will be built-in to future cloud quantum processors.

Tuesday, July 12, 2022

arXiv highlights

 A randomized benchmarking suite for mid-circuit measurements

Mid-circuit measurements of ancilla qubits form a key component of near-term quantum algorithms including NISQ-TDA, future quantum error correction techniques, and quantum algorithms for fault-tolerant quantum computers. This preprint from IBM presents techniques for quantifying the performance and error rates of mid-circuit measurements which are now supported by IBM quantum processors.
 
 
Focused high-intensity laser pulses can ionize air molecules, creating channels of air with higher electrical conductivity which can be used to guide and induce lightning strikes. Peaceful applications include protecting airports and rockets from lightning strikes. No doubt there are also military applications of this kind of research.
 
Quantum chemistry calculations using classical supercomputers. Exponential memory scaling is avoided by using density matrix embedding theory to eliminate irrelevant degrees of freedom and matrix product states to efficiently capture quantum correlations. Apparently this approach can handle chemical systems with up to 100 atoms and it may also be useful for benchmarking variational quantum algorithms run on near-term quantum processors.
 
 
"Our simulation with the lowest bond dimension D = 2—for which the fidelity is close to zero—obtains a solution to the classical problem providing the depth of the circuit is high enough p ≈ 20, even with a sub-optimal choice of parameters and single deterministic sampling of bitstrings...In conclusion, we observe that entanglement plays a minor role in finding the solution to the classical problems studied here for large-depth QAOA." More evidence that your "quantum" optimization algorithm can be efficiently run on an ordinary classical computer.

 
Finally, I am advertising our own recent work on incorporating electronic correlation effects into shallow quantum circuits suitable for near-term noisy quantum processors. 

Wednesday, April 20, 2022

PsiQuantum's take on quantum chemistry using quantum computers

PsiQuantum takes a contrarian view on quantum computing: forget NISQ, focus on fault-tolerant systems with millions of qubits and error correction.

A few weeks ago PsiQuantum published a paper analyzing the resources required to carry out commercially-relevant simulations of battery chemistry: Fault-tolerant resource estimate for quantum chemical simulations: Case study on Li-ion battery electrolyte molecules. They also posted a summary on their website.

So far I only had a chance to skim the paper, but as someone focusing on NISQ algorithms I found the different approaches required for fault-tolerant algorithms quite interesting. For example, I had thought that state preparation might be a bottleneck in applying quantum phase estimation to classically-intractable quantum systems, but this doesn't appear to be a problem for high precision quantum chemistry applications:

Concerns over the viability of preparing such an ansatz efficiently are encapsulated by the “orthogonality catastrophe,” the observation that the overlap between the true ground state and some ansatz wave function decreases exponentially as the system size increases. However, it has been shown that there are sophisticated classical methods for preparing trial wavefunctions with sufficient overlap, for states of up to O(100) orbitals using simple-to-prepare states such as the single Slater determinant obtained from the Hartree-Fock method (alternatively, methods for multideterminant state preparation can be used) [arXiv:1809.05523]

Another part of the paper I found interesting was Appendix C, which presents a logarithmic-depth circuit for state preparation using Givens rotations. From what I understand, this construction is limited to the fault-tolerant regime, since it requires multi-qubit Pauli operations.

Friday, February 11, 2022

arXiv highlights

Posting has been less frequent as I've been busy finishing revisions on some submitted manuscripts. Quite a few noteworthy preprints were posted this week:

 

Topogivity: A Machine-Learned Chemical Rule for Discovering Topological Materials

The authors propose a machine-learning approach for discovering new classes of topological materials. Looks interesting, but hard to say more because frustratingly all the details are delegated to supplementary materials which are not included...

Estimating the Euclidean Quantum Propagator with Deep Generative Modelling of Feynman paths

In the path integral formulation of quantum mechanics the probability amplitude of a particle transiting from state A to state B is given by summing over all possible trajectories between A and B, weighted by the action of each trajectory. While this is a theoretically elegant picture, the summation is extremely difficult to evaluate in practice due to the enormous number of possible trajectories. Here the authors show how machine learning techniques can be used to efficiently sample from those trajectories that contribute significantly to the transition amplitude.
 

Quantifying information scrambling via Classical Shadow Tomography on Programmable Quantum Simulators

By mapping evolution operators to density matrices in a higher-dimensional Hilbert space one can use shadow tomography to efficiently characterise quantum channels. Related works: arXiv:2110.02965 and arXiv:2110.03629.

Observation of wave-packet branching through an engineered conical intersection

When a Hamiltonian with two near-degenerate energy levels varies slowly in time, non-adiabatic Landau-Zener transitions between the energy eigenstates occur. A wavepacket initially in one eigenstate will end up in a superposition of the two eigenstates. A similar phenomenon plays a crucial role in certain chemical reaction dynamics and can be understood qualitatively in terms of the potential energy surfaces during the reaction. Quantum simulation of these complicated reaction dynamics is one potential near-term application of quantum processors, demonstrated here at a small scale using circuit QED.

Experimental observation of thermalisation with noncommuting charges

Macroscopic thermal states are described by conserved quantities such as the total energy or particle number. Curiously, the conserved quantities characterising certain thermal quantum states known as non-Abelian thermal states do not commute with each other and thus cannot simultaneously have well-defined values. This work reports the observation of a non-Abelian thermal state using a trapped ion quantum simulator.
 

To See a World in a Grain of Sand -- The Scientific Life of Shoucheng Zhang

Qi and Zhang's Reviews of Modern Physics article on topological insulators and superconductors was one of my first introductions to topological phases and I was shocked to hear of his passing in 2018. I enjoyed learning more about his life by reading this article.

 

Wednesday, November 17, 2021

Classical shadows of quantum states

Reconstructing quantum states is hard. Full tomography of an n-qubit quantum system requires a number of measurements, computing power, and memory that grows exponentially with n.

There are a variety of more efficient (e.g. polynomial scaling) methods for reconstructing classes of quantum states under simplifying assumptions such as sparsity or short-ranged entanglement.

Quantum shadow tomography is a new efficient technique applicable to arbitrary quantum states.

The key idea is that in most situations we don't need to reconstruct the full density matrix of the quantum state; what we are interested in is expectation values of certain observables of that state. By performing measurements of the state in a set of randomly-chosen bases, one can predict O(M) low weight observables using only O(log M) measurements.

This is important because many important potential applications of quantum computers including quantum chemistry scale poorly with the problem size, e.g. requiring O(n^8) observables to be measured with high precision to obtain molecular energies. Existing methods for more efficiently obtaining these observables (e.g. by grouping commuting observables) are challenging to scale, since finding the optimal grouping is an NP-hard problem.

Last year an efficient protocol for quantum shadow tomography was proposed.

A PRL paper published last week has now experimentally demonstrated quantum shadow tomography using a 4-qubit system.

Related work using spatial modes of photons and re-analysis of existing experimental data.


Monday, November 15, 2021

Orthogonality catastrophe on quantum devices

I recently read Walter Kohn's Nobel Lecture on density functional theory. It's an accessible introduction to a method that is hugely important for materials science. Sec. IIC makes some remarks on the orthogonality catastrophe, arguing that many-body wave functions are not meaningful for more than ~1000 particles because the exponential growth of the Hilbert space makes any approximation to a desired state have an exponentially-vanishing overlap with that state.

Quantum computational chemistry is promoted as one of the most promising potential applications of quantum computers, offering an exponential speed-up compared to classical algorithms. But there is a big caveat hidden behind these claims: Algorithms exhibiting rigorous speed-ups such as quantum phase estimation require as an input an approximation to the ground state wavefunction. The overlap with the ground state determines the success probability of the algorithm. Thus, computing the ground state energy of a large many body system will require an exponentially good approximation to the corresponding wavefunction, potentially killing the quantum speed-up.

Some experts in quantum chemistry considered this issue in an arXiv preprint a few years ago: Postponing the orthogonality catastrophe: efficient state preparation for electronic structure simulations on quantum devices. There the authors estimated that efficiently-computable approximations such as Hartee-Fock wavefunctions may provide a sufficiently good overlap for moderate system sizes of up to 40 electrons that are already beyond the reach of classical computations. But it seems quantum computers won't be a magic bullet for larger systems involving hundreds of electrons; it will still be necessary to use physical insight to decompose large systems into smaller tractable subsystems. 
 
It is curious that this study has only received 18 citations to date and was not published in a journal - there must be a story behind that...

Friday, October 15, 2021

arxiv papers

A few arXiv preprints that caught my eye this week:

Topology in shallow-water waves: A spectral flow perspective: This intriguing paper demonstrates a novel form of the topological bulk-boundary correspondence for continuous wave systems such as water waves, for which the more conventional bulk-boundary fails. In this case, the edge invariant describes a peculiar form of topological pumping driven by changes in boundary conditions. The authors write: "We are not aware of any physical evidence of such a quantity, but because of its stability there might be some way to observe it in some clever device." Light propagation in a suitable homogeneous medium described by Maxwell's equations seems like a prime candidate. Who will be first?

 
A Qubit-Efficient Encoding Scheme for Quantum Simulations of Electronic Structure: The authors propose a method to map quantum chemistry problems onto a number of qubits that grows only logarithmically with the number of orbitals simulated. Such qubit-efficient mappings are particularly important for solving practical problems on near-term quantum processors supporting a limited number of qubits. The trade-off, however, is that the design of ansatz circuits (for variational quantum algorithms) becomes a lot harder, so far limited to so-called hardware-efficient circuits that may be challenging to optimise to find the ground state of the system.


Topological Wannier cycles. This work was mentioned by Prof. Jiang at the METANANO conference last month. Threading a flux through a single unit cell of higher-order topological insulators induces a novel form of topological pumping that can be used to distinguish certain higher-order topological phases that cannot be distinguished via the bulk-edge correspondence.


Non-randomness of Google's quantum supremacy benchmark. The authors apply various statistical tests to the bitstrings sampled in Google's famous quantum supremacy paper. Due to noise and imperfections in the gates, the circuit does not precisely sample the family of random unitary matrices, and therefore the sampled bitstrings exhibit subtle biases. For example, qubits are 2.8% more likely to be sampled in their ground state. This suggests it may be possible to classically spoof the sampling performed by the quantum processor, challenging the claimed quantum supremacy.

 

The Complexity of Bipartite Gaussian Boson Sampling. Xanadu and collaborators analyze a variant of their programmable quantum photonic chip demonstrated earlier this year, in which different unitary transformations U and V are applied to each group of two-mode squeezed states. In practice, this would likely involve the use of wavelength or polarization-dependent couplers to direct signal and idler photons to different tunable beamsplitter meshes. Then, thanks to the singular value decomposition, the output photon number distribution can sample from distributions given by permanents of arbitrary matrices, enabling the classically-intractable regime to be reached using fewer photons (or in this case less squeezing).


Friday, March 12, 2021

Quantum chemistry on near-term quantum computers: the measurement problem

Quantum chemistry calculations including computing the ground state energies of complex molecules are touted as a promising application of near-term quantum computers. While numerous small-scale proof-of-concept calculations have been performed for small molecules, whether near-term quantum algorithms will offer any useful advantage over existing classical computers remains an intensely-debated question.

The variational quantum eigensolver is a leading candidate for near-term quantum computers. This algorithm uses a hybrid quantum-classical feedback loop to optimise the parameters of the quantum gates and minimise the required circuit depth. Each iteration of this algorithm requires estimating the energy of the trial solution, which requires O(1/ε^2) measurements to achieve an accuracy of ε. This becomes a severe bottleneck as the problem size is increased. 

For example, Google's recent paper preparing the Hartree-Fock wavefunction required 250,000 measurements to estimate each observable to sufficient accuracy, translating to a few seconds to perform a single iteration of the algorithm with N=12 qubits. They employed clever tricks to obtain the N^2 one-particle reduced density matrix elements required to compute the energy using only N+1 measurements. When electronic correlations are taken into account, N^4 two-particle reduced density matrix elements are needed to estimate energies. This poor scaling must be improved for the variational quantum eigensolver to have any practical applications.

Interestingly, larger error-corrected quantum computers may not solve this problem: Pessimists estimate that millions of qubits and years of runtime will be required to run error-corrected algorithms such as quantum phase estimation on useful problem sizes.

One approach towards tackling this problem is to use more efficient problem encodings. The most-commonly employed second quantization approach uses N qubits to encode N electron orbitals, and can represent states containing up to N electrons. However, typically the number of orbitals needs to be considerably larger than the number of electrons K in order to achieve convergence to accurate ground state energies. Alternatively, using a first quantization encoding can encode the quantum state using K log N qubits. Estimating the energy then requires measuring elements of a Hamiltonian with ~(KN)^2 nonzero elements. However, one needs to be careful to ensure that the required antisymmetry of the trial wavefunction is preserved. Nevertheless, this approach may be superior for achieving chemical accuracy when a large number of basis states is required. Further discussion on this point can be found in this paper.

Some other useful references I read today on this topic:

This preprint estimates runtimes for applying the quantum phase estimation algorithm to compute energies of catalysts.

This preprint proposes a Bayesian approach to estimating energies with runtime interpolating between the 1/ε^2 of the variational quantum eigensolver and the 1/ε of quantum phase estimation, which trades longer circuit depths for fewer required measurements.

This preprint discusses the measurement problem further.