Search

We generalize the projection-based quantum measurement-driven $k$-SAT algorithm of Benjamin, Zhao, and Fitzsimons (BZF, arxiv:1711.02687) to arbitrary strength quantum measurements, including the limit of continuous monitoring. In doing so, we clarify that this algorithm is a particular case of the measurement-driven quantum control strategy elsewhere referred to as "Zeno dragging". We argue that the algorithm is most efficient with finite time and measurement resources in the continuum limit, where measurements have an infinitesimal strength and duration. Moreover, for solvable $k$-SAT problems, the dynamics generated by the algorithm converge deterministically towards target dynamics in the long-time (Zeno) limit, implying that the algorithm can successfully operate autonomously via Lindblad dissipation, without detection. We subsequently study both the conditional and unconditional dynamics of the algorithm implemented via generalized measurements, quantifying the advantages of detection for heralding errors. These strategies are investigated first in a computationally-trivial $2$-qubit $2$-SAT problem to build intuition, and then we consider the scaling of the algorithm on $3$-SAT problems encoded with $4 - 10$ qubits. The average number of shots needed to obtain a solution scales with qubit number as $\lambda^n$. For vanishing dragging time (with final readout only), we find $\lambda = 2$ (corresponding to a brute-force search over possible solutions). However, the deterministic (autonomous) property of the algorithm in the adiabatic (Zeno) limit implies that we can drive $\lambda$ arbitrarily close to $1$, at the cost of a growing pre-factor. We numerically investigate the tradeoffs in these scalings with respect to algorithmic runtime and assess their implications for using this analog measurement-driven approach to quantum computing in practice., Comment: 23 + 8 pages, 15 figures

An edge $e$ of a matching covered graph $G$ is removable if $G-e$ is also matching covered. The notion of removable edge arises in connection with ear decompositions of matching covered graphs introduced by Lov\'asz and Plummer. A nonbipartite matching covered graph $G$ is a brick if it is free of nontrivial tight cuts. Carvalho, Lucchesi, and Murty proved that every brick other than $K_4$ and $\overline{C_6}$ has at least $\Delta-2$ removable edges. A brick $G$ is near-bipartite if it has a pair of edges $\{e_1,e_2\}$ such that $G-\{e_1,e_2\}$ is a bipartite matching covered graph. In this paper, we show that in a near-bipartite brick $G$ with at least six vertices, every vertex of $G$, except at most six vertices of degree three contained in two disjoint triangles, is incident with at most two nonremovable edges; consequently, $G$ has at least $\frac{|V(G)|-6}{2}$ removable edges. Moreover, all graphs attaining this lower bound are characterized., Comment: 23 pages, 1 figure

A matching covered graph $G$ is minimal if for each edge $e$ of $G$, $G-e$ is not matching covered. An edge $e$ of a matching covered graph $G$ is removable if $G-e$ is also matching covered. Thus a matching covered graph is minimal if and only if it is free of removable edges. For bipartite graphs, Lov\'{a}sz and Plummer gave a characterization of bipartite minimal matching covered graphs. For bricks, Lov\'{a}sz showed that the only bricks that are minimal matching covered are $K_4$ and $\overline{C_6}$. In this paper, we present a complete characterization of minimal matching covered graphs that are claw-free. Moreover, for cubic claw-free matching covered graphs that are not minimal matching covered, we obtain the number of their removable edges (with respect to their bricks), and then prove that they have at least 12 removable edges (the bound is sharp).

Extracting information efficiently from quantum systems is a major component of quantum information processing tasks. Randomized measurements, or classical shadows, enable predicting many properties of arbitrary quantum states using few measurements. While random single-qubit measurements are experimentally friendly and suitable for learning low-weight Pauli observables, they perform poorly for nonlocal observables. Prepending a shallow random quantum circuit before measurements maintains this experimental friendliness, but also has favorable sample complexities for observables beyond low-weight Paulis, including high-weight Paulis and global low-rank properties such as fidelity. However, in realistic scenarios, quantum noise accumulated with each additional layer of the shallow circuit biases the results. To address these challenges, we propose the \emph{robust shallow shadows protocol}. Our protocol uses Bayesian inference to learn the experimentally relevant noise model and mitigate it in postprocessing. This mitigation introduces a bias-variance trade-off: correcting for noise-induced bias comes at the cost of a larger estimator variance. Despite this increased variance, as we demonstrate on a superconducting quantum processor, our protocol correctly recovers state properties such as expectation values, fidelity, and entanglement entropy, while maintaining a lower sample complexity compared to the random single qubit measurement scheme. We also theoretically analyze the effects of noise on sample complexity and show how the optimal choice of the shallow shadow depth varies with noise strength. This combined theoretical and experimental analysis positions the robust shallow shadow protocol as a scalable, robust, and sample-efficient protocol for characterizing quantum states on current quantum computing platforms., Comment: Significant update: Added new theorems on calibration sample complexity and effective noise models. Expanded discussion on time-dependent Markovian and non-Markovian noise. Included 8 new figures presenting results on method robustness and calibration sample overhead. 28 pages and 13 figures in total

