SearcharxivSearch

arXiv subjects

Pilar Moreno

Publications and source records attributed to Pilar Moreno.

5 recordsLinked to original sources

End-to-end plaque counting and virus titration from laboratory plate images with deep learning

Plaque assays remain the gold standard readout of virus infectivity; however, plaque counting from plate images is labor-intensive and prone to inter-operator variability. We present an end-to-end, computer-aided workflow for cytopathic effect-based virus titration directly from laboratory plaque assay images. The proposed approach combines two models derived from the Segment Anything Model (SAM): a SAM2-based well-segmentation module that localizes assay wells across heterogeneous imaging conditions, and a SAM-based plaque-segmentation model that detects and enumerates plaques within each well. The method was evaluated on a mixed dataset comprising private plaque assay images of Mayaro virus and Coxsackievirus B3, together with public Vaccinia virus images from the VACVPlaque dataset. The pipeline outputs per-well plaque counts, automatically computes plaque-forming units per milliliter (PFU/mL), and is integrated into a web-based platform that allows users to review results and organize experiments. On held-out plates (17 from MAYV/CVB3 and 22 from VACV), the workflow generalized across two plate formats (6-well and 12-well) and showed strong agreement with manual annotations (Pearson correlation coefficients of 0.92 for MAYV/CVB3 and 0.88 for VACV). Automated plaque counts were further compared with annotations from four independent experts, demonstrating high concordance. The proposed system will be open sourced and publicly released upon acceptance of this manuscript to enable reproducible, scalable, and audit-ready plaque assay analysis while substantially reducing manual annotation effort.

cs.CV

Entanglement in eight-qubit graph states

Any 8-qubit graph state belongs to one of the 101 equivalence classes under local unitary operations within the Clifford group. For each of these classes we obtain a representative which requires the minimum number of controlled-Z gates for its preparation, and calculate the Schmidt measure for the 8-partite split, and the Schmidt ranks for all bipartite splits. This results into an extension to 8 qubits of the classification of graph states proposed by Hein, Eisert, and Briegel [Phys. Rev. A 69, 062311 (2004)].

quant-ph

All-versus-nothing proofs with n qubits distributed between m parties

All-versus-nothing (AVN) proofs show the conflict between Einstein, Podolsky, and Rosen's elements of reality and the perfect correlations of some quantum states. Given an n-qubit state distributed between m parties, we provide a method with which to decide whether this distribution allows an m-partite AVN proof specific for this state using only single-qubit measurements. We apply this method to some recently obtained n-qubit m-particle states. In addition, we provide all inequivalent AVN proofs with less than nine qubits and a minimum number of parties.

quant-ph

Compact set of invariants characterizing graph states of up to eight qubits

The set of entanglement measures proposed by Hein, Eisert, and Briegel for n-qubit graph states [Phys. Rev. A 69, 062311 (2004)] fails to distinguish between inequivalent classes under local Clifford operations if n > 6. On the other hand, the set of invariants proposed by van den Nest, Dehaene, and De Moor (VDD) [Phys. Rev. A 72, 014307 (2005)] distinguishes between inequivalent classes, but contains too many invariants (more than 2 10^{36} for n=7) to be practical. Here we solve the problem of deciding which entanglement class a graph state of n < 9 qubits belongs to by calculating some of the state's intrinsic properties. We show that four invariants related to those proposed by VDD are enough for distinguishing between all inequivalent classes with n < 9 qubits.

quant-ph

Bipartite all-versus-nothing proofs of Bell's theorem with single-qubit measurements

If we distribute n qubits between two parties, which quantum pure states and distributions of qubits would allow all-versus-nothing (or Greenberger-Horne-Zeilinger-like) proofs of Bell's theorem using only single-qubit measurements? We show a necessary and sufficient condition for the existence of these proofs for any number of qubits, and provide all distinct proofs up to n=7 qubits. Remarkably, there is only one distribution of a state of n=4 qubits, and six distributions, each for a different state of n=6 qubits, which allow these proofs.

quant-ph