Sechan Park | Searcharxiv

arXiv2026

Feature-domain Fourier ptychographic tomography with dark-field illumination

Fourier ptychographic tomography (FPT) is an implementation of intensity diffraction tomography that reconstructs three-dimensional (3D) refractive-index (RI) distributions from angle-varied intensity measurements. The distinctive advantage of FPT emerges when incorporating dark-field illumination, which extends the space-bandwidth product toward gigavoxel-scale volumetric imaging, yet dark-field measurements are highly sensitive to system imperfections and often have low signal-to-noise ratios. Here, we propose feature-domain FPT (FD-FPT), which evaluates data fidelity after feature extraction and is optimized using automatic differentiation. In numerical and experimental tests, FD-FPT resolves structures near the synthetic-aperture cutoff far more reliably than the spatial-domain baseline (SD-FPT). Notably, in a whole-mount Oedogonium specimen, the reticulate chloroplast network and transverse septa were resolved only by FD-FPT. We further demonstrate a 1.81-gigavoxel RI reconstruction of a mouse adrenal gland section across a 1.66 by 1.40 square millimeter field of view, establishing FD-FPT as a practical route to label-free volumetric imaging that combines millimeter-scale coverage with cellular-scale structural contrast.

physics.optics↗

arXiv2026

HSF-S: Speed-Optimized Compilation and Acceleration for Hybrid Schrodinger-Feynman Quantum Circuit Emulation

Hybrid Schrodinger-Feynman (HSF) simulation offers an attractive memory-path tradeoff for exact quantum-circuit emulation, but its practical runtime is often dominated by exponential path growth from cross-boundary two-qubit gates. Existing GPU and FPGA quantum simulators are largely optimized for full-state Schrodinger execution and therefore do not align well with HSF's path-centric workflow. This paper presents HSF-S, a compiler-accelerator co-designed framework for exact HSF-based quantum circuit emulation. HSF-S lowers input circuits to an HSF-compatible basis, formulates a rank-aware effective path-cost model, and applies dependency-preserving reordering together with discounted-gain SWAP insertion to suppress recurring cross-boundary interactions while preserving exact circuit semantics. A regression-free selector guarantees that the compiled circuit never increases effective path cost relative to the naive lowered baseline. We further design a dedicated HSF-S accelerator and execution flow, and integrate them into a stand-alone processor for efficient per-path dual-slice evaluation and final accumulation without materializing the full state vector. Across 56 benchmark circuits, HSF-S matches reference amplitudes to within floating-point precision, reduces effective path cost by up to 90.0%, and substantially improves practical tractability, including representative timeout-to-sub-second reductions under a 1-hour budget. On the resulting compiled workloads, the HSF-S processor prototype delivers up to 4.34x additional speedup.

quant-ph↗