The quantum Zeno effect asserts that quantum measurements inhibit simultaneous unitary dynamics when the "collapse" events are sufficiently strong and frequent. This applies in the limit of strong continuous measurement or dissipation. It is possible to implement a dissipative control that is known as "Zeno Dragging", by dynamically varying the monitored observable, and hence also the eigenstates which are attractors under Zeno dynamics. This is similar to adiabatic processes, in that the Zeno dragging fidelity is highest when the rate of eigenstate change is slow compared to the measurement rate. We demonstrate here two theoretical methods for using such dynamics to achieve control of quantum systems. The first, which we shall refer to as "shortcut to Zeno" (STZ), is analogous to the shortcuts to adiabaticity (counterdiabatic driving) that are frequently used to accelerate unitary adiabatic evolution. In the second approach we apply the Chantasri Dressel Jordan (2013, CDJ) stochastic action, and demonstrate that the extremal-probability readout paths derived from this are well suited to setting up a Pontryagin-style optimization of the Zeno dragging schedule. A fundamental contribution of the latter approach is to show that an action suitable for measurement-driven control optimization can be derived quite generally from statistical arguments. Implementing these methods on the Zeno dragging of a qubit, we find that both approaches yield the same solution, namely, that the optimal control is a unitary that matches the motion of the Zeno-monitored eigenstate. We then show that such a solution can be more robust than a unitary-only operation, and comment on solvable generalizations of our qubit example embedded in larger systems. These methods open up new pathways toward systematically developing dynamic control of Zeno subspaces to realize dissipatively-stabilized quantum operations., Comment: 24 + 13 pages, 8 figures. Comments welcome!

An edge $e$ of a matching covered graph $G$ is removable if $G-e$ is also matching covered. Carvalho, Lucchesi, and Murty showed that every brick $G$ different from $K_4$ and $\overline{C_6}$ has at least $\Delta-2$ removable edges, where $\Delta$ is the maximum degree of $G$. In this paper, we generalize the result to irreducible near-bricks, where a graph is irreducible if it contains no single ear of length three or more.

Estimating properties of quantum states via randomized measurements has become a significant part of quantum information science. In this paper, we design an innovative approach leveraging metasurfaces to perform randomized measurements on photonic qubits, together with error mitigation techniques that suppress realistic metasurface measurement noise. Through fidelity and purity estimation, we confirm the capability of metasurfaces to implement randomized measurements and the unbiased nature of our error-mitigated estimator. Our findings show the potential of metasurface-based randomized measurement schemes in achieving robust and resource-efficient estimation of quantum state properties.

In the emerging world of twisted bilayer structures, the possible configurations are limitless, which enables for a rich landscape of electronic properties. In this paper, we focus on twisted bilayer transition metal dichalcogenides (TMDCs) and study its properties by means of an accurate tight-binding model. We build structures with different angles and find that the so-called flatbands emerge when the twist angle is sufficiently small (around 7.3$^{\circ}$). Interestingly, the band gap can be tuned up to a 2.2\% (51 meV) when the twist angle in the relaxed sample varies from 21.8$^{\circ}$ to 0.8$^{\circ}$. Furthermore, when looking at local density of states we find that the band gap varies locally along the moir\`e pattern due to the change in the coupling between layers at different sites. Finally, we also find that the system can suffer a transition from a semiconductor to a metal when a sufficiently strong electric field is applied. Our study can serve as a guide for the practical engineering of the TMDCs based optoelectronic devices., Comment: 8 pages and 8 figures

Ultraflatbands that have been theoretically and experimentally detected in a bunch of van der Waals stacked materials showing some peculiar properties, for instance, highly localized electronic states and enhanced electron-electron interactions. In this Letter, using an accurate tight-binding model, we study the formation and evolution of ultraflatbands in transition metal dichalcogenides (TMDCs) under low rotation angles. We find that, unlike in twisted bilayer graphene, ultraflatbands exist in TMDCs for almost any small twist angles and their wave function becomes more localized when the rotation angle decreases. Lattice relaxation, pressure and local deformation can tune the width of the flatbands, as well as their localization. Furthermore, we investigate the effect of spin-orbit coupling on the flatbands and discover spin/orbital/valley locking at the minimum of the conduction band at the K point of the Brillouin zone. The ultraflatbands found in TMDCs with a range of rotation angle below $7^\circ$, may provide an ideal platform to study strongly correlated states., Comment: 6 pages, 4 figures