--- _id: '40703' author: - first_name: Mohsen full_name: Rezaee, Mohsen last_name: Rezaee - first_name: Peter J. full_name: Schreier, Peter J. last_name: Schreier citation: ama: Rezaee M, Schreier PJ. A degrees-of-freedom-achieving scheme for the temporally correlated MIMO interference channel with delayed CSIT. IEEE Trans Wireless Comm. 2018;17(8):5397–5408. apa: Rezaee, M., & Schreier, P. J. (2018). A degrees-of-freedom-achieving scheme for the temporally correlated MIMO interference channel with delayed CSIT. IEEE Trans. Wireless Comm., 17(8), 5397–5408. bibtex: '@article{Rezaee_Schreier_2018, title={A degrees-of-freedom-achieving scheme for the temporally correlated MIMO interference channel with delayed CSIT}, volume={17}, number={8}, journal={IEEE Trans. Wireless Comm.}, author={Rezaee, Mohsen and Schreier, Peter J.}, year={2018}, pages={5397–5408} }' chicago: 'Rezaee, Mohsen, and Peter J. Schreier. “A Degrees-of-Freedom-Achieving Scheme for the Temporally Correlated MIMO Interference Channel with Delayed CSIT.” IEEE Trans. Wireless Comm. 17, no. 8 (2018): 5397–5408.' ieee: M. Rezaee and P. J. Schreier, “A degrees-of-freedom-achieving scheme for the temporally correlated MIMO interference channel with delayed CSIT,” IEEE Trans. Wireless Comm., vol. 17, no. 8, pp. 5397–5408, 2018. mla: Rezaee, Mohsen, and Peter J. Schreier. “A Degrees-of-Freedom-Achieving Scheme for the Temporally Correlated MIMO Interference Channel with Delayed CSIT.” IEEE Trans. Wireless Comm., vol. 17, no. 8, 2018, pp. 5397–5408. short: M. Rezaee, P.J. Schreier, IEEE Trans. Wireless Comm. 17 (2018) 5397–5408. date_created: 2023-01-30T11:51:39Z date_updated: 2023-01-30T12:03:00Z department: - _id: '263' intvolume: ' 17' issue: '8' page: 5397–5408 publication: IEEE Trans. Wireless Comm. status: public title: A degrees-of-freedom-achieving scheme for the temporally correlated MIMO interference channel with delayed CSIT type: journal_article user_id: '43497' volume: 17 year: '2018' ... --- _id: '40702' author: - first_name: T. full_name: Marrinan, T. last_name: Marrinan - first_name: Tanuj full_name: Hasija, Tanuj id: '43497' last_name: Hasija - first_name: C. full_name: Lameiro, C. last_name: Lameiro - first_name: P. J. full_name: Schreier, P. J. last_name: Schreier citation: ama: 'Marrinan T, Hasija T, Lameiro C, Schreier PJ. Complete Model Selection in Multiset Canonical Correlation Analysis. In: Proc. European Signal Process. Conf. (EUSIPCO). ; 2018:1082–1086.' apa: Marrinan, T., Hasija, T., Lameiro, C., & Schreier, P. J. (2018). Complete Model Selection in Multiset Canonical Correlation Analysis. Proc. European Signal Process. Conf. (EUSIPCO), 1082–1086. bibtex: '@inproceedings{Marrinan_Hasija_Lameiro_Schreier_2018, title={Complete Model Selection in Multiset Canonical Correlation Analysis}, booktitle={Proc. European Signal Process. Conf. (EUSIPCO)}, author={Marrinan, T. and Hasija, Tanuj and Lameiro, C. and Schreier, P. J.}, year={2018}, pages={1082–1086} }' chicago: Marrinan, T., Tanuj Hasija, C. Lameiro, and P. J. Schreier. “Complete Model Selection in Multiset Canonical Correlation Analysis.” In Proc. European Signal Process. Conf. (EUSIPCO), 1082–1086, 2018. ieee: T. Marrinan, T. Hasija, C. Lameiro, and P. J. Schreier, “Complete Model Selection in Multiset Canonical Correlation Analysis,” in Proc. European Signal Process. Conf. (EUSIPCO), 2018, pp. 1082–1086. mla: Marrinan, T., et al. “Complete Model Selection in Multiset Canonical Correlation Analysis.” Proc. European Signal Process. Conf. (EUSIPCO), 2018, pp. 1082–1086. short: 'T. Marrinan, T. Hasija, C. Lameiro, P.J. Schreier, in: Proc. European Signal Process. Conf. (EUSIPCO), 2018, pp. 1082–1086.' date_created: 2023-01-30T11:51:39Z date_updated: 2023-01-30T12:07:14Z department: - _id: '263' language: - iso: eng page: 1082–1086 publication: Proc. European Signal Process. Conf. (EUSIPCO) status: public title: Complete Model Selection in Multiset Canonical Correlation Analysis type: conference user_id: '43497' year: '2018' ... --- _id: '40050' author: - first_name: Boris full_name: Baeumer, Boris last_name: Baeumer - first_name: Tomasz full_name: Luks, Tomasz id: '58312' last_name: Luks - first_name: Mark M. full_name: Meerschaert, Mark M. last_name: Meerschaert citation: ama: Baeumer B, Luks T, Meerschaert MM. Space‐time fractional Dirichlet problems. Mathematische Nachrichten. 2018;291(17-18):2516-2535. doi:10.1002/mana.201700111 apa: Baeumer, B., Luks, T., & Meerschaert, M. M. (2018). Space‐time fractional Dirichlet problems. Mathematische Nachrichten, 291(17–18), 2516–2535. https://doi.org/10.1002/mana.201700111 bibtex: '@article{Baeumer_Luks_Meerschaert_2018, title={Space‐time fractional Dirichlet problems}, volume={291}, DOI={10.1002/mana.201700111}, number={17–18}, journal={Mathematische Nachrichten}, publisher={Wiley}, author={Baeumer, Boris and Luks, Tomasz and Meerschaert, Mark M.}, year={2018}, pages={2516–2535} }' chicago: 'Baeumer, Boris, Tomasz Luks, and Mark M. Meerschaert. “Space‐time Fractional Dirichlet Problems.” Mathematische Nachrichten 291, no. 17–18 (2018): 2516–35. https://doi.org/10.1002/mana.201700111.' ieee: 'B. Baeumer, T. Luks, and M. M. Meerschaert, “Space‐time fractional Dirichlet problems,” Mathematische Nachrichten, vol. 291, no. 17–18, pp. 2516–2535, 2018, doi: 10.1002/mana.201700111.' mla: Baeumer, Boris, et al. “Space‐time Fractional Dirichlet Problems.” Mathematische Nachrichten, vol. 291, no. 17–18, Wiley, 2018, pp. 2516–35, doi:10.1002/mana.201700111. short: B. Baeumer, T. Luks, M.M. Meerschaert, Mathematische Nachrichten 291 (2018) 2516–2535. date_created: 2023-01-25T15:11:01Z date_updated: 2023-01-26T17:19:39Z department: - _id: '555' doi: 10.1002/mana.201700111 intvolume: ' 291' issue: 17-18 keyword: - General Mathematics language: - iso: eng page: 2516-2535 publication: Mathematische Nachrichten publication_identifier: issn: - 0025-584X - 1522-2616 publication_status: published publisher: Wiley status: public title: Space‐time fractional Dirichlet problems type: journal_article user_id: '58312' volume: 291 year: '2018' ... --- _id: '40705' author: - first_name: Mohammad full_name: Soleymani, Mohammad last_name: Soleymani - first_name: Christian full_name: Lameiro, Christian last_name: Lameiro - first_name: Peter J. full_name: Schreier, Peter J. last_name: Schreier - first_name: Ignacio full_name: Santamaría, Ignacio last_name: Santamaría citation: ama: 'Soleymani M, Lameiro C, Schreier PJ, Santamaría I. Improper Signaling for OFDM Underlay Cognitive Radio Systems. In: Proc. IEEE Statistical Signal Processing Workshop (SSP). ; 2018:722–726. doi:10.1109/SSP.2018.8450843' apa: Soleymani, M., Lameiro, C., Schreier, P. J., & Santamaría, I. (2018). Improper Signaling for OFDM Underlay Cognitive Radio Systems. Proc. IEEE Statistical Signal Processing Workshop (SSP), 722–726. https://doi.org/10.1109/SSP.2018.8450843 bibtex: '@inproceedings{Soleymani_Lameiro_Schreier_Santamaría_2018, place={Freiburg, Germany}, title={Improper Signaling for OFDM Underlay Cognitive Radio Systems}, DOI={10.1109/SSP.2018.8450843}, booktitle={Proc. IEEE Statistical Signal Processing Workshop (SSP)}, author={Soleymani, Mohammad and Lameiro, Christian and Schreier, Peter J. and Santamaría, Ignacio}, year={2018}, pages={722–726} }' chicago: Soleymani, Mohammad, Christian Lameiro, Peter J. Schreier, and Ignacio Santamaría. “Improper Signaling for OFDM Underlay Cognitive Radio Systems.” In Proc. IEEE Statistical Signal Processing Workshop (SSP), 722–726. Freiburg, Germany, 2018. https://doi.org/10.1109/SSP.2018.8450843. ieee: 'M. Soleymani, C. Lameiro, P. J. Schreier, and I. Santamaría, “Improper Signaling for OFDM Underlay Cognitive Radio Systems,” in Proc. IEEE Statistical Signal Processing Workshop (SSP), 2018, pp. 722–726, doi: 10.1109/SSP.2018.8450843.' mla: Soleymani, Mohammad, et al. “Improper Signaling for OFDM Underlay Cognitive Radio Systems.” Proc. IEEE Statistical Signal Processing Workshop (SSP), 2018, pp. 722–726, doi:10.1109/SSP.2018.8450843. short: 'M. Soleymani, C. Lameiro, P.J. Schreier, I. Santamaría, in: Proc. IEEE Statistical Signal Processing Workshop (SSP), Freiburg, Germany, 2018, pp. 722–726.' date_created: 2023-01-30T11:51:40Z date_updated: 2023-01-30T12:01:49Z department: - _id: '263' doi: 10.1109/SSP.2018.8450843 page: 722–726 place: Freiburg, Germany publication: Proc. IEEE Statistical Signal Processing Workshop (SSP) status: public title: Improper Signaling for OFDM Underlay Cognitive Radio Systems type: conference user_id: '43497' year: '2018' ... --- _id: '40704' author: - first_name: J. full_name: Tong, J. last_name: Tong - first_name: Q. full_name: Guo, Q. last_name: Guo - first_name: J. full_name: Xi, J. last_name: Xi - first_name: Y. full_name: Yu, Y. last_name: Yu - first_name: P. J. full_name: Schreier, P. J. last_name: Schreier citation: ama: 'Tong J, Guo Q, Xi J, Yu Y, Schreier PJ. Regularized lattice reduction-aided ordered successive interference cancellation for MIMO detection. In: Proc. IEEE Workshop on Statistical Signal Processing. ; 2018.' apa: Tong, J., Guo, Q., Xi, J., Yu, Y., & Schreier, P. J. (2018). Regularized lattice reduction-aided ordered successive interference cancellation for MIMO detection. Proc. IEEE Workshop on Statistical Signal Processing. bibtex: '@inproceedings{Tong_Guo_Xi_Yu_Schreier_2018, place={Freiburg, Germany}, title={Regularized lattice reduction-aided ordered successive interference cancellation for MIMO detection}, booktitle={Proc. IEEE Workshop on Statistical Signal Processing}, author={Tong, J. and Guo, Q. and Xi, J. and Yu, Y. and Schreier, P. J.}, year={2018} }' chicago: Tong, J., Q. Guo, J. Xi, Y. Yu, and P. J. Schreier. “Regularized Lattice Reduction-Aided Ordered Successive Interference Cancellation for MIMO Detection.” In Proc. IEEE Workshop on Statistical Signal Processing. Freiburg, Germany, 2018. ieee: J. Tong, Q. Guo, J. Xi, Y. Yu, and P. J. Schreier, “Regularized lattice reduction-aided ordered successive interference cancellation for MIMO detection,” 2018. mla: Tong, J., et al. “Regularized Lattice Reduction-Aided Ordered Successive Interference Cancellation for MIMO Detection.” Proc. IEEE Workshop on Statistical Signal Processing, 2018. short: 'J. Tong, Q. Guo, J. Xi, Y. Yu, P.J. Schreier, in: Proc. IEEE Workshop on Statistical Signal Processing, Freiburg, Germany, 2018.' date_created: 2023-01-30T11:51:40Z date_updated: 2023-01-30T12:01:47Z department: - _id: '263' place: Freiburg, Germany publication: Proc. IEEE Workshop on Statistical Signal Processing status: public title: Regularized lattice reduction-aided ordered successive interference cancellation for MIMO detection type: conference user_id: '43497' year: '2018' ... --- _id: '40695' author: - first_name: Christian full_name: Lameiro, Christian last_name: Lameiro - first_name: Ignacio full_name: Santamaría, Ignacio last_name: Santamaría - first_name: Peter J. full_name: Schreier, Peter J. last_name: Schreier citation: ama: Lameiro C, Santamaría I, Schreier PJ. Improper Gaussian signaling for multiple-access channels in underlay cognitive radio. IEEE Transactions on Communications. 2018;67(3):1817–1830. apa: Lameiro, C., Santamaría, I., & Schreier, P. J. (2018). Improper Gaussian signaling for multiple-access channels in underlay cognitive radio. IEEE Transactions on Communications, 67(3), 1817–1830. bibtex: '@article{Lameiro_Santamaría_Schreier_2018, title={Improper Gaussian signaling for multiple-access channels in underlay cognitive radio}, volume={67}, number={3}, journal={IEEE Transactions on Communications}, publisher={IEEE}, author={Lameiro, Christian and Santamaría, Ignacio and Schreier, Peter J.}, year={2018}, pages={1817–1830} }' chicago: 'Lameiro, Christian, Ignacio Santamaría, and Peter J. Schreier. “Improper Gaussian Signaling for Multiple-Access Channels in Underlay Cognitive Radio.” IEEE Transactions on Communications 67, no. 3 (2018): 1817–1830.' ieee: C. Lameiro, I. Santamaría, and P. J. Schreier, “Improper Gaussian signaling for multiple-access channels in underlay cognitive radio,” IEEE Transactions on Communications, vol. 67, no. 3, pp. 1817–1830, 2018. mla: Lameiro, Christian, et al. “Improper Gaussian Signaling for Multiple-Access Channels in Underlay Cognitive Radio.” IEEE Transactions on Communications, vol. 67, no. 3, IEEE, 2018, pp. 1817–1830. short: C. Lameiro, I. Santamaría, P.J. Schreier, IEEE Transactions on Communications 67 (2018) 1817–1830. date_created: 2023-01-30T11:51:38Z date_updated: 2023-01-30T12:02:44Z department: - _id: '263' intvolume: ' 67' issue: '3' page: 1817–1830 publication: IEEE Transactions on Communications publisher: IEEE status: public title: Improper Gaussian signaling for multiple-access channels in underlay cognitive radio type: journal_article user_id: '43497' volume: 67 year: '2018' ... --- _id: '40698' author: - first_name: Y-.H. full_name: Xiao, Y-.H. last_name: Xiao - first_name: L. full_name: Huang, L. last_name: Huang - first_name: J-.K. full_name: Zhang, J-.K. last_name: Zhang - first_name: J. full_name: Xie, J. last_name: Xie - first_name: H. C. full_name: So, H. C. last_name: So citation: ama: Xiao Y-. H, Huang L, Zhang J-. K, Xie J, So HC. Performance Analysis of Locally Most Powerful Invariant Test for Sphericity of Gaussian Vectors in Coherent MIMO Radar. IEEE Transactions on Vehicular Technology. 2018;67(7):5868–5882. apa: Xiao, Y.-. H., Huang, L., Zhang, J.-. K., Xie, J., & So, H. C. (2018). Performance Analysis of Locally Most Powerful Invariant Test for Sphericity of Gaussian Vectors in Coherent MIMO Radar. IEEE Transactions on Vehicular Technology, 67(7), 5868–5882. bibtex: '@article{Xiao_Huang_Zhang_Xie_So_2018, title={Performance Analysis of Locally Most Powerful Invariant Test for Sphericity of Gaussian Vectors in Coherent MIMO Radar}, volume={67}, number={7}, journal={IEEE Transactions on Vehicular Technology}, author={Xiao, Y-.H. and Huang, L. and Zhang, J-.K. and Xie, J. and So, H. C.}, year={2018}, pages={5868–5882} }' chicago: 'Xiao, Y-.H., L. Huang, J-.K. Zhang, J. Xie, and H. C. So. “Performance Analysis of Locally Most Powerful Invariant Test for Sphericity of Gaussian Vectors in Coherent MIMO Radar.” IEEE Transactions on Vehicular Technology 67, no. 7 (2018): 5868–5882.' ieee: Y.-. H. Xiao, L. Huang, J.-. K. Zhang, J. Xie, and H. C. So, “Performance Analysis of Locally Most Powerful Invariant Test for Sphericity of Gaussian Vectors in Coherent MIMO Radar,” IEEE Transactions on Vehicular Technology, vol. 67, no. 7, pp. 5868–5882, 2018. mla: Xiao, Y. .. H., et al. “Performance Analysis of Locally Most Powerful Invariant Test for Sphericity of Gaussian Vectors in Coherent MIMO Radar.” IEEE Transactions on Vehicular Technology, vol. 67, no. 7, 2018, pp. 5868–5882. short: Y.-. H. Xiao, L. Huang, J.-. K. Zhang, J. Xie, H.C. So, IEEE Transactions on Vehicular Technology 67 (2018) 5868–5882. date_created: 2023-01-30T11:51:39Z date_updated: 2023-01-30T12:02:55Z department: - _id: '263' intvolume: ' 67' issue: '7' page: 5868–5882 publication: IEEE Transactions on Vehicular Technology status: public title: Performance Analysis of Locally Most Powerful Invariant Test for Sphericity of Gaussian Vectors in Coherent MIMO Radar type: journal_article user_id: '43497' volume: 67 year: '2018' ... --- _id: '40697' author: - first_name: Ignacio full_name: Santamaria, Ignacio last_name: Santamaria - first_name: Pedro M. full_name: Crespo, Pedro M. last_name: Crespo - first_name: Christian full_name: Lameiro, Christian last_name: Lameiro - first_name: Peter J. full_name: Schreier, Peter J. last_name: Schreier citation: ama: Santamaria I, Crespo PM, Lameiro C, Schreier PJ. Information-Theoretic Analysis of a Family of Improper Discrete Constellations. Entropy. 2018;20(1). doi:10.3390/e20010045 apa: Santamaria, I., Crespo, P. M., Lameiro, C., & Schreier, P. J. (2018). Information-Theoretic Analysis of a Family of Improper Discrete Constellations. Entropy, 20(1). https://doi.org/10.3390/e20010045 bibtex: '@article{Santamaria_Crespo_Lameiro_Schreier_2018, title={Information-Theoretic Analysis of a Family of Improper Discrete Constellations}, volume={20}, DOI={10.3390/e20010045}, number={1}, journal={Entropy}, author={Santamaria, Ignacio and Crespo, Pedro M. and Lameiro, Christian and Schreier, Peter J.}, year={2018} }' chicago: Santamaria, Ignacio, Pedro M. Crespo, Christian Lameiro, and Peter J. Schreier. “Information-Theoretic Analysis of a Family of Improper Discrete Constellations.” Entropy 20, no. 1 (2018). https://doi.org/10.3390/e20010045. ieee: 'I. Santamaria, P. M. Crespo, C. Lameiro, and P. J. Schreier, “Information-Theoretic Analysis of a Family of Improper Discrete Constellations,” Entropy, vol. 20, no. 1, 2018, doi: 10.3390/e20010045.' mla: Santamaria, Ignacio, et al. “Information-Theoretic Analysis of a Family of Improper Discrete Constellations.” Entropy, vol. 20, no. 1, 2018, doi:10.3390/e20010045. short: I. Santamaria, P.M. Crespo, C. Lameiro, P.J. Schreier, Entropy 20 (2018). date_created: 2023-01-30T11:51:39Z date_updated: 2023-01-30T12:02:53Z department: - _id: '263' doi: 10.3390/e20010045 intvolume: ' 20' issue: '1' publication: Entropy status: public title: Information-Theoretic Analysis of a Family of Improper Discrete Constellations type: journal_article user_id: '43497' volume: 20 year: '2018' ... --- _id: '40694' author: - first_name: A. full_name: Eguizabal, A. last_name: Eguizabal - first_name: P. J. full_name: Schreier, P. J. last_name: Schreier - first_name: D. full_name: Ramírez, D. last_name: Ramírez citation: ama: 'Eguizabal A, Schreier PJ, Ramírez D. MODEL-ORDER SELECTION IN STATISTICAL SHAPE MODELS. In: 2018 IEEE 28th International Workshop on Machine Learning for Signal Processing (MLSP). ; 2018:1–6. doi:10.1109/MLSP.2018.8516941' apa: Eguizabal, A., Schreier, P. J., & Ramírez, D. (2018). MODEL-ORDER SELECTION IN STATISTICAL SHAPE MODELS. 2018 IEEE 28th International Workshop on Machine Learning for Signal Processing (MLSP), 1–6. https://doi.org/10.1109/MLSP.2018.8516941 bibtex: '@inproceedings{Eguizabal_Schreier_Ramírez_2018, title={MODEL-ORDER SELECTION IN STATISTICAL SHAPE MODELS}, DOI={10.1109/MLSP.2018.8516941}, booktitle={2018 IEEE 28th International Workshop on Machine Learning for Signal Processing (MLSP)}, author={Eguizabal, A. and Schreier, P. J. and Ramírez, D.}, year={2018}, pages={1–6} }' chicago: Eguizabal, A., P. J. Schreier, and D. Ramírez. “MODEL-ORDER SELECTION IN STATISTICAL SHAPE MODELS.” In 2018 IEEE 28th International Workshop on Machine Learning for Signal Processing (MLSP), 1–6, 2018. https://doi.org/10.1109/MLSP.2018.8516941. ieee: 'A. Eguizabal, P. J. Schreier, and D. Ramírez, “MODEL-ORDER SELECTION IN STATISTICAL SHAPE MODELS,” in 2018 IEEE 28th International Workshop on Machine Learning for Signal Processing (MLSP), 2018, pp. 1–6, doi: 10.1109/MLSP.2018.8516941.' mla: Eguizabal, A., et al. “MODEL-ORDER SELECTION IN STATISTICAL SHAPE MODELS.” 2018 IEEE 28th International Workshop on Machine Learning for Signal Processing (MLSP), 2018, pp. 1–6, doi:10.1109/MLSP.2018.8516941. short: 'A. Eguizabal, P.J. Schreier, D. Ramírez, in: 2018 IEEE 28th International Workshop on Machine Learning for Signal Processing (MLSP), 2018, pp. 1–6.' date_created: 2023-01-30T11:51:38Z date_updated: 2023-01-30T12:02:42Z department: - _id: '263' doi: 10.1109/MLSP.2018.8516941 page: 1–6 publication: 2018 IEEE 28th International Workshop on Machine Learning for Signal Processing (MLSP) status: public title: MODEL-ORDER SELECTION IN STATISTICAL SHAPE MODELS type: conference user_id: '43497' year: '2018' ... --- _id: '40696' author: - first_name: S. full_name: Smirnov, S. last_name: Smirnov - first_name: A. full_name: Eguizabal, A. last_name: Eguizabal citation: ama: 'Smirnov S, Eguizabal A. DEEP LEARNING FOR OBJECT DETECTION IN FINE-ART PAINTINGS. In: 2018 IEEE International Conference on Metrology for Archaeology and Cultural Heritage. ; 2018.' apa: Smirnov, S., & Eguizabal, A. (2018). DEEP LEARNING FOR OBJECT DETECTION IN FINE-ART PAINTINGS. 2018 IEEE International Conference on Metrology for Archaeology and Cultural Heritage. bibtex: '@inproceedings{Smirnov_Eguizabal_2018, title={DEEP LEARNING FOR OBJECT DETECTION IN FINE-ART PAINTINGS}, booktitle={2018 IEEE International Conference on Metrology for Archaeology and Cultural Heritage}, author={Smirnov, S. and Eguizabal, A.}, year={2018} }' chicago: Smirnov, S., and A. Eguizabal. “DEEP LEARNING FOR OBJECT DETECTION IN FINE-ART PAINTINGS.” In 2018 IEEE International Conference on Metrology for Archaeology and Cultural Heritage, 2018. ieee: S. Smirnov and A. Eguizabal, “DEEP LEARNING FOR OBJECT DETECTION IN FINE-ART PAINTINGS,” 2018. mla: Smirnov, S., and A. Eguizabal. “DEEP LEARNING FOR OBJECT DETECTION IN FINE-ART PAINTINGS.” 2018 IEEE International Conference on Metrology for Archaeology and Cultural Heritage, 2018. short: 'S. Smirnov, A. Eguizabal, in: 2018 IEEE International Conference on Metrology for Archaeology and Cultural Heritage, 2018.' date_created: 2023-01-30T11:51:38Z date_updated: 2023-01-30T12:02:40Z department: - _id: '263' publication: 2018 IEEE International Conference on Metrology for Archaeology and Cultural Heritage status: public title: DEEP LEARNING FOR OBJECT DETECTION IN FINE-ART PAINTINGS type: conference user_id: '43497' year: '2018' ... --- _id: '40706' author: - first_name: Christian full_name: Lameiro, Christian last_name: Lameiro - first_name: Ignacio full_name: Santamaria, Ignacio last_name: Santamaria - first_name: Peter J. full_name: Schreier, Peter J. last_name: Schreier citation: ama: 'Lameiro C, Santamaria I, Schreier PJ. Performance analysis of maximally improper signaling for multiple-antenna systems. In: Proc. IEEE Wireless Comm. Networking Conf. (WCNC). ; 2018.' apa: Lameiro, C., Santamaria, I., & Schreier, P. J. (2018). Performance analysis of maximally improper signaling for multiple-antenna systems. Proc. IEEE Wireless Comm. Networking Conf. (WCNC). bibtex: '@inproceedings{Lameiro_Santamaria_Schreier_2018, place={Barcelona, Spain}, title={Performance analysis of maximally improper signaling for multiple-antenna systems}, booktitle={Proc. IEEE Wireless Comm. Networking Conf. (WCNC)}, author={Lameiro, Christian and Santamaria, Ignacio and Schreier, Peter J.}, year={2018} }' chicago: Lameiro, Christian, Ignacio Santamaria, and Peter J. Schreier. “Performance Analysis of Maximally Improper Signaling for Multiple-Antenna Systems.” In Proc. IEEE Wireless Comm. Networking Conf. (WCNC). Barcelona, Spain, 2018. ieee: C. Lameiro, I. Santamaria, and P. J. Schreier, “Performance analysis of maximally improper signaling for multiple-antenna systems,” 2018. mla: Lameiro, Christian, et al. “Performance Analysis of Maximally Improper Signaling for Multiple-Antenna Systems.” Proc. IEEE Wireless Comm. Networking Conf. (WCNC), 2018. short: 'C. Lameiro, I. Santamaria, P.J. Schreier, in: Proc. IEEE Wireless Comm. Networking Conf. (WCNC), Barcelona, Spain, 2018.' date_created: 2023-01-30T11:51:40Z date_updated: 2023-01-30T12:03:17Z department: - _id: '263' place: Barcelona, Spain publication: Proc. IEEE Wireless Comm. Networking Conf. (WCNC) status: public title: Performance analysis of maximally improper signaling for multiple-antenna systems type: conference user_id: '43497' year: '2018' ... --- _id: '42214' author: - first_name: P. K. full_name: Mishra, P. K. last_name: Mishra - first_name: D. full_name: Chatterjee, D. last_name: Chatterjee - first_name: D. E. full_name: Quevedo, D. E. last_name: Quevedo citation: ama: Mishra PK, Chatterjee D, Quevedo DE. Sparse and constrained stochastic predictive control for networked systems. Automatica. 2018;87(1):40–51. apa: Mishra, P. K., Chatterjee, D., & Quevedo, D. E. (2018). Sparse and constrained stochastic predictive control for networked systems. Automatica, 87(1), 40–51. bibtex: '@article{Mishra_Chatterjee_Quevedo_2018, title={Sparse and constrained stochastic predictive control for networked systems}, volume={87}, number={1}, journal={Automatica}, author={Mishra, P. K. and Chatterjee, D. and Quevedo, D. E.}, year={2018}, pages={40–51} }' chicago: 'Mishra, P. K., D. Chatterjee, and D. E. Quevedo. “Sparse and Constrained Stochastic Predictive Control for Networked Systems.” Automatica 87, no. 1 (2018): 40–51.' ieee: P. K. Mishra, D. Chatterjee, and D. E. Quevedo, “Sparse and constrained stochastic predictive control for networked systems,” Automatica, vol. 87, no. 1, pp. 40–51, 2018. mla: Mishra, P. K., et al. “Sparse and Constrained Stochastic Predictive Control for Networked Systems.” Automatica, vol. 87, no. 1, 2018, pp. 40–51. short: P.K. Mishra, D. Chatterjee, D.E. Quevedo, Automatica 87 (2018) 40–51. date_created: 2023-02-17T13:58:58Z date_updated: 2023-02-17T14:01:27Z department: - _id: '57' intvolume: ' 87' issue: '1' language: - iso: eng page: 40–51 publication: Automatica status: public title: Sparse and constrained stochastic predictive control for networked systems type: journal_article user_id: '238' volume: 87 year: '2018' ... --- _id: '42216' author: - first_name: A. M. full_name: L\’opez, A. M. last_name: L\’opez - first_name: D. E. full_name: Quevedo, D. E. last_name: Quevedo - first_name: R. P. full_name: Aguilera, R. P. last_name: Aguilera - first_name: T. full_name: Geyer, T. last_name: Geyer - first_name: N. full_name: Oikonomou, N. last_name: Oikonomou citation: ama: L\’opez AM, Quevedo DE, Aguilera RP, Geyer T, Oikonomou N. Limitations and Accuracy of a Continuous Reduced-Order Model for Modular Multilevel Converters. Trans Power Electron. 2018;33(7):6292–6303. apa: L\’opez, A. M., Quevedo, D. E., Aguilera, R. P., Geyer, T., & Oikonomou, N. (2018). Limitations and Accuracy of a Continuous Reduced-Order Model for Modular Multilevel Converters. Trans. Power Electron., 33(7), 6292–6303. bibtex: '@article{L\’opez_Quevedo_Aguilera_Geyer_Oikonomou_2018, title={Limitations and Accuracy of a Continuous Reduced-Order Model for Modular Multilevel Converters}, volume={33}, number={7}, journal={Trans. Power Electron.}, author={L\’opez, A. M. and Quevedo, D. E. and Aguilera, R. P. and Geyer, T. and Oikonomou, N.}, year={2018}, pages={6292–6303} }' chicago: 'L\’opez, A. M., D. E. Quevedo, R. P. Aguilera, T. Geyer, and N. Oikonomou. “Limitations and Accuracy of a Continuous Reduced-Order Model for Modular Multilevel Converters.” Trans. Power Electron. 33, no. 7 (2018): 6292–6303.' ieee: A. M. L\’opez, D. E. Quevedo, R. P. Aguilera, T. Geyer, and N. Oikonomou, “Limitations and Accuracy of a Continuous Reduced-Order Model for Modular Multilevel Converters,” Trans. Power Electron., vol. 33, no. 7, pp. 6292–6303, 2018. mla: L\’opez, A. M., et al. “Limitations and Accuracy of a Continuous Reduced-Order Model for Modular Multilevel Converters.” Trans. Power Electron., vol. 33, no. 7, 2018, pp. 6292–6303. short: A.M. L\’opez, D.E. Quevedo, R.P. Aguilera, T. Geyer, N. Oikonomou, Trans. Power Electron. 33 (2018) 6292–6303. date_created: 2023-02-17T14:34:07Z date_updated: 2023-02-17T14:38:53Z department: - _id: '57' intvolume: ' 33' issue: '7' language: - iso: eng page: 6292–6303 publication: Trans. Power Electron. status: public title: Limitations and Accuracy of a Continuous Reduced-Order Model for Modular Multilevel Converters type: journal_article user_id: '238' volume: 33 year: '2018' ... --- _id: '42219' author: - first_name: B. full_name: Demirel, B. last_name: Demirel - first_name: E. full_name: Ghadimi, E. last_name: Ghadimi - first_name: D. E. full_name: Quevedo, D. E. last_name: Quevedo - first_name: M. full_name: Johansson, M. last_name: Johansson citation: ama: 'Demirel B, Ghadimi E, Quevedo DE, Johansson M. Optimal control of linear systems with limited control actions: threshold-based event-triggered control. Trans Contr Network Syst. 2018;5(3):1275–1286.' apa: 'Demirel, B., Ghadimi, E., Quevedo, D. E., & Johansson, M. (2018). Optimal control of linear systems with limited control actions: threshold-based event-triggered control. Trans. Contr. Network Syst., 5(3), 1275–1286.' bibtex: '@article{Demirel_Ghadimi_Quevedo_Johansson_2018, title={Optimal control of linear systems with limited control actions: threshold-based event-triggered control}, volume={5}, number={3}, journal={Trans. Contr. Network Syst.}, author={Demirel, B. and Ghadimi, E. and Quevedo, D. E. and Johansson, M.}, year={2018}, pages={1275–1286} }' chicago: 'Demirel, B., E. Ghadimi, D. E. Quevedo, and M. Johansson. “Optimal Control of Linear Systems with Limited Control Actions: Threshold-Based Event-Triggered Control.” Trans. Contr. Network Syst. 5, no. 3 (2018): 1275–1286.' ieee: 'B. Demirel, E. Ghadimi, D. E. Quevedo, and M. Johansson, “Optimal control of linear systems with limited control actions: threshold-based event-triggered control,” Trans. Contr. Network Syst., vol. 5, no. 3, pp. 1275–1286, 2018.' mla: 'Demirel, B., et al. “Optimal Control of Linear Systems with Limited Control Actions: Threshold-Based Event-Triggered Control.” Trans. Contr. Network Syst., vol. 5, no. 3, 2018, pp. 1275–1286.' short: B. Demirel, E. Ghadimi, D.E. Quevedo, M. Johansson, Trans. Contr. Network Syst. 5 (2018) 1275–1286. date_created: 2023-02-17T14:34:41Z date_updated: 2023-02-17T14:38:43Z department: - _id: '57' intvolume: ' 5' issue: '3' language: - iso: eng page: 1275–1286 publication: Trans. Contr. Network Syst. status: public title: 'Optimal control of linear systems with limited control actions: threshold-based event-triggered control' type: journal_article user_id: '238' volume: 5 year: '2018' ... --- _id: '42218' author: - first_name: B. full_name: Demirel, B. last_name: Demirel - first_name: A. full_name: Ramaswamy, A. last_name: Ramaswamy - first_name: D. E. full_name: Quevedo, D. E. last_name: Quevedo - first_name: H. full_name: Karl, H. last_name: Karl citation: ama: 'Demirel B, Ramaswamy A, Quevedo DE, Karl H. DeepCAS: A Deep Reinforcement Learning Algorithm for Control-Aware Scheduling. IEEE Contr Syst Lett. 2018;2(4):737–742.' apa: 'Demirel, B., Ramaswamy, A., Quevedo, D. E., & Karl, H. (2018). DeepCAS: A Deep Reinforcement Learning Algorithm for Control-Aware Scheduling. IEEE Contr. Syst. Lett., 2(4), 737–742.' bibtex: '@article{Demirel_Ramaswamy_Quevedo_Karl_2018, title={DeepCAS: A Deep Reinforcement Learning Algorithm for Control-Aware Scheduling}, volume={2}, number={4}, journal={IEEE Contr. Syst. Lett.}, author={Demirel, B. and Ramaswamy, A. and Quevedo, D. E. and Karl, H.}, year={2018}, pages={737–742} }' chicago: 'Demirel, B., A. Ramaswamy, D. E. Quevedo, and H. Karl. “DeepCAS: A Deep Reinforcement Learning Algorithm for Control-Aware Scheduling.” IEEE Contr. Syst. Lett. 2, no. 4 (2018): 737–742.' ieee: 'B. Demirel, A. Ramaswamy, D. E. Quevedo, and H. Karl, “DeepCAS: A Deep Reinforcement Learning Algorithm for Control-Aware Scheduling,” IEEE Contr. Syst. Lett., vol. 2, no. 4, pp. 737–742, 2018.' mla: 'Demirel, B., et al. “DeepCAS: A Deep Reinforcement Learning Algorithm for Control-Aware Scheduling.” IEEE Contr. Syst. Lett., vol. 2, no. 4, 2018, pp. 737–742.' short: B. Demirel, A. Ramaswamy, D.E. Quevedo, H. Karl, IEEE Contr. Syst. Lett. 2 (2018) 737–742. date_created: 2023-02-17T14:34:32Z date_updated: 2023-02-17T14:38:46Z department: - _id: '57' intvolume: ' 2' issue: '4' language: - iso: eng page: 737–742 publication: IEEE Contr. Syst. Lett. status: public title: 'DeepCAS: A Deep Reinforcement Learning Algorithm for Control-Aware Scheduling' type: journal_article user_id: '238' volume: 2 year: '2018' ... --- _id: '42217' author: - first_name: A. full_name: Leong, A. last_name: Leong - first_name: S. full_name: Dey, S. last_name: Dey - first_name: D. E. full_name: Quevedo, D. E. last_name: Quevedo citation: ama: Leong A, Dey S, Quevedo DE. Transmission scheduling for remote state estimation and control with an energy harvesting sensor. Automatica. 2018;91(5):54–60. apa: Leong, A., Dey, S., & Quevedo, D. E. (2018). Transmission scheduling for remote state estimation and control with an energy harvesting sensor. Automatica, 91(5), 54–60. bibtex: '@article{Leong_Dey_Quevedo_2018, title={Transmission scheduling for remote state estimation and control with an energy harvesting sensor}, volume={91}, number={5}, journal={Automatica}, author={Leong, A. and Dey, S. and Quevedo, D. E.}, year={2018}, pages={54–60} }' chicago: 'Leong, A., S. Dey, and D. E. Quevedo. “Transmission Scheduling for Remote State Estimation and Control with an Energy Harvesting Sensor.” Automatica 91, no. 5 (2018): 54–60.' ieee: A. Leong, S. Dey, and D. E. Quevedo, “Transmission scheduling for remote state estimation and control with an energy harvesting sensor,” Automatica, vol. 91, no. 5, pp. 54–60, 2018. mla: Leong, A., et al. “Transmission Scheduling for Remote State Estimation and Control with an Energy Harvesting Sensor.” Automatica, vol. 91, no. 5, 2018, pp. 54–60. short: A. Leong, S. Dey, D.E. Quevedo, Automatica 91 (2018) 54–60. date_created: 2023-02-17T14:34:20Z date_updated: 2023-02-17T14:38:50Z department: - _id: '57' intvolume: ' 91' issue: '5' language: - iso: eng page: 54–60 publication: Automatica status: public title: Transmission scheduling for remote state estimation and control with an energy harvesting sensor type: journal_article user_id: '238' volume: 91 year: '2018' ... --- _id: '42215' author: - first_name: S. full_name: Liu, S. last_name: Liu - first_name: L. full_name: Xie, L. last_name: Xie - first_name: D. E. full_name: Quevedo, D. E. last_name: Quevedo citation: ama: Liu S, Xie L, Quevedo DE. Event-Triggered Quantized Communication-Based Distributed Convex Optimization. Trans Contr Network Syst. 2018;5(1):167–178. apa: Liu, S., Xie, L., & Quevedo, D. E. (2018). Event-Triggered Quantized Communication-Based Distributed Convex Optimization. Trans. Contr. Network Syst., 5(1), 167–178. bibtex: '@article{Liu_Xie_Quevedo_2018, title={Event-Triggered Quantized Communication-Based Distributed Convex Optimization}, volume={5}, number={1}, journal={Trans. Contr. Network Syst.}, author={Liu, S. and Xie, L. and Quevedo, D. E.}, year={2018}, pages={167–178} }' chicago: 'Liu, S., L. Xie, and D. E. Quevedo. “Event-Triggered Quantized Communication-Based Distributed Convex Optimization.” Trans. Contr. Network Syst. 5, no. 1 (2018): 167–178.' ieee: S. Liu, L. Xie, and D. E. Quevedo, “Event-Triggered Quantized Communication-Based Distributed Convex Optimization,” Trans. Contr. Network Syst., vol. 5, no. 1, pp. 167–178, 2018. mla: Liu, S., et al. “Event-Triggered Quantized Communication-Based Distributed Convex Optimization.” Trans. Contr. Network Syst., vol. 5, no. 1, 2018, pp. 167–178. short: S. Liu, L. Xie, D.E. Quevedo, Trans. Contr. Network Syst. 5 (2018) 167–178. date_created: 2023-02-17T14:33:58Z date_updated: 2023-02-17T14:38:57Z department: - _id: '57' intvolume: ' 5' issue: '1' language: - iso: eng page: 167–178 publication: Trans. Contr. Network Syst. status: public title: Event-Triggered Quantized Communication-Based Distributed Convex Optimization type: journal_article user_id: '238' volume: 5 year: '2018' ... --- _id: '8162' abstract: - lang: eng text: 'The constraint satisfaction problems k-SAT and Quantum k-SAT (k-QSAT) are canonical NP-complete and QMA_1-complete problems (for k >= 3), respectively, where QMA_1 is a quantum generalization of NP with one-sided error. Whereas k-SAT has been well-studied for special tractable cases, as well as from a parameterized complexity perspective, much less is known in similar settings for k-QSAT. Here, we study the open problem of computing satisfying assignments to k-QSAT instances which have a "matching" or "dimer covering"; this is an NP problem whose decision variant is trivial, but whose search complexity remains open. Our results fall into three directions, all of which relate to the "matching" setting: (1) We give a polynomial-time classical algorithm for k-QSAT when all qubits occur in at most two clauses. (2) We give a parameterized algorithm for k-QSAT instances from a certain non-trivial class, which allows us to obtain exponential speedups over brute force methods in some cases by reducing the problem to solving for a single root of a single univariate polynomial. (3) We conduct a structural graph theoretic study of 3-QSAT interaction graphs which have a "matching". We remark that the results of (2), in particular, introduce a number of new tools to the study of Quantum SAT, including graph theoretic concepts such as transfer filtrations and blow-ups from algebraic geometry; we hope these prove useful elsewhere.' author: - first_name: Marco full_name: Aldi, Marco last_name: Aldi - first_name: Niel full_name: de Beaudrap, Niel last_name: de Beaudrap - first_name: Sevag full_name: Gharibian, Sevag id: '71541' last_name: Gharibian orcid: 0000-0002-9992-3379 - first_name: Seyran full_name: Saeedi, Seyran last_name: Saeedi citation: ama: 'Aldi M, de Beaudrap N, Gharibian S, Saeedi S. On Efficiently Solvable Cases of Quantum k-SAT. In: Potapov I, Spirakis P, Worrell J, eds. 43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018). Vol 117. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik; 2018:38:1-38:16. doi:10.4230/LIPIcs.MFCS.2018.38' apa: Aldi, M., de Beaudrap, N., Gharibian, S., & Saeedi, S. (2018). On Efficiently Solvable Cases of Quantum k-SAT. In I. Potapov, P. Spirakis, & J. Worrell (Eds.), 43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018) (Vol. 117, p. 38:1-38:16). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2018.38 bibtex: '@inproceedings{Aldi_de Beaudrap_Gharibian_Saeedi_2018, place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={On Efficiently Solvable Cases of Quantum k-SAT}, volume={117}, DOI={10.4230/LIPIcs.MFCS.2018.38}, booktitle={43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)}, publisher={Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}, author={Aldi, Marco and de Beaudrap, Niel and Gharibian, Sevag and Saeedi, Seyran}, editor={Potapov, Igor and Spirakis, Paul and Worrell, James}, year={2018}, pages={38:1-38:16}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }' chicago: 'Aldi, Marco, Niel de Beaudrap, Sevag Gharibian, and Seyran Saeedi. “On Efficiently Solvable Cases of Quantum K-SAT.” In 43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018), edited by Igor Potapov, Paul Spirakis, and James Worrell, 117:38:1-38:16. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. https://doi.org/10.4230/LIPIcs.MFCS.2018.38.' ieee: 'M. Aldi, N. de Beaudrap, S. Gharibian, and S. Saeedi, “On Efficiently Solvable Cases of Quantum k-SAT,” in 43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018), Liverpool, UK, 2018, vol. 117, p. 38:1-38:16, doi: 10.4230/LIPIcs.MFCS.2018.38.' mla: Aldi, Marco, et al. “On Efficiently Solvable Cases of Quantum K-SAT.” 43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018), edited by Igor Potapov et al., vol. 117, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018, p. 38:1-38:16, doi:10.4230/LIPIcs.MFCS.2018.38. short: 'M. Aldi, N. de Beaudrap, S. Gharibian, S. Saeedi, in: I. Potapov, P. Spirakis, J. Worrell (Eds.), 43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2018, p. 38:1-38:16.' conference: location: Liverpool, UK name: 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018) date_created: 2019-03-01T11:34:41Z date_updated: 2023-02-28T11:01:16Z department: - _id: '623' - _id: '7' doi: 10.4230/LIPIcs.MFCS.2018.38 editor: - first_name: Igor full_name: Potapov, Igor last_name: Potapov - first_name: Paul full_name: Spirakis, Paul last_name: Spirakis - first_name: James full_name: Worrell, James last_name: Worrell external_id: arxiv: - '1712.09617' intvolume: ' 117' keyword: - search complexity - local Hamiltonian - Quantum SAT - algebraic geometry language: - iso: eng main_file_link: - open_access: '1' url: http://drops.dagstuhl.de/opus/volltexte/2018/9620/ oa: '1' page: 38:1-38:16 place: Dagstuhl, Germany publication: 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018) publication_identifier: unknown: - 978-3-95977-086-6 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik series_title: Leibniz International Proceedings in Informatics (LIPIcs) status: public title: On Efficiently Solvable Cases of Quantum k-SAT type: conference user_id: '71541' volume: 117 year: '2018' ... --- _id: '8161' abstract: - lang: eng text: The polynomial-time hierarchy (PH) has proven to be a powerful tool for providing separations in computational complexity theory (modulo standard conjectures such as PH does not collapse). Here, we study whether two quantum generalizations of PH can similarly prove separations in the quantum setting. The first generalization, QCPH, uses classical proofs, and the second, QPH, uses quantum proofs. For the former, we show quantum variants of the Karp-Lipton theorem and Toda's theorem. For the latter, we place its third level, Q Sigma_3, into NEXP using the Ellipsoid Method for efficiently solving semidefinite programs. These results yield two implications for QMA(2), the variant of Quantum Merlin-Arthur (QMA) with two unentangled proofs, a complexity class whose characterization has proven difficult. First, if QCPH=QPH (i.e., alternating quantifiers are sufficiently powerful so as to make classical and quantum proofs "equivalent"), then QMA(2) is in the Counting Hierarchy (specifically, in P^{PP^{PP}}). Second, unless QMA(2)= Q Sigma_3 (i.e., alternating quantifiers do not help in the presence of "unentanglement"), QMA(2) is strictly contained in NEXP. author: - first_name: Sevag full_name: Gharibian, Sevag id: '71541' last_name: Gharibian orcid: 0000-0002-9992-3379 - first_name: Miklos full_name: Santha, Miklos last_name: Santha - first_name: Jamie full_name: Sikora, Jamie last_name: Sikora - first_name: Aarthi full_name: Sundaram, Aarthi last_name: Sundaram - first_name: Justin full_name: Yirka, Justin last_name: Yirka citation: ama: 'Gharibian S, Santha M, Sikora J, Sundaram A, Yirka J. Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2). In: Potapov I, Spirakis P, Worrell J, eds. 43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018). Vol 117. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik; 2018:58:1-58:16. doi:10.4230/LIPIcs.MFCS.2018.58' apa: Gharibian, S., Santha, M., Sikora, J., Sundaram, A., & Yirka, J. (2018). Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2). In I. Potapov, P. Spirakis, & J. Worrell (Eds.), 43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018) (Vol. 117, p. 58:1-58:16). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2018.58 bibtex: '@inproceedings{Gharibian_Santha_Sikora_Sundaram_Yirka_2018, place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2)}, volume={117}, DOI={10.4230/LIPIcs.MFCS.2018.58}, booktitle={43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018)}, publisher={Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}, author={Gharibian, Sevag and Santha, Miklos and Sikora, Jamie and Sundaram, Aarthi and Yirka, Justin}, editor={Potapov, Igor and Spirakis, Paul and Worrell, James}, year={2018}, pages={58:1-58:16}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }' chicago: 'Gharibian, Sevag, Miklos Santha, Jamie Sikora, Aarthi Sundaram, and Justin Yirka. “Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2).” In 43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018), edited by Igor Potapov, Paul Spirakis, and James Worrell, 117:58:1-58:16. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. https://doi.org/10.4230/LIPIcs.MFCS.2018.58.' ieee: 'S. Gharibian, M. Santha, J. Sikora, A. Sundaram, and J. Yirka, “Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2),” in 43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018), Liverpool, UK, 2018, vol. 117, p. 58:1-58:16, doi: 10.4230/LIPIcs.MFCS.2018.58.' mla: Gharibian, Sevag, et al. “Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2).” 43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018), edited by Igor Potapov et al., vol. 117, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018, p. 58:1-58:16, doi:10.4230/LIPIcs.MFCS.2018.58. short: 'S. Gharibian, M. Santha, J. Sikora, A. Sundaram, J. Yirka, in: I. Potapov, P. Spirakis, J. Worrell (Eds.), 43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2018, p. 58:1-58:16.' conference: location: Liverpool, UK name: 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018) date_created: 2019-03-01T11:29:44Z date_updated: 2023-02-28T11:01:03Z department: - _id: '623' - _id: '7' doi: 10.4230/LIPIcs.MFCS.2018.58 editor: - first_name: Igor full_name: Potapov, Igor last_name: Potapov - first_name: Paul full_name: Spirakis, Paul last_name: Spirakis - first_name: James full_name: Worrell, James last_name: Worrell external_id: arxiv: - '1805.11139' intvolume: ' 117' keyword: - Complexity Theory - Quantum Computing - Polynomial Hierarchy - Semidefinite Programming - QMA(2) - Quantum Complexity language: - iso: eng main_file_link: - open_access: '1' url: http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=9640 oa: '1' page: 58:1-58:16 place: Dagstuhl, Germany publication: 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018) publication_identifier: unknown: - 978-3-95977-086-6 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik series_title: Leibniz International Proceedings in Informatics (LIPIcs) status: public title: Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2) type: conference user_id: '71541' volume: 117 year: '2018' ... --- _id: '8160' abstract: - lang: eng text: An important task in quantum physics is the estimation of local quantities for ground states of local Hamiltonians. Recently, Ambainis defined the complexity class P^QMA[log], and motivated its study by showing that the physical task of estimating the expectation value of a local observable against the ground state of a local Hamiltonian is P^QMA[log]-complete. In this paper, we continue the study of P^QMA[log], obtaining the following results. The P^QMA[log]-completeness result of Ambainis requires O(log n)-local observ- ables and Hamiltonians. We show that simulating even a single qubit measurement on ground states of 5-local Hamiltonians is P^QMA[log]-complete, resolving an open question of Ambainis. We formalize the complexity theoretic study of estimating two-point correlation functions against ground states, and show that this task is similarly P^QMA[log]-complete. P^QMA[log] is thought of as "slightly harder" than QMA. We justify this formally by exploiting the hierarchical voting technique of Beigel, Hemachandra, and Wechsung to show P^QMA[log] \subseteq PP. This improves the containment QMA \subseteq PP from Kitaev and Watrous. A central theme of this work is the subtlety involved in the study of oracle classes in which the oracle solves a promise problem. In this vein, we identify a flaw in Ambainis' prior work regarding a P^UQMA[log]-hardness proof for estimating spectral gaps of local Hamiltonians. By introducing a "query validation" technique, we build on his prior work to obtain P^UQMA[log]-hardness for estimating spectral gaps under polynomial-time Turing reductions. author: - first_name: Sevag full_name: Gharibian, Sevag id: '71541' last_name: Gharibian orcid: 0000-0002-9992-3379 - first_name: Justin full_name: Yirka, Justin last_name: Yirka citation: ama: 'Gharibian S, Yirka J. The Complexity of Simulating Local Measurements on Quantum Systems. In: Wilde M, ed. 12th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2017). Vol 73. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik; 2018:2:1-2:17. doi:10.4230/LIPIcs.TQC.2017.2' apa: Gharibian, S., & Yirka, J. (2018). The Complexity of Simulating Local Measurements on Quantum Systems. In M. Wilde (Ed.), 12th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2017) (Vol. 73, p. 2:1-2:17). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.TQC.2017.2 bibtex: '@inproceedings{Gharibian_Yirka_2018, place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={The Complexity of Simulating Local Measurements on Quantum Systems}, volume={73}, DOI={10.4230/LIPIcs.TQC.2017.2}, booktitle={12th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2017)}, publisher={Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}, author={Gharibian, Sevag and Yirka, Justin}, editor={Wilde, Mark}, year={2018}, pages={2:1-2:17}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }' chicago: 'Gharibian, Sevag, and Justin Yirka. “The Complexity of Simulating Local Measurements on Quantum Systems.” In 12th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2017), edited by Mark Wilde, 73:2:1-2:17. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. https://doi.org/10.4230/LIPIcs.TQC.2017.2.' ieee: 'S. Gharibian and J. Yirka, “The Complexity of Simulating Local Measurements on Quantum Systems,” in 12th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2017), Paris, France, 2018, vol. 73, p. 2:1-2:17, doi: 10.4230/LIPIcs.TQC.2017.2.' mla: Gharibian, Sevag, and Justin Yirka. “The Complexity of Simulating Local Measurements on Quantum Systems.” 12th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2017), edited by Mark Wilde, vol. 73, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018, p. 2:1-2:17, doi:10.4230/LIPIcs.TQC.2017.2. short: 'S. Gharibian, J. Yirka, in: M. Wilde (Ed.), 12th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2017), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2018, p. 2:1-2:17.' conference: location: Paris, France name: 12th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2017) date_created: 2019-03-01T11:25:27Z date_updated: 2023-02-28T11:00:48Z department: - _id: '623' - _id: '7' doi: 10.4230/LIPIcs.TQC.2017.2 editor: - first_name: Mark full_name: Wilde, Mark last_name: Wilde external_id: arxiv: - '1606.05626' intvolume: ' 73' keyword: - Complexity theory - Quantum Merlin Arthur (QMA) - local Hamiltonian - local measurement - spectral gap language: - iso: eng main_file_link: - open_access: '1' url: http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=8577 oa: '1' page: 2:1-2:17 place: Dagstuhl, Germany publication: 12th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2017) publication_identifier: unknown: - 978-3-95977-034-7 publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik series_title: Leibniz International Proceedings in Informatics (LIPIcs) status: public title: The Complexity of Simulating Local Measurements on Quantum Systems type: conference user_id: '71541' volume: 73 year: '2018' ...