[Multiple synchronous lung adenocarcinoma: Interest of molecular biology for staging]. / Adénocarcinomes pulmonaires multifocaux synchrones : intérêt de la biologie moléculaire pour la stadification.

INTRODUCTION: The presence of multiple synchronous lung tumors is not a rare event. Distinguishing intra-pulmonary metastases from multiple synchronous lung adenocarcinoma is a challenge for pathologists and physicians. We present observation of a patient with three lung tumors corresponding to three adenocarcinomas for which molecular analysis had a significant impact on tumor staging. OBSERVATION: Three suspect lesions were discovered in a 61-year-old patient, a smoker, in each lobe of the right lung. Right pneumonectomy with lymph node dissection was performed. Pathological examination showed that each tumor was in fact an adenocarcinoma. In order to more precisely indicate tumor staging, molecular analysis was performed with next generation sequencing showing a different point mutation in a driver gene on each tumor. The final diagnosis is that the three tumors are distinct synchronous tumors, which must be staged separately. CONCLUSIONS: In modern-day practice of thoracic oncology and of surgical pathology, molecular biology represents a complement for tumor staging in the event of multiple lung tumors.

Partial-measurement backaction and nonclassical weak values in a superconducting circuit.

We realize indirect partial measurement of a transmon qubit in circuit quantum electrodynamics by interaction with an ancilla qubit and projective ancilla measurement with a dedicated readout resonator. Accurate control of the interaction and ancilla measurement basis allows tailoring the measurement strength and operator. The tradeoff between measurement strength and qubit backaction is characterized through the distortion of a qubit Rabi oscillation imposed by ancilla measurement in different bases. Combining partial and projective qubit measurements, we provide the solid-state demonstration of the correspondence between a nonclassical weak value and the violation of a Leggett-Garg inequality.

Quantum nondemolition measurement of a superconducting qubit in the weakly projective regime.

Quantum state detectors based on switching of hysteretic Josephson junctions biased close to their critical current are simple to use but have strong backaction. We show that the backaction of a dc-switching detector can be considerably reduced by limiting the switching voltage and using a fast cryogenic amplifier, such that a single readout can be completed within 25 ns at a repetition rate of 1 MHz without loss of contrast. Based on a sequence of two successive readouts we show that the measurement has a clear quantum nondemolition character, with a QND fidelity of 75%.

Predicting activities without computing descriptors: graph machines for QSAR.

We describe graph machines, an alternative approach to traditional machine-learning-based QSAR, which circumvents the problem of designing, computing and selecting molecular descriptors. In that approach, which is similar in spirit to recursive networks, molecules are considered as structured data, represented as graphs. For each example of the data set, a mathematical function (graph machine) is built, whose structure reflects the structure of the molecule under consideration; it is the combination of identical parameterised functions, called "node functions" (e.g. a feedforward neural network). The parameters of the node functions, shared both within and across the graph machines, are adjusted during training with the "shared weights" technique. Model selection is then performed by traditional cross-validation. Therefore, the designer's main task consists in finding the optimal complexity for the node function. The efficiency of this new approach has been demonstrated in many QSAR or QSPR tasks, as well as in modelling the activities of complex chemicals (e.g. the toxicity of a family of phenols or the anti-HIV activities of HEPT derivatives). It generally outperforms traditional techniques without requiring the selection and computation of descriptors.