SearcharxivSearch

arXiv subjects

Luofei Wang

Publications and source records attributed to Luofei Wang.

2 recordsLinked to original sources

Coherent Floquet quantum reservoirs for molecular property prediction

Quantum reservoir computing (QRC) uses quantum dynamics to represent input histories for prediction through a trained classical readout. Discrete time crystals (DTCs) exhibit robust subharmonic responses under periodic driving, and previous work has used their dynamics to construct DTC-QRC. Here we construct a DTC-based reservoir architecture to predict molecular properties from structural and dynamical observations. Coherent Floquet evolution processes local molecular graph events and surface-hopping frames, while controlled reset regulates the contribution of earlier inputs. Measurements at the end of each input sequence yield a feature vector of fixed dimension. Trained classical decoders use this vector for inhibitor-activity and blood--brain-barrier permeability classification and electronic-gap forecasting, while the reservoir parameters remain fixed during training. With matched input lengths and output widths, DTC-QRC outperforms echo-state networks on long-prefix graph classification and the studied ethene gap forecasting tasks. Dephasing lowers performance in both applications, consistent with a role for coherent propagation. Experiments on the Quafu superconducting quantum cloud platform show that pair observables retain task information under device noise. The architecture provides a common framework for molecular screening and time-resolved property prediction using quantum reservoir computing.

quant-ph

Tietze extension does not always work in constructive mathematics if closed sets are defined as sequentially closed sets

We prove that Tietze Extension does not always exist in constructive mathematics if closed sets on which the function we are extending are defined as sequentially closed sets. Firstly, we take a discrete metric space as our topological space. Now all sets open and sequentially closed. Then, we form an unextendible algorithmic function transforming positive integers to 0 and 1, looking at the preimages of these values as our sequentially closed sets. Then we show that if the Tietze theorem conclusion holds for these closed sets then the unextendible function is extendible thus giving us a contradiction.

math.GN